./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-cav19/array_tiling_tcpy.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-cav19/array_tiling_tcpy.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 5446997f7b2d7b76d63a39784df785fb06bbab562e365ba547eeee8a855e283e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:26:07,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:26:07,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:26:07,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:26:07,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:26:07,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:26:07,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:26:07,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:26:07,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:26:07,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:26:07,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:26:07,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:26:07,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:26:07,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:26:07,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:26:07,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:26:07,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:26:07,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:26:07,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:26:07,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:26:07,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:26:07,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:26:07,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:26:07,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:26:07,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:26:07,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:26:07,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:26:07,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:26:07,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:26:07,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:26:07,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:26:07,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:26:07,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:26:07,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:26:07,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:26:07,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:26:07,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:26:07,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:26:07,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:26:07,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:26:07,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:26:07,864 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:26:07,888 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:26:07,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:26:07,889 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:26:07,889 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:26:07,890 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:26:07,890 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:26:07,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:26:07,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:26:07,891 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:26:07,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:26:07,892 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:26:07,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:26:07,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:26:07,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:26:07,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:26:07,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:26:07,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:26:07,893 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:26:07,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:26:07,893 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:26:07,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:26:07,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:26:07,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:26:07,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:26:07,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:26:07,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:26:07,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:26:07,895 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:26:07,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:26:07,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:26:07,895 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:26:07,895 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:26:07,896 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:26:07,896 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5446997f7b2d7b76d63a39784df785fb06bbab562e365ba547eeee8a855e283e [2022-02-20 14:26:08,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:26:08,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:26:08,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:26:08,120 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:26:08,120 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:26:08,121 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-cav19/array_tiling_tcpy.c [2022-02-20 14:26:08,170 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46f8d48de/0aff4a1866a94eb988753ac420b4b829/FLAGb9d3c38d5 [2022-02-20 14:26:08,507 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:26:08,508 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_tiling_tcpy.c [2022-02-20 14:26:08,515 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46f8d48de/0aff4a1866a94eb988753ac420b4b829/FLAGb9d3c38d5 [2022-02-20 14:26:08,528 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46f8d48de/0aff4a1866a94eb988753ac420b4b829 [2022-02-20 14:26:08,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:26:08,531 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:26:08,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:26:08,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:26:08,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:26:08,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:26:08" (1/1) ... [2022-02-20 14:26:08,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bca71ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:08, skipping insertion in model container [2022-02-20 14:26:08,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:26:08" (1/1) ... [2022-02-20 14:26:08,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:26:08,554 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:26:08,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_tiling_tcpy.c[408,421] [2022-02-20 14:26:08,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:26:08,738 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:26:08,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_tiling_tcpy.c[408,421] [2022-02-20 14:26:08,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:26:08,779 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:26:08,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:08 WrapperNode [2022-02-20 14:26:08,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:26:08,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:26:08,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:26:08,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:26:08,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:08" (1/1) ... [2022-02-20 14:26:08,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:08" (1/1) ... [2022-02-20 14:26:08,819 INFO L137 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2022-02-20 14:26:08,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:26:08,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:26:08,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:26:08,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:26:08,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:08" (1/1) ... [2022-02-20 14:26:08,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:08" (1/1) ... [2022-02-20 14:26:08,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:08" (1/1) ... [2022-02-20 14:26:08,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:08" (1/1) ... [2022-02-20 14:26:08,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:08" (1/1) ... [2022-02-20 14:26:08,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:08" (1/1) ... [2022-02-20 14:26:08,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:08" (1/1) ... [2022-02-20 14:26:08,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:26:08,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:26:08,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:26:08,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:26:08,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:08" (1/1) ... [2022-02-20 14:26:08,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:26:08,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:08,880 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) [2022-02-20 14:26:08,893 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 [2022-02-20 14:26:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:26:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 14:26:08,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 14:26:08,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:26:08,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:26:08,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:26:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:26:08,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:26:08,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:26:08,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:26:08,962 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:26:08,963 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:26:09,158 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:26:09,163 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:26:09,164 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 14:26:09,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:26:09 BoogieIcfgContainer [2022-02-20 14:26:09,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:26:09,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:26:09,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:26:09,169 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:26:09,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:26:08" (1/3) ... [2022-02-20 14:26:09,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d35bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:26:09, skipping insertion in model container [2022-02-20 14:26:09,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:08" (2/3) ... [2022-02-20 14:26:09,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d35bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:26:09, skipping insertion in model container [2022-02-20 14:26:09,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:26:09" (3/3) ... [2022-02-20 14:26:09,171 INFO L111 eAbstractionObserver]: Analyzing ICFG array_tiling_tcpy.c [2022-02-20 14:26:09,176 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:26:09,176 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:26:09,230 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:26:09,235 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:26:09,235 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:26:09,251 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:09,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:26:09,254 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:09,255 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:09,255 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:09,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:09,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1700606493, now seen corresponding path program 1 times [2022-02-20 14:26:09,273 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:09,274 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892118432] [2022-02-20 14:26:09,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:09,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:09,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:26:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:09,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#true} ~cond := #in~cond; {25#true} is VALID [2022-02-20 14:26:09,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume 0 == ~cond;assume false; {26#false} is VALID [2022-02-20 14:26:09,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#false} assume true; {26#false} is VALID [2022-02-20 14:26:09,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#false} {25#true} #56#return; {26#false} is VALID [2022-02-20 14:26:09,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 14:26:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:09,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#true} ~cond := #in~cond; {25#true} is VALID [2022-02-20 14:26:09,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume 0 == ~cond;assume false; {26#false} is VALID [2022-02-20 14:26:09,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#false} assume true; {26#false} is VALID [2022-02-20 14:26:09,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#false} {26#false} #58#return; {26#false} is VALID [2022-02-20 14:26:09,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-02-20 14:26:09,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#acopy~0#1.base, main_~#acopy~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {25#true} is VALID [2022-02-20 14:26:09,452 INFO L272 TraceCheckUtils]: 2: Hoare triple {25#true} call assume_abort_if_not((if main_~S~0#1 > 1 then 1 else 0)); {25#true} is VALID [2022-02-20 14:26:09,453 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#true} ~cond := #in~cond; {25#true} is VALID [2022-02-20 14:26:09,453 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#true} assume 0 == ~cond;assume false; {26#false} is VALID [2022-02-20 14:26:09,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#false} assume true; {26#false} is VALID [2022-02-20 14:26:09,454 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {26#false} {25#true} #56#return; {26#false} is VALID [2022-02-20 14:26:09,454 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call assume_abort_if_not((if main_~S~0#1 < 1073741823 then 1 else 0)); {25#true} is VALID [2022-02-20 14:26:09,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#true} ~cond := #in~cond; {25#true} is VALID [2022-02-20 14:26:09,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#true} assume 0 == ~cond;assume false; {26#false} is VALID [2022-02-20 14:26:09,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume true; {26#false} is VALID [2022-02-20 14:26:09,457 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {26#false} {26#false} #58#return; {26#false} is VALID [2022-02-20 14:26:09,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {26#false} havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(8 * main_~S~0#1);call main_~#acopy~0#1.base, main_~#acopy~0#1.offset := #Ultimate.allocOnStack(8 * main_~S~0#1);main_~i~0#1 := 0; {26#false} is VALID [2022-02-20 14:26:09,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !true; {26#false} is VALID [2022-02-20 14:26:09,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {26#false} main_~i~0#1 := 0; {26#false} is VALID [2022-02-20 14:26:09,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {26#false} assume !!(main_~i~0#1 < 2 * main_~S~0#1);call main_#t~mem9#1 := read~int(main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {26#false} is VALID [2022-02-20 14:26:09,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {26#false} assume 0 == __VERIFIER_assert_~cond#1; {26#false} is VALID [2022-02-20 14:26:09,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-02-20 14:26:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:26:09,461 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:09,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892118432] [2022-02-20 14:26:09,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892118432] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:26:09,463 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:26:09,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:26:09,464 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105237386] [2022-02-20 14:26:09,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:26:09,469 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 14:26:09,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:09,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:09,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:09,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:26:09,498 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:09,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:26:09,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:26:09,519 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:09,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:09,563 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2022-02-20 14:26:09,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:26:09,564 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 14:26:09,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:09,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2022-02-20 14:26:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:09,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2022-02-20 14:26:09,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 54 transitions. [2022-02-20 14:26:09,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:09,642 INFO L225 Difference]: With dead ends: 41 [2022-02-20 14:26:09,642 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 14:26:09,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:26:09,647 INFO L933 BasicCegarLoop]: 24 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, 24 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 [2022-02-20 14:26:09,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:26:09,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 14:26:09,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 14:26:09,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:09,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:09,668 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:09,669 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:09,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:09,672 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-02-20 14:26:09,672 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-20 14:26:09,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:09,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:09,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-02-20 14:26:09,677 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-02-20 14:26:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:09,682 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-02-20 14:26:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-20 14:26:09,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:09,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:09,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:09,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:09,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:09,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-02-20 14:26:09,691 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 18 [2022-02-20 14:26:09,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:09,692 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-02-20 14:26:09,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-20 14:26:09,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:26:09,693 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:09,693 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:09,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:26:09,694 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:09,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:09,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1364006487, now seen corresponding path program 1 times [2022-02-20 14:26:09,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:09,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003660922] [2022-02-20 14:26:09,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:09,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:09,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:26:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:09,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#true} ~cond := #in~cond; {148#true} is VALID [2022-02-20 14:26:09,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#true} assume !(0 == ~cond); {148#true} is VALID [2022-02-20 14:26:09,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {148#true} assume true; {148#true} is VALID [2022-02-20 14:26:09,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {148#true} {148#true} #56#return; {148#true} is VALID [2022-02-20 14:26:09,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 14:26:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:09,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#true} ~cond := #in~cond; {148#true} is VALID [2022-02-20 14:26:09,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#true} assume !(0 == ~cond); {148#true} is VALID [2022-02-20 14:26:09,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {148#true} assume true; {148#true} is VALID [2022-02-20 14:26:09,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {148#true} {148#true} #58#return; {148#true} is VALID [2022-02-20 14:26:09,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {148#true} is VALID [2022-02-20 14:26:09,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#acopy~0#1.base, main_~#acopy~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {148#true} is VALID [2022-02-20 14:26:09,819 INFO L272 TraceCheckUtils]: 2: Hoare triple {148#true} call assume_abort_if_not((if main_~S~0#1 > 1 then 1 else 0)); {148#true} is VALID [2022-02-20 14:26:09,819 INFO L290 TraceCheckUtils]: 3: Hoare triple {148#true} ~cond := #in~cond; {148#true} is VALID [2022-02-20 14:26:09,819 INFO L290 TraceCheckUtils]: 4: Hoare triple {148#true} assume !(0 == ~cond); {148#true} is VALID [2022-02-20 14:26:09,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {148#true} assume true; {148#true} is VALID [2022-02-20 14:26:09,820 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {148#true} {148#true} #56#return; {148#true} is VALID [2022-02-20 14:26:09,820 INFO L272 TraceCheckUtils]: 7: Hoare triple {148#true} call assume_abort_if_not((if main_~S~0#1 < 1073741823 then 1 else 0)); {148#true} is VALID [2022-02-20 14:26:09,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#true} ~cond := #in~cond; {148#true} is VALID [2022-02-20 14:26:09,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#true} assume !(0 == ~cond); {148#true} is VALID [2022-02-20 14:26:09,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#true} assume true; {148#true} is VALID [2022-02-20 14:26:09,821 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {148#true} {148#true} #58#return; {148#true} is VALID [2022-02-20 14:26:09,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {148#true} havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(8 * main_~S~0#1);call main_~#acopy~0#1.base, main_~#acopy~0#1.offset := #Ultimate.allocOnStack(8 * main_~S~0#1);main_~i~0#1 := 0; {158#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:09,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {158#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < main_~S~0#1); {159#(<= |ULTIMATE.start_main_~S~0#1| 0)} is VALID [2022-02-20 14:26:09,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {159#(<= |ULTIMATE.start_main_~S~0#1| 0)} main_~i~0#1 := 0; {160#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~S~0#1| 0))} is VALID [2022-02-20 14:26:09,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {160#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~S~0#1| 0))} assume !!(main_~i~0#1 < 2 * main_~S~0#1);call main_#t~mem9#1 := read~int(main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {149#false} is VALID [2022-02-20 14:26:09,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {149#false} assume 0 == __VERIFIER_assert_~cond#1; {149#false} is VALID [2022-02-20 14:26:09,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {149#false} assume !false; {149#false} is VALID [2022-02-20 14:26:09,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:26:09,827 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:09,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003660922] [2022-02-20 14:26:09,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003660922] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:26:09,831 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:26:09,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:26:09,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958855693] [2022-02-20 14:26:09,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:26:09,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 14:26:09,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:09,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:26:09,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:09,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:26:09,845 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:09,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:26:09,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:26:09,846 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:26:09,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:09,918 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-02-20 14:26:09,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:26:09,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 14:26:09,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:09,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:26:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 14:26:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:26:09,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 14:26:09,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-02-20 14:26:09,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:09,951 INFO L225 Difference]: With dead ends: 34 [2022-02-20 14:26:09,951 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 14:26:09,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:26:09,952 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:09,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 52 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:26:09,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 14:26:09,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2022-02-20 14:26:09,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:09,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:09,956 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:09,956 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:09,958 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-02-20 14:26:09,958 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-02-20 14:26:09,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:09,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:09,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-02-20 14:26:09,959 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-02-20 14:26:09,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:09,960 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-02-20 14:26:09,961 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-02-20 14:26:09,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:09,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:09,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:09,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:09,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-02-20 14:26:09,962 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 18 [2022-02-20 14:26:09,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:09,963 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-02-20 14:26:09,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:26:09,963 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-02-20 14:26:09,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:26:09,964 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:09,964 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:09,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:26:09,964 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:09,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:09,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1804375691, now seen corresponding path program 1 times [2022-02-20 14:26:09,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:09,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463115765] [2022-02-20 14:26:09,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:09,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:10,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:26:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:10,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {283#true} ~cond := #in~cond; {296#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 14:26:10,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {296#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {297#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:26:10,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {297#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {297#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:26:10,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {297#(not (= |assume_abort_if_not_#in~cond| 0))} {283#true} #56#return; {289#(<= 2 |ULTIMATE.start_main_~S~0#1|)} is VALID [2022-02-20 14:26:10,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 14:26:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:10,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {283#true} ~cond := #in~cond; {283#true} is VALID [2022-02-20 14:26:10,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#true} assume !(0 == ~cond); {283#true} is VALID [2022-02-20 14:26:10,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {283#true} assume true; {283#true} is VALID [2022-02-20 14:26:10,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {283#true} {289#(<= 2 |ULTIMATE.start_main_~S~0#1|)} #58#return; {289#(<= 2 |ULTIMATE.start_main_~S~0#1|)} is VALID [2022-02-20 14:26:10,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {283#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {283#true} is VALID [2022-02-20 14:26:10,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#acopy~0#1.base, main_~#acopy~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {283#true} is VALID [2022-02-20 14:26:10,085 INFO L272 TraceCheckUtils]: 2: Hoare triple {283#true} call assume_abort_if_not((if main_~S~0#1 > 1 then 1 else 0)); {283#true} is VALID [2022-02-20 14:26:10,086 INFO L290 TraceCheckUtils]: 3: Hoare triple {283#true} ~cond := #in~cond; {296#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 14:26:10,086 INFO L290 TraceCheckUtils]: 4: Hoare triple {296#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {297#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:26:10,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {297#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {297#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:26:10,088 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {297#(not (= |assume_abort_if_not_#in~cond| 0))} {283#true} #56#return; {289#(<= 2 |ULTIMATE.start_main_~S~0#1|)} is VALID [2022-02-20 14:26:10,088 INFO L272 TraceCheckUtils]: 7: Hoare triple {289#(<= 2 |ULTIMATE.start_main_~S~0#1|)} call assume_abort_if_not((if main_~S~0#1 < 1073741823 then 1 else 0)); {283#true} is VALID [2022-02-20 14:26:10,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {283#true} ~cond := #in~cond; {283#true} is VALID [2022-02-20 14:26:10,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {283#true} assume !(0 == ~cond); {283#true} is VALID [2022-02-20 14:26:10,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {283#true} assume true; {283#true} is VALID [2022-02-20 14:26:10,089 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {283#true} {289#(<= 2 |ULTIMATE.start_main_~S~0#1|)} #58#return; {289#(<= 2 |ULTIMATE.start_main_~S~0#1|)} is VALID [2022-02-20 14:26:10,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {289#(<= 2 |ULTIMATE.start_main_~S~0#1|)} havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(8 * main_~S~0#1);call main_~#acopy~0#1.base, main_~#acopy~0#1.offset := #Ultimate.allocOnStack(8 * main_~S~0#1);main_~i~0#1 := 0; {294#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_main_~S~0#1|))} is VALID [2022-02-20 14:26:10,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_main_~S~0#1|))} assume !!(main_~i~0#1 < main_~S~0#1);call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (2 * main_~S~0#1 - (1 + main_~i~0#1)), 4);call write~int(main_#t~mem6#1, main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * (2 * main_~S~0#1 - (1 + main_~i~0#1)), 4);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {294#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_main_~S~0#1|))} is VALID [2022-02-20 14:26:10,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_main_~S~0#1|))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {295#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~S~0#1|)} is VALID [2022-02-20 14:26:10,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {295#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~S~0#1|)} assume !(main_~i~0#1 < main_~S~0#1); {284#false} is VALID [2022-02-20 14:26:10,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {284#false} main_~i~0#1 := 0; {284#false} is VALID [2022-02-20 14:26:10,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {284#false} assume !!(main_~i~0#1 < 2 * main_~S~0#1);call main_#t~mem9#1 := read~int(main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {284#false} is VALID [2022-02-20 14:26:10,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {284#false} assume 0 == __VERIFIER_assert_~cond#1; {284#false} is VALID [2022-02-20 14:26:10,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {284#false} assume !false; {284#false} is VALID [2022-02-20 14:26:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:26:10,093 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:10,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463115765] [2022-02-20 14:26:10,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463115765] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:10,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225214793] [2022-02-20 14:26:10,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:10,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:10,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:10,096 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) [2022-02-20 14:26:10,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 14:26:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:10,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:26:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:10,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:10,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {283#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {283#true} is VALID [2022-02-20 14:26:10,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#acopy~0#1.base, main_~#acopy~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {283#true} is VALID [2022-02-20 14:26:10,299 INFO L272 TraceCheckUtils]: 2: Hoare triple {283#true} call assume_abort_if_not((if main_~S~0#1 > 1 then 1 else 0)); {283#true} is VALID [2022-02-20 14:26:10,300 INFO L290 TraceCheckUtils]: 3: Hoare triple {283#true} ~cond := #in~cond; {296#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 14:26:10,300 INFO L290 TraceCheckUtils]: 4: Hoare triple {296#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {297#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:26:10,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {297#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {297#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:26:10,301 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {297#(not (= |assume_abort_if_not_#in~cond| 0))} {283#true} #56#return; {289#(<= 2 |ULTIMATE.start_main_~S~0#1|)} is VALID [2022-02-20 14:26:10,301 INFO L272 TraceCheckUtils]: 7: Hoare triple {289#(<= 2 |ULTIMATE.start_main_~S~0#1|)} call assume_abort_if_not((if main_~S~0#1 < 1073741823 then 1 else 0)); {283#true} is VALID [2022-02-20 14:26:10,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {283#true} ~cond := #in~cond; {283#true} is VALID [2022-02-20 14:26:10,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {283#true} assume !(0 == ~cond); {283#true} is VALID [2022-02-20 14:26:10,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {283#true} assume true; {283#true} is VALID [2022-02-20 14:26:10,302 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {283#true} {289#(<= 2 |ULTIMATE.start_main_~S~0#1|)} #58#return; {289#(<= 2 |ULTIMATE.start_main_~S~0#1|)} is VALID [2022-02-20 14:26:10,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {289#(<= 2 |ULTIMATE.start_main_~S~0#1|)} havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(8 * main_~S~0#1);call main_~#acopy~0#1.base, main_~#acopy~0#1.offset := #Ultimate.allocOnStack(8 * main_~S~0#1);main_~i~0#1 := 0; {337#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_main_~S~0#1|))} is VALID [2022-02-20 14:26:10,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {337#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_main_~S~0#1|))} assume !!(main_~i~0#1 < main_~S~0#1);call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (2 * main_~S~0#1 - (1 + main_~i~0#1)), 4);call write~int(main_#t~mem6#1, main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * (2 * main_~S~0#1 - (1 + main_~i~0#1)), 4);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {337#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_main_~S~0#1|))} is VALID [2022-02-20 14:26:10,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {337#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_main_~S~0#1|))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {344#(and (<= 2 |ULTIMATE.start_main_~S~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:10,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {344#(and (<= 2 |ULTIMATE.start_main_~S~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_~i~0#1 < main_~S~0#1); {284#false} is VALID [2022-02-20 14:26:10,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {284#false} main_~i~0#1 := 0; {284#false} is VALID [2022-02-20 14:26:10,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {284#false} assume !!(main_~i~0#1 < 2 * main_~S~0#1);call main_#t~mem9#1 := read~int(main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {284#false} is VALID [2022-02-20 14:26:10,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {284#false} assume 0 == __VERIFIER_assert_~cond#1; {284#false} is VALID [2022-02-20 14:26:10,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {284#false} assume !false; {284#false} is VALID [2022-02-20 14:26:10,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:26:10,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:10,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {284#false} assume !false; {284#false} is VALID [2022-02-20 14:26:10,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {284#false} assume 0 == __VERIFIER_assert_~cond#1; {284#false} is VALID [2022-02-20 14:26:10,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {284#false} assume !!(main_~i~0#1 < 2 * main_~S~0#1);call main_#t~mem9#1 := read~int(main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {284#false} is VALID [2022-02-20 14:26:10,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {284#false} main_~i~0#1 := 0; {284#false} is VALID [2022-02-20 14:26:10,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {295#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~S~0#1|)} assume !(main_~i~0#1 < main_~S~0#1); {284#false} is VALID [2022-02-20 14:26:10,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {375#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~S~0#1|)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {295#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~S~0#1|)} is VALID [2022-02-20 14:26:10,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {375#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~S~0#1|)} assume !!(main_~i~0#1 < main_~S~0#1);call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (2 * main_~S~0#1 - (1 + main_~i~0#1)), 4);call write~int(main_#t~mem6#1, main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * (2 * main_~S~0#1 - (1 + main_~i~0#1)), 4);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {375#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~S~0#1|)} is VALID [2022-02-20 14:26:10,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {289#(<= 2 |ULTIMATE.start_main_~S~0#1|)} havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(8 * main_~S~0#1);call main_~#acopy~0#1.base, main_~#acopy~0#1.offset := #Ultimate.allocOnStack(8 * main_~S~0#1);main_~i~0#1 := 0; {375#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~S~0#1|)} is VALID [2022-02-20 14:26:10,572 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {283#true} {289#(<= 2 |ULTIMATE.start_main_~S~0#1|)} #58#return; {289#(<= 2 |ULTIMATE.start_main_~S~0#1|)} is VALID [2022-02-20 14:26:10,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {283#true} assume true; {283#true} is VALID [2022-02-20 14:26:10,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {283#true} assume !(0 == ~cond); {283#true} is VALID [2022-02-20 14:26:10,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {283#true} ~cond := #in~cond; {283#true} is VALID [2022-02-20 14:26:10,574 INFO L272 TraceCheckUtils]: 7: Hoare triple {289#(<= 2 |ULTIMATE.start_main_~S~0#1|)} call assume_abort_if_not((if main_~S~0#1 < 1073741823 then 1 else 0)); {283#true} is VALID [2022-02-20 14:26:10,575 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {297#(not (= |assume_abort_if_not_#in~cond| 0))} {283#true} #56#return; {289#(<= 2 |ULTIMATE.start_main_~S~0#1|)} is VALID [2022-02-20 14:26:10,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {297#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {297#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:26:10,576 INFO L290 TraceCheckUtils]: 4: Hoare triple {409#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {297#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:26:10,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {283#true} ~cond := #in~cond; {409#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-02-20 14:26:10,585 INFO L272 TraceCheckUtils]: 2: Hoare triple {283#true} call assume_abort_if_not((if main_~S~0#1 > 1 then 1 else 0)); {283#true} is VALID [2022-02-20 14:26:10,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#acopy~0#1.base, main_~#acopy~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {283#true} is VALID [2022-02-20 14:26:10,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {283#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {283#true} is VALID [2022-02-20 14:26:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:26:10,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225214793] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:10,586 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:26:10,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-02-20 14:26:10,586 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750772866] [2022-02-20 14:26:10,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:10,587 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-02-20 14:26:10,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:10,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:10,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:10,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:26:10,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:10,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:26:10,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:26:10,607 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:10,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:10,807 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-02-20 14:26:10,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:26:10,807 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-02-20 14:26:10,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-02-20 14:26:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-02-20 14:26:10,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-02-20 14:26:10,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:10,844 INFO L225 Difference]: With dead ends: 41 [2022-02-20 14:26:10,844 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 14:26:10,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:26:10,845 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 35 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:10,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 63 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:26:10,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 14:26:10,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2022-02-20 14:26:10,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:10,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:10,855 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:10,855 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:10,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:10,856 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-02-20 14:26:10,856 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-02-20 14:26:10,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:10,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:10,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 34 states. [2022-02-20 14:26:10,857 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 34 states. [2022-02-20 14:26:10,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:10,859 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-02-20 14:26:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-02-20 14:26:10,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:10,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:10,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:10,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:10,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:10,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-02-20 14:26:10,861 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 20 [2022-02-20 14:26:10,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:10,861 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-20 14:26:10,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:10,861 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 14:26:10,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:26:10,862 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:10,862 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:10,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 14:26:11,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:11,075 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:11,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:11,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1487835885, now seen corresponding path program 2 times [2022-02-20 14:26:11,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:11,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500105975] [2022-02-20 14:26:11,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:11,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:11,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:26:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:11,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {569#true} ~cond := #in~cond; {569#true} is VALID [2022-02-20 14:26:11,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {569#true} assume !(0 == ~cond); {569#true} is VALID [2022-02-20 14:26:11,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {569#true} assume true; {569#true} is VALID [2022-02-20 14:26:11,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {569#true} {569#true} #56#return; {569#true} is VALID [2022-02-20 14:26:11,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 14:26:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:11,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {569#true} ~cond := #in~cond; {569#true} is VALID [2022-02-20 14:26:11,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {569#true} assume !(0 == ~cond); {569#true} is VALID [2022-02-20 14:26:11,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {569#true} assume true; {569#true} is VALID [2022-02-20 14:26:11,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {569#true} {569#true} #58#return; {569#true} is VALID [2022-02-20 14:26:11,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {569#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {569#true} is VALID [2022-02-20 14:26:11,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {569#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#acopy~0#1.base, main_~#acopy~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {569#true} is VALID [2022-02-20 14:26:11,287 INFO L272 TraceCheckUtils]: 2: Hoare triple {569#true} call assume_abort_if_not((if main_~S~0#1 > 1 then 1 else 0)); {569#true} is VALID [2022-02-20 14:26:11,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {569#true} ~cond := #in~cond; {569#true} is VALID [2022-02-20 14:26:11,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {569#true} assume !(0 == ~cond); {569#true} is VALID [2022-02-20 14:26:11,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {569#true} assume true; {569#true} is VALID [2022-02-20 14:26:11,288 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {569#true} {569#true} #56#return; {569#true} is VALID [2022-02-20 14:26:11,288 INFO L272 TraceCheckUtils]: 7: Hoare triple {569#true} call assume_abort_if_not((if main_~S~0#1 < 1073741823 then 1 else 0)); {569#true} is VALID [2022-02-20 14:26:11,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {569#true} ~cond := #in~cond; {569#true} is VALID [2022-02-20 14:26:11,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {569#true} assume !(0 == ~cond); {569#true} is VALID [2022-02-20 14:26:11,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {569#true} assume true; {569#true} is VALID [2022-02-20 14:26:11,288 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {569#true} {569#true} #58#return; {569#true} is VALID [2022-02-20 14:26:11,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {569#true} havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(8 * main_~S~0#1);call main_~#acopy~0#1.base, main_~#acopy~0#1.offset := #Ultimate.allocOnStack(8 * main_~S~0#1);main_~i~0#1 := 0; {579#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)))} is VALID [2022-02-20 14:26:11,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {579#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)))} assume !!(main_~i~0#1 < main_~S~0#1);call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (2 * main_~S~0#1 - (1 + main_~i~0#1)), 4);call write~int(main_#t~mem6#1, main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * (2 * main_~S~0#1 - (1 + main_~i~0#1)), 4);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {580#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (+ |ULTIMATE.start_main_~#acopy~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)))} is VALID [2022-02-20 14:26:11,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {580#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (+ |ULTIMATE.start_main_~#acopy~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {581#(and (or (and (not (= (+ |ULTIMATE.start_main_~#acopy~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0)) (not (= (+ (* |ULTIMATE.start_main_~S~0#1| 8) (* |ULTIMATE.start_main_~i~0#1| (- 4)) |ULTIMATE.start_main_~#acopy~0#1.offset| (- 4)) 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0))) (<= |ULTIMATE.start_main_~S~0#1| |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)))} is VALID [2022-02-20 14:26:11,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {581#(and (or (and (not (= (+ |ULTIMATE.start_main_~#acopy~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0)) (not (= (+ (* |ULTIMATE.start_main_~S~0#1| 8) (* |ULTIMATE.start_main_~i~0#1| (- 4)) |ULTIMATE.start_main_~#acopy~0#1.offset| (- 4)) 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0))) (<= |ULTIMATE.start_main_~S~0#1| |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)))} assume !!(main_~i~0#1 < main_~S~0#1);call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (2 * main_~S~0#1 - (1 + main_~i~0#1)), 4);call write~int(main_#t~mem6#1, main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * (2 * main_~S~0#1 - (1 + main_~i~0#1)), 4);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {582#(and (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)))} is VALID [2022-02-20 14:26:11,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {582#(and (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {582#(and (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)))} is VALID [2022-02-20 14:26:11,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {582#(and (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)))} assume !(main_~i~0#1 < main_~S~0#1); {582#(and (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)))} is VALID [2022-02-20 14:26:11,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {582#(and (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)))} main_~i~0#1 := 0; {580#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (+ |ULTIMATE.start_main_~#acopy~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)))} is VALID [2022-02-20 14:26:11,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {580#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (+ |ULTIMATE.start_main_~#acopy~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)))} assume !!(main_~i~0#1 < 2 * main_~S~0#1);call main_#t~mem9#1 := read~int(main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {583#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 14:26:11,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {583#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {570#false} is VALID [2022-02-20 14:26:11,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {570#false} assume !false; {570#false} is VALID [2022-02-20 14:26:11,295 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:26:11,295 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:11,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500105975] [2022-02-20 14:26:11,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500105975] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:11,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901546972] [2022-02-20 14:26:11,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:26:11,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:11,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:11,297 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) [2022-02-20 14:26:11,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 14:26:11,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:26:11,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:11,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 14:26:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:11,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:11,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 14:26:11,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:11,450 INFO L356 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-02-20 14:26:11,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2022-02-20 14:26:11,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:11,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:11,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:11,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 44 [2022-02-20 14:26:11,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {569#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {569#true} is VALID [2022-02-20 14:26:11,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {569#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#acopy~0#1.base, main_~#acopy~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {569#true} is VALID [2022-02-20 14:26:11,764 INFO L272 TraceCheckUtils]: 2: Hoare triple {569#true} call assume_abort_if_not((if main_~S~0#1 > 1 then 1 else 0)); {569#true} is VALID [2022-02-20 14:26:11,765 INFO L290 TraceCheckUtils]: 3: Hoare triple {569#true} ~cond := #in~cond; {569#true} is VALID [2022-02-20 14:26:11,765 INFO L290 TraceCheckUtils]: 4: Hoare triple {569#true} assume !(0 == ~cond); {569#true} is VALID [2022-02-20 14:26:11,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {569#true} assume true; {569#true} is VALID [2022-02-20 14:26:11,765 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {569#true} {569#true} #56#return; {569#true} is VALID [2022-02-20 14:26:11,765 INFO L272 TraceCheckUtils]: 7: Hoare triple {569#true} call assume_abort_if_not((if main_~S~0#1 < 1073741823 then 1 else 0)); {569#true} is VALID [2022-02-20 14:26:11,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {569#true} ~cond := #in~cond; {569#true} is VALID [2022-02-20 14:26:11,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {569#true} assume !(0 == ~cond); {569#true} is VALID [2022-02-20 14:26:11,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {569#true} assume true; {569#true} is VALID [2022-02-20 14:26:11,766 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {569#true} {569#true} #58#return; {569#true} is VALID [2022-02-20 14:26:11,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {569#true} havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(8 * main_~S~0#1);call main_~#acopy~0#1.base, main_~#acopy~0#1.offset := #Ultimate.allocOnStack(8 * main_~S~0#1);main_~i~0#1 := 0; {579#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)))} is VALID [2022-02-20 14:26:11,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {579#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)))} assume !!(main_~i~0#1 < main_~S~0#1);call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (2 * main_~S~0#1 - (1 + main_~i~0#1)), 4);call write~int(main_#t~mem6#1, main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * (2 * main_~S~0#1 - (1 + main_~i~0#1)), 4);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {580#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (+ |ULTIMATE.start_main_~#acopy~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)))} is VALID [2022-02-20 14:26:11,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {580#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (+ |ULTIMATE.start_main_~#acopy~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {629#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) |ULTIMATE.start_main_~#acopy~0#1.offset|)) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)))} is VALID [2022-02-20 14:26:11,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {629#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) |ULTIMATE.start_main_~#acopy~0#1.offset|)) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)))} assume !!(main_~i~0#1 < main_~S~0#1);call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (2 * main_~S~0#1 - (1 + main_~i~0#1)), 4);call write~int(main_#t~mem6#1, main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * (2 * main_~S~0#1 - (1 + main_~i~0#1)), 4);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {582#(and (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)))} is VALID [2022-02-20 14:26:11,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {582#(and (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {582#(and (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)))} is VALID [2022-02-20 14:26:11,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {582#(and (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)))} assume !(main_~i~0#1 < main_~S~0#1); {582#(and (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)))} is VALID [2022-02-20 14:26:11,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {582#(and (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)))} main_~i~0#1 := 0; {580#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (+ |ULTIMATE.start_main_~#acopy~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)))} is VALID [2022-02-20 14:26:11,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {580#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (+ |ULTIMATE.start_main_~#acopy~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#acopy~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)))} assume !!(main_~i~0#1 < 2 * main_~S~0#1);call main_#t~mem9#1 := read~int(main_~#acopy~0#1.base, main_~#acopy~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {645#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:11,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {645#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {570#false} is VALID [2022-02-20 14:26:11,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {570#false} assume !false; {570#false} is VALID [2022-02-20 14:26:11,772 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:26:11,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:12,324 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:26:12,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36710 treesize of output 35054 [2022-02-20 14:26:12,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35046 treesize of output 33318 [2022-02-20 14:26:12,582 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 14:26:12,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 14:26:12,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 14:26:12,796 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 14:26:12,799 INFO L158 Benchmark]: Toolchain (without parser) took 4267.96ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 57.8MB in the beginning and 92.7MB in the end (delta: -34.9MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. [2022-02-20 14:26:12,800 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 90.2MB. Free memory is still 45.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:26:12,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.91ms. Allocated memory is still 90.2MB. Free memory was 57.6MB in the beginning and 65.6MB in the end (delta: -8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 14:26:12,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.51ms. Allocated memory is still 90.2MB. Free memory was 65.6MB in the beginning and 63.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:26:12,800 INFO L158 Benchmark]: Boogie Preprocessor took 33.87ms. Allocated memory is still 90.2MB. Free memory was 63.8MB in the beginning and 62.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:26:12,800 INFO L158 Benchmark]: RCFGBuilder took 310.02ms. Allocated memory is still 90.2MB. Free memory was 62.4MB in the beginning and 51.2MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 14:26:12,800 INFO L158 Benchmark]: TraceAbstraction took 3632.34ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 50.7MB in the beginning and 92.7MB in the end (delta: -42.0MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2022-02-20 14:26:12,801 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 90.2MB. Free memory is still 45.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.91ms. Allocated memory is still 90.2MB. Free memory was 57.6MB in the beginning and 65.6MB in the end (delta: -8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.51ms. Allocated memory is still 90.2MB. Free memory was 65.6MB in the beginning and 63.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.87ms. Allocated memory is still 90.2MB. Free memory was 63.8MB in the beginning and 62.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 310.02ms. Allocated memory is still 90.2MB. Free memory was 62.4MB in the beginning and 51.2MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3632.34ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 50.7MB in the beginning and 92.7MB in the end (delta: -42.0MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 14:26:12,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-cav19/array_tiling_tcpy.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 5446997f7b2d7b76d63a39784df785fb06bbab562e365ba547eeee8a855e283e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:26:14,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:26:14,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:26:14,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:26:14,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:26:14,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:26:14,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:26:14,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:26:14,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:26:14,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:26:14,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:26:14,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:26:14,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:26:14,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:26:14,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:26:14,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:26:14,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:26:14,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:26:14,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:26:14,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:26:14,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:26:14,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:26:14,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:26:14,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:26:14,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:26:14,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:26:14,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:26:14,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:26:14,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:26:14,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:26:14,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:26:14,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:26:14,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:26:14,641 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:26:14,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:26:14,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:26:14,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:26:14,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:26:14,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:26:14,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:26:14,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:26:14,647 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 14:26:14,677 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:26:14,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:26:14,678 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:26:14,678 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:26:14,679 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:26:14,679 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:26:14,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:26:14,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:26:14,680 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:26:14,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:26:14,681 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:26:14,681 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:26:14,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:26:14,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:26:14,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:26:14,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:26:14,682 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 14:26:14,682 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 14:26:14,682 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 14:26:14,683 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:26:14,683 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:26:14,683 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:26:14,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:26:14,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:26:14,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:26:14,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:26:14,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:26:14,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:26:14,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:26:14,684 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:26:14,684 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 14:26:14,684 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 14:26:14,685 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:26:14,685 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:26:14,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:26:14,685 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 14:26:14,685 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 5446997f7b2d7b76d63a39784df785fb06bbab562e365ba547eeee8a855e283e [2022-02-20 14:26:14,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:26:14,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:26:14,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:26:14,974 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:26:14,975 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:26:14,976 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-cav19/array_tiling_tcpy.c [2022-02-20 14:26:15,021 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca2d92d6/5ae6b85d1c8d4376ae4e5ffefa87f71d/FLAG5468efe92 [2022-02-20 14:26:15,311 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:26:15,312 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_tiling_tcpy.c [2022-02-20 14:26:15,316 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca2d92d6/5ae6b85d1c8d4376ae4e5ffefa87f71d/FLAG5468efe92 [2022-02-20 14:26:15,760 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca2d92d6/5ae6b85d1c8d4376ae4e5ffefa87f71d [2022-02-20 14:26:15,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:26:15,764 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:26:15,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:26:15,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:26:15,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:26:15,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:26:15" (1/1) ... [2022-02-20 14:26:15,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ca2917f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:15, skipping insertion in model container [2022-02-20 14:26:15,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:26:15" (1/1) ... [2022-02-20 14:26:15,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:26:15,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:26:15,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_tiling_tcpy.c[408,421] [2022-02-20 14:26:15,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:26:15,900 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:26:15,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_tiling_tcpy.c[408,421] [2022-02-20 14:26:15,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:26:15,953 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:26:15,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:15 WrapperNode [2022-02-20 14:26:15,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:26:15,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:26:15,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:26:15,954 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:26:15,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:15" (1/1) ... [2022-02-20 14:26:15,965 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:15" (1/1) ... [2022-02-20 14:26:15,978 INFO L137 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2022-02-20 14:26:15,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:26:15,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:26:15,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:26:15,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:26:15,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:15" (1/1) ... [2022-02-20 14:26:15,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:15" (1/1) ... [2022-02-20 14:26:15,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:15" (1/1) ... [2022-02-20 14:26:15,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:15" (1/1) ... [2022-02-20 14:26:15,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:15" (1/1) ... [2022-02-20 14:26:16,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:15" (1/1) ... [2022-02-20 14:26:16,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:15" (1/1) ... [2022-02-20 14:26:16,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:26:16,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:26:16,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:26:16,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:26:16,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:15" (1/1) ... [2022-02-20 14:26:16,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:26:16,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:16,037 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) [2022-02-20 14:26:16,053 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 [2022-02-20 14:26:16,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:26:16,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 14:26:16,069 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 14:26:16,069 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 14:26:16,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:26:16,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 14:26:16,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:26:16,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:26:16,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:26:16,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 14:26:16,112 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:26:16,113 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:26:16,318 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:26:16,323 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:26:16,323 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 14:26:16,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:26:16 BoogieIcfgContainer [2022-02-20 14:26:16,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:26:16,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:26:16,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:26:16,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:26:16,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:26:15" (1/3) ... [2022-02-20 14:26:16,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8ab640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:26:16, skipping insertion in model container [2022-02-20 14:26:16,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:15" (2/3) ... [2022-02-20 14:26:16,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8ab640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:26:16, skipping insertion in model container [2022-02-20 14:26:16,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:26:16" (3/3) ... [2022-02-20 14:26:16,344 INFO L111 eAbstractionObserver]: Analyzing ICFG array_tiling_tcpy.c [2022-02-20 14:26:16,347 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:26:16,347 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:26:16,411 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:26:16,415 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:26:16,431 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:26:16,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:16,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:26:16,446 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:16,447 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:16,447 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:16,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:16,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1700606493, now seen corresponding path program 1 times [2022-02-20 14:26:16,458 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:26:16,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22439562] [2022-02-20 14:26:16,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:16,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:26:16,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:26:16,465 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 14:26:16,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 14:26:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:16,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 14:26:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:16,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:16,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {25#true} is VALID [2022-02-20 14:26:16,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#acopy~0#1.base, main_~#acopy~0#1.offset;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {25#true} is VALID [2022-02-20 14:26:16,649 INFO L272 TraceCheckUtils]: 2: Hoare triple {25#true} call assume_abort_if_not((if ~bvsgt32(main_~S~0#1, 1bv32) then 1bv32 else 0bv32)); {25#true} is VALID [2022-02-20 14:26:16,649 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#true} ~cond := #in~cond; {25#true} is VALID [2022-02-20 14:26:16,650 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#true} assume 0bv32 == ~cond;assume false; {26#false} is VALID [2022-02-20 14:26:16,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#false} assume true; {26#false} is VALID [2022-02-20 14:26:16,651 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {26#false} {25#true} #56#return; {26#false} is VALID [2022-02-20 14:26:16,651 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call assume_abort_if_not((if ~bvslt32(main_~S~0#1, 1073741823bv32) then 1bv32 else 0bv32)); {26#false} is VALID [2022-02-20 14:26:16,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-02-20 14:26:16,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0bv32 == ~cond;assume false; {26#false} is VALID [2022-02-20 14:26:16,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume true; {26#false} is VALID [2022-02-20 14:26:16,652 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {26#false} {26#false} #58#return; {26#false} is VALID [2022-02-20 14:26:16,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {26#false} havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(~bvmul32(8bv32, main_~S~0#1));call main_~#acopy~0#1.base, main_~#acopy~0#1.offset := #Ultimate.allocOnStack(~bvmul32(8bv32, main_~S~0#1));main_~i~0#1 := 0bv32; {26#false} is VALID [2022-02-20 14:26:16,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !true; {26#false} is VALID [2022-02-20 14:26:16,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {26#false} main_~i~0#1 := 0bv32; {26#false} is VALID [2022-02-20 14:26:16,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {26#false} assume !!~bvslt32(main_~i~0#1, ~bvmul32(2bv32, main_~S~0#1));call main_#t~mem9#1 := read~intINTTYPE4(main_~#acopy~0#1.base, ~bvadd32(main_~#acopy~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);call main_#t~mem10#1 := read~intINTTYPE4(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {26#false} is VALID [2022-02-20 14:26:16,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {26#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {26#false} is VALID [2022-02-20 14:26:16,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-02-20 14:26:16,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:26:16,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:26:16,655 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 14:26:16,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22439562] [2022-02-20 14:26:16,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22439562] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:26:16,656 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:26:16,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:26:16,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979874504] [2022-02-20 14:26:16,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:26:16,662 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 14:26:16,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:16,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:16,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:16,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:26:16,693 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 14:26:16,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:26:16,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:26:16,726 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:16,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:16,807 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2022-02-20 14:26:16,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:26:16,808 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 14:26:16,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:16,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:16,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2022-02-20 14:26:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:16,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2022-02-20 14:26:16,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 54 transitions. [2022-02-20 14:26:16,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:16,920 INFO L225 Difference]: With dead ends: 41 [2022-02-20 14:26:16,920 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 14:26:16,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:26:16,926 INFO L933 BasicCegarLoop]: 24 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, 24 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 [2022-02-20 14:26:16,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:26:16,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 14:26:16,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 14:26:16,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:16,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:16,947 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:16,948 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:16,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:16,950 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-02-20 14:26:16,950 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-20 14:26:16,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:16,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:16,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-02-20 14:26:16,951 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-02-20 14:26:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:16,953 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-02-20 14:26:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-20 14:26:16,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:16,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:16,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:16,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:16,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-02-20 14:26:16,961 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 18 [2022-02-20 14:26:16,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:16,961 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-02-20 14:26:16,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-20 14:26:16,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:26:16,963 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:16,963 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:16,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 14:26:17,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 14:26:17,171 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:17,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:17,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1364006487, now seen corresponding path program 1 times [2022-02-20 14:26:17,173 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:26:17,173 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468487959] [2022-02-20 14:26:17,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:17,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:26:17,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:26:17,179 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 14:26:17,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 14:26:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:17,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:26:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:17,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:17,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {191#true} is VALID [2022-02-20 14:26:17,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#acopy~0#1.base, main_~#acopy~0#1.offset;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {191#true} is VALID [2022-02-20 14:26:17,415 INFO L272 TraceCheckUtils]: 2: Hoare triple {191#true} call assume_abort_if_not((if ~bvsgt32(main_~S~0#1, 1bv32) then 1bv32 else 0bv32)); {191#true} is VALID [2022-02-20 14:26:17,416 INFO L290 TraceCheckUtils]: 3: Hoare triple {191#true} ~cond := #in~cond; {205#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-20 14:26:17,417 INFO L290 TraceCheckUtils]: 4: Hoare triple {205#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {209#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 14:26:17,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {209#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {209#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 14:26:17,418 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {209#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {191#true} #56#return; {216#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} is VALID [2022-02-20 14:26:17,418 INFO L272 TraceCheckUtils]: 7: Hoare triple {216#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} call assume_abort_if_not((if ~bvslt32(main_~S~0#1, 1073741823bv32) then 1bv32 else 0bv32)); {191#true} is VALID [2022-02-20 14:26:17,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {191#true} ~cond := #in~cond; {205#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-20 14:26:17,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {205#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {209#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 14:26:17,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {209#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {209#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 14:26:17,421 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {209#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {216#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} #58#return; {232#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (bvslt |ULTIMATE.start_main_~S~0#1| (_ bv1073741823 32)))} is VALID [2022-02-20 14:26:17,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {232#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (bvslt |ULTIMATE.start_main_~S~0#1| (_ bv1073741823 32)))} havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(~bvmul32(8bv32, main_~S~0#1));call main_~#acopy~0#1.base, main_~#acopy~0#1.offset := #Ultimate.allocOnStack(~bvmul32(8bv32, main_~S~0#1));main_~i~0#1 := 0bv32; {236#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (bvslt |ULTIMATE.start_main_~S~0#1| (_ bv1073741823 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 14:26:17,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {236#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (bvslt |ULTIMATE.start_main_~S~0#1| (_ bv1073741823 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} assume !~bvslt32(main_~i~0#1, main_~S~0#1); {192#false} is VALID [2022-02-20 14:26:17,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {192#false} main_~i~0#1 := 0bv32; {192#false} is VALID [2022-02-20 14:26:17,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {192#false} assume !!~bvslt32(main_~i~0#1, ~bvmul32(2bv32, main_~S~0#1));call main_#t~mem9#1 := read~intINTTYPE4(main_~#acopy~0#1.base, ~bvadd32(main_~#acopy~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);call main_#t~mem10#1 := read~intINTTYPE4(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {192#false} is VALID [2022-02-20 14:26:17,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {192#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {192#false} is VALID [2022-02-20 14:26:17,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {192#false} assume !false; {192#false} is VALID [2022-02-20 14:26:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:26:17,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:26:17,424 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 14:26:17,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468487959] [2022-02-20 14:26:17,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468487959] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:26:17,425 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:26:17,425 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 14:26:17,425 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399420964] [2022-02-20 14:26:17,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:26:17,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 14:26:17,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:17,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:17,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:17,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:26:17,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 14:26:17,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:26:17,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:26:17,448 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:17,711 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-20 14:26:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 14:26:17,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 14:26:17,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:17,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-02-20 14:26:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-02-20 14:26:17,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-02-20 14:26:17,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:17,767 INFO L225 Difference]: With dead ends: 33 [2022-02-20 14:26:17,767 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 14:26:17,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 14:26:17,768 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 28 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:17,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:26:17,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 14:26:17,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2022-02-20 14:26:17,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:17,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:17,772 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:17,773 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:17,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:17,774 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-02-20 14:26:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-02-20 14:26:17,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:17,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:17,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-02-20 14:26:17,776 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-02-20 14:26:17,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:17,777 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-02-20 14:26:17,778 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-02-20 14:26:17,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:17,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:17,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:17,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-02-20 14:26:17,780 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 18 [2022-02-20 14:26:17,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:17,780 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-02-20 14:26:17,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:17,785 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-02-20 14:26:17,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:26:17,786 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:17,786 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:17,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 14:26:17,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 14:26:17,993 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:17,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:17,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1804375691, now seen corresponding path program 1 times [2022-02-20 14:26:17,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:26:17,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803492251] [2022-02-20 14:26:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:17,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:26:17,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:26:17,996 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 14:26:18,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 14:26:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:18,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 14:26:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:18,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:18,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {371#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {371#true} is VALID [2022-02-20 14:26:18,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {371#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#acopy~0#1.base, main_~#acopy~0#1.offset;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {371#true} is VALID [2022-02-20 14:26:18,222 INFO L272 TraceCheckUtils]: 2: Hoare triple {371#true} call assume_abort_if_not((if ~bvsgt32(main_~S~0#1, 1bv32) then 1bv32 else 0bv32)); {371#true} is VALID [2022-02-20 14:26:18,223 INFO L290 TraceCheckUtils]: 3: Hoare triple {371#true} ~cond := #in~cond; {385#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-20 14:26:18,223 INFO L290 TraceCheckUtils]: 4: Hoare triple {385#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {389#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 14:26:18,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {389#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {389#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 14:26:18,225 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {389#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {371#true} #56#return; {396#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} is VALID [2022-02-20 14:26:18,225 INFO L272 TraceCheckUtils]: 7: Hoare triple {396#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} call assume_abort_if_not((if ~bvslt32(main_~S~0#1, 1073741823bv32) then 1bv32 else 0bv32)); {371#true} is VALID [2022-02-20 14:26:18,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#true} ~cond := #in~cond; {385#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-20 14:26:18,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {385#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {389#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 14:26:18,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {389#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {389#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 14:26:18,227 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {389#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {396#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} #58#return; {412#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (bvslt |ULTIMATE.start_main_~S~0#1| (_ bv1073741823 32)))} is VALID [2022-02-20 14:26:18,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {412#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (bvslt |ULTIMATE.start_main_~S~0#1| (_ bv1073741823 32)))} havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(~bvmul32(8bv32, main_~S~0#1));call main_~#acopy~0#1.base, main_~#acopy~0#1.offset := #Ultimate.allocOnStack(~bvmul32(8bv32, main_~S~0#1));main_~i~0#1 := 0bv32; {416#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (bvslt |ULTIMATE.start_main_~S~0#1| (_ bv1073741823 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 14:26:18,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {416#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (bvslt |ULTIMATE.start_main_~S~0#1| (_ bv1073741823 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} assume !!~bvslt32(main_~i~0#1, main_~S~0#1);call main_#t~mem6#1 := read~intINTTYPE4(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, main_~S~0#1), ~bvadd32(1bv32, main_~i~0#1)))), 4bv32);call write~intINTTYPE4(main_#t~mem6#1, main_~#acopy~0#1.base, ~bvadd32(main_~#acopy~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, main_~S~0#1), ~bvadd32(1bv32, main_~i~0#1)))), 4bv32);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~intINTTYPE4(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);call write~intINTTYPE4(main_#t~mem7#1, main_~#acopy~0#1.base, ~bvadd32(main_~#acopy~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);havoc main_#t~mem7#1; {416#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (bvslt |ULTIMATE.start_main_~S~0#1| (_ bv1073741823 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 14:26:18,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {416#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (bvslt |ULTIMATE.start_main_~S~0#1| (_ bv1073741823 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {423#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (bvslt |ULTIMATE.start_main_~S~0#1| (_ bv1073741823 32)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32)))} is VALID [2022-02-20 14:26:18,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {423#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (bvslt |ULTIMATE.start_main_~S~0#1| (_ bv1073741823 32)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32)))} assume !~bvslt32(main_~i~0#1, main_~S~0#1); {372#false} is VALID [2022-02-20 14:26:18,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {372#false} main_~i~0#1 := 0bv32; {372#false} is VALID [2022-02-20 14:26:18,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {372#false} assume !!~bvslt32(main_~i~0#1, ~bvmul32(2bv32, main_~S~0#1));call main_#t~mem9#1 := read~intINTTYPE4(main_~#acopy~0#1.base, ~bvadd32(main_~#acopy~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);call main_#t~mem10#1 := read~intINTTYPE4(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {372#false} is VALID [2022-02-20 14:26:18,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {372#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {372#false} is VALID [2022-02-20 14:26:18,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {372#false} assume !false; {372#false} is VALID [2022-02-20 14:26:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:26:18,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:18,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {372#false} assume !false; {372#false} is VALID [2022-02-20 14:26:18,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {372#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {372#false} is VALID [2022-02-20 14:26:18,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {372#false} assume !!~bvslt32(main_~i~0#1, ~bvmul32(2bv32, main_~S~0#1));call main_#t~mem9#1 := read~intINTTYPE4(main_~#acopy~0#1.base, ~bvadd32(main_~#acopy~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);call main_#t~mem10#1 := read~intINTTYPE4(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {372#false} is VALID [2022-02-20 14:26:18,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {372#false} main_~i~0#1 := 0bv32; {372#false} is VALID [2022-02-20 14:26:18,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {451#(bvslt |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~S~0#1|)} assume !~bvslt32(main_~i~0#1, main_~S~0#1); {372#false} is VALID [2022-02-20 14:26:18,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {455#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~S~0#1|)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {451#(bvslt |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~S~0#1|)} is VALID [2022-02-20 14:26:18,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {455#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~S~0#1|)} assume !!~bvslt32(main_~i~0#1, main_~S~0#1);call main_#t~mem6#1 := read~intINTTYPE4(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, main_~S~0#1), ~bvadd32(1bv32, main_~i~0#1)))), 4bv32);call write~intINTTYPE4(main_#t~mem6#1, main_~#acopy~0#1.base, ~bvadd32(main_~#acopy~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, main_~S~0#1), ~bvadd32(1bv32, main_~i~0#1)))), 4bv32);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~intINTTYPE4(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);call write~intINTTYPE4(main_#t~mem7#1, main_~#acopy~0#1.base, ~bvadd32(main_~#acopy~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);havoc main_#t~mem7#1; {455#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~S~0#1|)} is VALID [2022-02-20 14:26:18,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {396#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(~bvmul32(8bv32, main_~S~0#1));call main_~#acopy~0#1.base, main_~#acopy~0#1.offset := #Ultimate.allocOnStack(~bvmul32(8bv32, main_~S~0#1));main_~i~0#1 := 0bv32; {455#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) |ULTIMATE.start_main_~S~0#1|)} is VALID [2022-02-20 14:26:18,504 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {371#true} {396#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} #58#return; {396#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} is VALID [2022-02-20 14:26:18,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {371#true} assume true; {371#true} is VALID [2022-02-20 14:26:18,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {371#true} assume !(0bv32 == ~cond); {371#true} is VALID [2022-02-20 14:26:18,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#true} ~cond := #in~cond; {371#true} is VALID [2022-02-20 14:26:18,504 INFO L272 TraceCheckUtils]: 7: Hoare triple {396#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} call assume_abort_if_not((if ~bvslt32(main_~S~0#1, 1073741823bv32) then 1bv32 else 0bv32)); {371#true} is VALID [2022-02-20 14:26:18,505 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {389#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {371#true} #56#return; {396#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} is VALID [2022-02-20 14:26:18,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {389#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {389#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 14:26:18,506 INFO L290 TraceCheckUtils]: 4: Hoare triple {489#(or (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= assume_abort_if_not_~cond (_ bv0 32)))} assume !(0bv32 == ~cond); {389#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 14:26:18,506 INFO L290 TraceCheckUtils]: 3: Hoare triple {371#true} ~cond := #in~cond; {489#(or (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= assume_abort_if_not_~cond (_ bv0 32)))} is VALID [2022-02-20 14:26:18,506 INFO L272 TraceCheckUtils]: 2: Hoare triple {371#true} call assume_abort_if_not((if ~bvsgt32(main_~S~0#1, 1bv32) then 1bv32 else 0bv32)); {371#true} is VALID [2022-02-20 14:26:18,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {371#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#acopy~0#1.base, main_~#acopy~0#1.offset;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {371#true} is VALID [2022-02-20 14:26:18,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {371#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {371#true} is VALID [2022-02-20 14:26:18,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:26:18,507 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 14:26:18,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803492251] [2022-02-20 14:26:18,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803492251] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:18,507 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:26:18,507 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-02-20 14:26:18,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423948902] [2022-02-20 14:26:18,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:18,508 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-02-20 14:26:18,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:18,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:26:18,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:18,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:26:18,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 14:26:18,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:26:18,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:26:18,558 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:26:18,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:18,872 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-02-20 14:26:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 14:26:18,872 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-02-20 14:26:18,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:26:18,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-02-20 14:26:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:26:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-02-20 14:26:18,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-02-20 14:26:18,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:18,927 INFO L225 Difference]: With dead ends: 41 [2022-02-20 14:26:18,927 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 14:26:18,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:26:18,928 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 76 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:18,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 53 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:26:18,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 14:26:18,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2022-02-20 14:26:18,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:18,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:18,931 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:18,931 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:18,939 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-02-20 14:26:18,939 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-02-20 14:26:18,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:18,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:18,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 34 states. [2022-02-20 14:26:18,941 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 34 states. [2022-02-20 14:26:18,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:18,944 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-02-20 14:26:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-02-20 14:26:18,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:18,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:18,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:18,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:18,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-02-20 14:26:18,945 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 20 [2022-02-20 14:26:18,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:18,945 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-20 14:26:18,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:26:18,945 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 14:26:18,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:26:18,946 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:18,946 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:18,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 14:26:19,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 14:26:19,146 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:19,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:19,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1487835885, now seen corresponding path program 2 times [2022-02-20 14:26:19,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:26:19,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108894050] [2022-02-20 14:26:19,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:26:19,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:26:19,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:26:19,148 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 14:26:19,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 14:26:19,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:26:19,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:19,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 14:26:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:19,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:19,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:19,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:26:19,354 INFO L356 Elim1Store]: treesize reduction 54, result has 21.7 percent of original size [2022-02-20 14:26:19,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 102 [2022-02-20 14:26:19,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2022-02-20 14:26:19,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2022-02-20 14:26:19,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-02-20 14:26:19,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:26:19,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:19,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:19,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:19,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:19,747 INFO L356 Elim1Store]: treesize reduction 183, result has 22.8 percent of original size [2022-02-20 14:26:19,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 case distinctions, treesize of input 97 treesize of output 115 [2022-02-20 14:26:19,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:19,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2022-02-20 14:26:20,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {649#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {649#true} is VALID [2022-02-20 14:26:20,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {649#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#acopy~0#1.base, main_~#acopy~0#1.offset;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {649#true} is VALID [2022-02-20 14:26:20,133 INFO L272 TraceCheckUtils]: 2: Hoare triple {649#true} call assume_abort_if_not((if ~bvsgt32(main_~S~0#1, 1bv32) then 1bv32 else 0bv32)); {649#true} is VALID [2022-02-20 14:26:20,133 INFO L290 TraceCheckUtils]: 3: Hoare triple {649#true} ~cond := #in~cond; {663#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-20 14:26:20,134 INFO L290 TraceCheckUtils]: 4: Hoare triple {663#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {667#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 14:26:20,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {667#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {667#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 14:26:20,135 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {667#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {649#true} #56#return; {674#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} is VALID [2022-02-20 14:26:20,135 INFO L272 TraceCheckUtils]: 7: Hoare triple {674#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} call assume_abort_if_not((if ~bvslt32(main_~S~0#1, 1073741823bv32) then 1bv32 else 0bv32)); {649#true} is VALID [2022-02-20 14:26:20,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {649#true} ~cond := #in~cond; {649#true} is VALID [2022-02-20 14:26:20,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {649#true} assume !(0bv32 == ~cond); {649#true} is VALID [2022-02-20 14:26:20,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {649#true} assume true; {649#true} is VALID [2022-02-20 14:26:20,136 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {649#true} {674#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} #58#return; {674#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} is VALID [2022-02-20 14:26:20,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {674#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(~bvmul32(8bv32, main_~S~0#1));call main_~#acopy~0#1.base, main_~#acopy~0#1.offset := #Ultimate.allocOnStack(~bvmul32(8bv32, main_~S~0#1));main_~i~0#1 := 0bv32; {693#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~#acopy~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 14:26:20,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {693#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~#acopy~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(main_~i~0#1, main_~S~0#1);call main_#t~mem6#1 := read~intINTTYPE4(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, main_~S~0#1), ~bvadd32(1bv32, main_~i~0#1)))), 4bv32);call write~intINTTYPE4(main_#t~mem6#1, main_~#acopy~0#1.base, ~bvadd32(main_~#acopy~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, main_~S~0#1), ~bvadd32(1bv32, main_~i~0#1)))), 4bv32);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~intINTTYPE4(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);call write~intINTTYPE4(main_#t~mem7#1, main_~#acopy~0#1.base, ~bvadd32(main_~#acopy~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);havoc main_#t~mem7#1; {697#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (or (exists ((v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_DerPreprocessor_1 (bvadd |ULTIMATE.start_main_~#acopy~0#1.offset| (bvmul (_ bv4 32) (bvneg (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32)))) (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (bvadd |ULTIMATE.start_main_~#acopy~0#1.offset| (bvmul (_ bv4 32) (bvneg (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32))))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~#a~0#1.base|) (bvadd |ULTIMATE.start_main_~#a~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~0#1|))) (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (bvadd |ULTIMATE.start_main_~#acopy~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)))))) (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)) (= |ULTIMATE.start_main_~#acopy~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 14:26:20,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {697#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (or (exists ((v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_DerPreprocessor_1 (bvadd |ULTIMATE.start_main_~#acopy~0#1.offset| (bvmul (_ bv4 32) (bvneg (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32)))) (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (bvadd |ULTIMATE.start_main_~#acopy~0#1.offset| (bvmul (_ bv4 32) (bvneg (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32))))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~#a~0#1.base|) (bvadd |ULTIMATE.start_main_~#a~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~0#1|))) (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (bvadd |ULTIMATE.start_main_~#acopy~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)))))) (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|)) (= |ULTIMATE.start_main_~#acopy~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {701#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (or (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|) (exists ((v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) |ULTIMATE.start_main_~#acopy~0#1.offset|) (select (select (store |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= (select v_DerPreprocessor_1 (bvadd (_ bv4294967292 32) |ULTIMATE.start_main_~#acopy~0#1.offset| (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32)))) (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (bvadd (_ bv4294967292 32) |ULTIMATE.start_main_~#acopy~0#1.offset| (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32)))))))) (= |ULTIMATE.start_main_~#acopy~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 14:26:20,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {701#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (or (= |ULTIMATE.start_main_~#a~0#1.base| |ULTIMATE.start_main_~#acopy~0#1.base|) (exists ((v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) |ULTIMATE.start_main_~#acopy~0#1.offset|) (select (select (store |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= (select v_DerPreprocessor_1 (bvadd (_ bv4294967292 32) |ULTIMATE.start_main_~#acopy~0#1.offset| (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32)))) (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (bvadd (_ bv4294967292 32) |ULTIMATE.start_main_~#acopy~0#1.offset| (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32)))))))) (= |ULTIMATE.start_main_~#acopy~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(main_~i~0#1, main_~S~0#1);call main_#t~mem6#1 := read~intINTTYPE4(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, main_~S~0#1), ~bvadd32(1bv32, main_~i~0#1)))), 4bv32);call write~intINTTYPE4(main_#t~mem6#1, main_~#acopy~0#1.base, ~bvadd32(main_~#acopy~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, main_~S~0#1), ~bvadd32(1bv32, main_~i~0#1)))), 4bv32);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~intINTTYPE4(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);call write~intINTTYPE4(main_#t~mem7#1, main_~#acopy~0#1.base, ~bvadd32(main_~#acopy~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);havoc main_#t~mem7#1; {705#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd |ULTIMATE.start_main_~#a~0#1.offset| (bvmul (_ bv4 32) (bvneg (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32)))) (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (bvadd |ULTIMATE.start_main_~#acopy~0#1.offset| (bvmul (_ bv4 32) (bvneg (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32))))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) |ULTIMATE.start_main_~#acopy~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#acopy~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 14:26:20,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {705#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd |ULTIMATE.start_main_~#a~0#1.offset| (bvmul (_ bv4 32) (bvneg (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32)))) (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (bvadd |ULTIMATE.start_main_~#acopy~0#1.offset| (bvmul (_ bv4 32) (bvneg (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32))))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) |ULTIMATE.start_main_~#acopy~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#acopy~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {709#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) |ULTIMATE.start_main_~#acopy~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (bvadd |ULTIMATE.start_main_~#acopy~0#1.offset| (_ bv4294967288 32) (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32)))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd |ULTIMATE.start_main_~#a~0#1.offset| (_ bv4294967288 32) (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32))))) (= |ULTIMATE.start_main_~#acopy~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 14:26:20,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {709#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) |ULTIMATE.start_main_~#acopy~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (bvadd |ULTIMATE.start_main_~#acopy~0#1.offset| (_ bv4294967288 32) (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32)))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd |ULTIMATE.start_main_~#a~0#1.offset| (_ bv4294967288 32) (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32))))) (= |ULTIMATE.start_main_~#acopy~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} assume !~bvslt32(main_~i~0#1, main_~S~0#1); {713#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (not (bvslt (_ bv2 32) |ULTIMATE.start_main_~S~0#1|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) |ULTIMATE.start_main_~#acopy~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (bvadd |ULTIMATE.start_main_~#acopy~0#1.offset| (_ bv4294967288 32) (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32)))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd |ULTIMATE.start_main_~#a~0#1.offset| (_ bv4294967288 32) (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32))))) (= |ULTIMATE.start_main_~#acopy~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 14:26:20,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {713#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (not (bvslt (_ bv2 32) |ULTIMATE.start_main_~S~0#1|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) |ULTIMATE.start_main_~#acopy~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (bvadd |ULTIMATE.start_main_~#acopy~0#1.offset| (_ bv4294967288 32) (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32)))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd |ULTIMATE.start_main_~#a~0#1.offset| (_ bv4294967288 32) (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32))))) (= |ULTIMATE.start_main_~#acopy~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} main_~i~0#1 := 0bv32; {717#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (not (bvslt (_ bv2 32) |ULTIMATE.start_main_~S~0#1|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) |ULTIMATE.start_main_~#acopy~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (bvadd |ULTIMATE.start_main_~#acopy~0#1.offset| (_ bv4294967288 32) (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32)))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd |ULTIMATE.start_main_~#a~0#1.offset| (_ bv4294967288 32) (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32))))) (= |ULTIMATE.start_main_~#acopy~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 14:26:20,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {717#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (not (bvslt (_ bv2 32) |ULTIMATE.start_main_~S~0#1|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) |ULTIMATE.start_main_~#acopy~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#acopy~0#1.base|) (bvadd |ULTIMATE.start_main_~#acopy~0#1.offset| (_ bv4294967288 32) (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32)))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd |ULTIMATE.start_main_~#a~0#1.offset| (_ bv4294967288 32) (bvmul |ULTIMATE.start_main_~S~0#1| (_ bv8 32))))) (= |ULTIMATE.start_main_~#acopy~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(main_~i~0#1, ~bvmul32(2bv32, main_~S~0#1));call main_#t~mem9#1 := read~intINTTYPE4(main_~#acopy~0#1.base, ~bvadd32(main_~#acopy~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);call main_#t~mem10#1 := read~intINTTYPE4(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {721#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} is VALID [2022-02-20 14:26:20,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {721#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond#1; {650#false} is VALID [2022-02-20 14:26:20,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {650#false} assume !false; {650#false} is VALID [2022-02-20 14:26:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:26:20,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:21,313 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:26:21,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194970 treesize of output 185762 [2022-02-20 14:26:21,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185754 treesize of output 175002 [2022-02-20 14:26:22,096 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 14:26:22,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108894050] [2022-02-20 14:26:22,097 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 14:26:22,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 14:26:22,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 14:26:22,304 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 14:26:22,308 INFO L158 Benchmark]: Toolchain (without parser) took 6543.55ms. Allocated memory was 50.3MB in the beginning and 174.1MB in the end (delta: 123.7MB). Free memory was 28.1MB in the beginning and 145.8MB in the end (delta: -117.6MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. [2022-02-20 14:26:22,308 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 50.3MB. Free memory was 32.4MB in the beginning and 32.3MB in the end (delta: 34.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:26:22,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.45ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 27.9MB in the beginning and 43.9MB in the end (delta: -16.0MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2022-02-20 14:26:22,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.13ms. Allocated memory is still 60.8MB. Free memory was 43.8MB in the beginning and 42.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:26:22,309 INFO L158 Benchmark]: Boogie Preprocessor took 27.08ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 40.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:26:22,309 INFO L158 Benchmark]: RCFGBuilder took 318.43ms. Allocated memory is still 60.8MB. Free memory was 40.5MB in the beginning and 29.2MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 14:26:22,309 INFO L158 Benchmark]: TraceAbstraction took 5981.63ms. Allocated memory was 60.8MB in the beginning and 174.1MB in the end (delta: 113.2MB). Free memory was 28.7MB in the beginning and 145.8MB in the end (delta: -117.1MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. [2022-02-20 14:26:22,311 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 50.3MB. Free memory was 32.4MB in the beginning and 32.3MB in the end (delta: 34.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.45ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 27.9MB in the beginning and 43.9MB in the end (delta: -16.0MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.13ms. Allocated memory is still 60.8MB. Free memory was 43.8MB in the beginning and 42.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.08ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 40.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 318.43ms. Allocated memory is still 60.8MB. Free memory was 40.5MB in the beginning and 29.2MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5981.63ms. Allocated memory was 60.8MB in the beginning and 174.1MB in the end (delta: 113.2MB). Free memory was 28.7MB in the beginning and 145.8MB in the end (delta: -117.1MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 14:26:22,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range