./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/n.c40.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/loops/n.c40.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e954357898f010ea28e7deb5d5a1ae907cf090e4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/loops/n.c40.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e954357898f010ea28e7deb5d5a1ae907cf090e4 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:11:40,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:11:40,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:11:41,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:11:41,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:11:41,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:11:41,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:11:41,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:11:41,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:11:41,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:11:41,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:11:41,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:11:41,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:11:41,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:11:41,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:11:41,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:11:41,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:11:41,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:11:41,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:11:41,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:11:41,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:11:41,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:11:41,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:11:41,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:11:41,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:11:41,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:11:41,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:11:41,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:11:41,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:11:41,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:11:41,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:11:41,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:11:41,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:11:41,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:11:41,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:11:41,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:11:41,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:11:41,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:11:41,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:11:41,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:11:41,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:11:41,052 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:11:41,068 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:11:41,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:11:41,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:11:41,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:11:41,070 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:11:41,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:11:41,071 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:11:41,071 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:11:41,071 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:11:41,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:11:41,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:11:41,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:11:41,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:11:41,073 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:11:41,073 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:11:41,074 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:11:41,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:11:41,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:11:41,075 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:11:41,075 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:11:41,075 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:11:41,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:11:41,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:11:41,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:11:41,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:11:41,077 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:11:41,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:11:41,077 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:11:41,078 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:11:41,078 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> e954357898f010ea28e7deb5d5a1ae907cf090e4 [2020-07-28 18:11:41,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:11:41,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:11:41,450 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:11:41,452 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:11:41,452 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:11:41,453 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/n.c40.c [2020-07-28 18:11:41,518 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/077e81a38/c303eadab3f447718f8fa9cda11e7064/FLAG19e0f72b8 [2020-07-28 18:11:41,913 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:11:41,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/n.c40.c [2020-07-28 18:11:41,920 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/077e81a38/c303eadab3f447718f8fa9cda11e7064/FLAG19e0f72b8 [2020-07-28 18:11:42,287 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/077e81a38/c303eadab3f447718f8fa9cda11e7064 [2020-07-28 18:11:42,293 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:11:42,297 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:11:42,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:11:42,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:11:42,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:11:42,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:11:42" (1/1) ... [2020-07-28 18:11:42,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e6bbc95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:42, skipping insertion in model container [2020-07-28 18:11:42,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:11:42" (1/1) ... [2020-07-28 18:11:42,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:11:42,342 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:11:42,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:11:42,565 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:11:42,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:11:42,611 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:11:42,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:42 WrapperNode [2020-07-28 18:11:42,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:11:42,613 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:11:42,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:11:42,613 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:11:42,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:42" (1/1) ... [2020-07-28 18:11:42,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:42" (1/1) ... [2020-07-28 18:11:42,723 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:11:42,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:11:42,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:11:42,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:11:42,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:42" (1/1) ... [2020-07-28 18:11:42,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:42" (1/1) ... [2020-07-28 18:11:42,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:42" (1/1) ... [2020-07-28 18:11:42,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:42" (1/1) ... [2020-07-28 18:11:42,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:42" (1/1) ... [2020-07-28 18:11:42,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:42" (1/1) ... [2020-07-28 18:11:42,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:42" (1/1) ... [2020-07-28 18:11:42,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:11:42,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:11:42,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:11:42,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:11:42,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:11:42,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 18:11:42,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:11:42,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:11:42,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 18:11:42,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 18:11:43,177 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:11:43,178 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-28 18:11:43,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:11:43 BoogieIcfgContainer [2020-07-28 18:11:43,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:11:43,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:11:43,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:11:43,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:11:43,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:11:42" (1/3) ... [2020-07-28 18:11:43,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb9b4cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:11:43, skipping insertion in model container [2020-07-28 18:11:43,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:42" (2/3) ... [2020-07-28 18:11:43,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb9b4cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:11:43, skipping insertion in model container [2020-07-28 18:11:43,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:11:43" (3/3) ... [2020-07-28 18:11:43,191 INFO L109 eAbstractionObserver]: Analyzing ICFG n.c40.c [2020-07-28 18:11:43,202 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:11:43,210 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:11:43,224 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:11:43,244 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:11:43,244 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:11:43,244 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:11:43,244 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:11:43,245 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:11:43,245 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:11:43,245 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:11:43,245 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:11:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2020-07-28 18:11:43,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 18:11:43,263 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:11:43,264 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:11:43,264 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:11:43,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:11:43,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1813493552, now seen corresponding path program 1 times [2020-07-28 18:11:43,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:11:43,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559008247] [2020-07-28 18:11:43,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:11:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:11:43,444 INFO L280 TraceCheckUtils]: 0: Hoare triple {16#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {16#true} is VALID [2020-07-28 18:11:43,444 INFO L280 TraceCheckUtils]: 1: Hoare triple {16#true} havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~post3, main_#t~mem1, main_#t~mem4;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~k~0 := main_#t~nondet0;havoc main_#t~nondet0;~i~0 := 0; {16#true} is VALID [2020-07-28 18:11:43,445 INFO L280 TraceCheckUtils]: 2: Hoare triple {16#true} assume !true; {17#false} is VALID [2020-07-28 18:11:43,446 INFO L280 TraceCheckUtils]: 3: Hoare triple {17#false} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {17#false} is VALID [2020-07-28 18:11:43,446 INFO L280 TraceCheckUtils]: 4: Hoare triple {17#false} assume ~k~0 >= 0 && ~k~0 < ~i~0;call main_#t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {17#false} is VALID [2020-07-28 18:11:43,446 INFO L280 TraceCheckUtils]: 5: Hoare triple {17#false} assume 0 == main_#t~mem4;havoc main_#t~mem4; {17#false} is VALID [2020-07-28 18:11:43,447 INFO L280 TraceCheckUtils]: 6: Hoare triple {17#false} assume !false; {17#false} is VALID [2020-07-28 18:11:43,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:11:43,450 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559008247] [2020-07-28 18:11:43,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:11:43,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 18:11:43,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137606828] [2020-07-28 18:11:43,458 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-07-28 18:11:43,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:11:43,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:11:43,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:11:43,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:11:43,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:11:43,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:11:43,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:11:43,508 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2020-07-28 18:11:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:43,565 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-28 18:11:43,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:11:43,566 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-07-28 18:11:43,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:11:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:11:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2020-07-28 18:11:43,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:11:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2020-07-28 18:11:43,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 26 transitions. [2020-07-28 18:11:43,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:11:43,640 INFO L225 Difference]: With dead ends: 22 [2020-07-28 18:11:43,641 INFO L226 Difference]: Without dead ends: 9 [2020-07-28 18:11:43,644 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:11:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-07-28 18:11:43,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-28 18:11:43,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:11:43,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2020-07-28 18:11:43,668 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2020-07-28 18:11:43,669 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2020-07-28 18:11:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:43,671 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2020-07-28 18:11:43,671 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-07-28 18:11:43,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:11:43,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:11:43,672 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2020-07-28 18:11:43,672 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2020-07-28 18:11:43,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:43,674 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2020-07-28 18:11:43,674 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-07-28 18:11:43,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:11:43,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:11:43,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:11:43,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:11:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 18:11:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2020-07-28 18:11:43,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2020-07-28 18:11:43,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:11:43,679 INFO L479 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2020-07-28 18:11:43,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:11:43,680 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-07-28 18:11:43,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-28 18:11:43,681 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:11:43,681 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:11:43,681 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:11:43,682 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:11:43,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:11:43,682 INFO L82 PathProgramCache]: Analyzing trace with hash 177687787, now seen corresponding path program 1 times [2020-07-28 18:11:43,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:11:43,683 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032510051] [2020-07-28 18:11:43,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:11:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:11:43,761 INFO L280 TraceCheckUtils]: 0: Hoare triple {73#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {73#true} is VALID [2020-07-28 18:11:43,763 INFO L280 TraceCheckUtils]: 1: Hoare triple {73#true} havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~post3, main_#t~mem1, main_#t~mem4;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~k~0 := main_#t~nondet0;havoc main_#t~nondet0;~i~0 := 0; {75#(= 0 ~i~0)} is VALID [2020-07-28 18:11:43,764 INFO L280 TraceCheckUtils]: 2: Hoare triple {75#(= 0 ~i~0)} call main_#t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {75#(= 0 ~i~0)} is VALID [2020-07-28 18:11:43,765 INFO L280 TraceCheckUtils]: 3: Hoare triple {75#(= 0 ~i~0)} assume !(0 != main_#t~mem1);havoc main_#t~mem1; {75#(= 0 ~i~0)} is VALID [2020-07-28 18:11:43,766 INFO L280 TraceCheckUtils]: 4: Hoare triple {75#(= 0 ~i~0)} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {75#(= 0 ~i~0)} is VALID [2020-07-28 18:11:43,767 INFO L280 TraceCheckUtils]: 5: Hoare triple {75#(= 0 ~i~0)} assume ~k~0 >= 0 && ~k~0 < ~i~0;call main_#t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {74#false} is VALID [2020-07-28 18:11:43,768 INFO L280 TraceCheckUtils]: 6: Hoare triple {74#false} assume 0 == main_#t~mem4;havoc main_#t~mem4; {74#false} is VALID [2020-07-28 18:11:43,768 INFO L280 TraceCheckUtils]: 7: Hoare triple {74#false} assume !false; {74#false} is VALID [2020-07-28 18:11:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:11:43,769 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032510051] [2020-07-28 18:11:43,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:11:43,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 18:11:43,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798762012] [2020-07-28 18:11:43,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-28 18:11:43,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:11:43,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 18:11:43,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:11:43,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 18:11:43,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:11:43,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 18:11:43,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:11:43,791 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 3 states. [2020-07-28 18:11:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:43,836 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 18:11:43,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:11:43,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-28 18:11:43,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:11:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:11:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-07-28 18:11:43,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:11:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-07-28 18:11:43,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2020-07-28 18:11:43,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:11:43,868 INFO L225 Difference]: With dead ends: 16 [2020-07-28 18:11:43,868 INFO L226 Difference]: Without dead ends: 11 [2020-07-28 18:11:43,869 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:11:43,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-28 18:11:43,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-28 18:11:43,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:11:43,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2020-07-28 18:11:43,874 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2020-07-28 18:11:43,874 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2020-07-28 18:11:43,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:43,876 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-07-28 18:11:43,876 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-07-28 18:11:43,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:11:43,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:11:43,877 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2020-07-28 18:11:43,877 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2020-07-28 18:11:43,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:43,879 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-07-28 18:11:43,879 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-07-28 18:11:43,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:11:43,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:11:43,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:11:43,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:11:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 18:11:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2020-07-28 18:11:43,882 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2020-07-28 18:11:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:11:43,882 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2020-07-28 18:11:43,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 18:11:43,883 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-07-28 18:11:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 18:11:43,883 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:11:43,884 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:11:43,884 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 18:11:43,884 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:11:43,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:11:43,885 INFO L82 PathProgramCache]: Analyzing trace with hash 468121936, now seen corresponding path program 1 times [2020-07-28 18:11:43,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:11:43,886 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954091363] [2020-07-28 18:11:43,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:11:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:11:43,974 INFO L280 TraceCheckUtils]: 0: Hoare triple {131#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {133#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-28 18:11:43,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {133#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~post3, main_#t~mem1, main_#t~mem4;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~k~0 := main_#t~nondet0;havoc main_#t~nondet0;~i~0 := 0; {133#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-28 18:11:43,977 INFO L280 TraceCheckUtils]: 2: Hoare triple {133#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} call main_#t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {134#(= 0 |ULTIMATE.start_main_#t~mem1|)} is VALID [2020-07-28 18:11:43,978 INFO L280 TraceCheckUtils]: 3: Hoare triple {134#(= 0 |ULTIMATE.start_main_#t~mem1|)} assume !!(0 != main_#t~mem1);havoc main_#t~mem1;call main_#t~mem2 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1);call write~int(main_#t~mem2, ~#y~0.base, ~#y~0.offset + ~i~0, 1);havoc main_#t~mem2;main_#t~post3 := ~i~0;~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {132#false} is VALID [2020-07-28 18:11:43,978 INFO L280 TraceCheckUtils]: 4: Hoare triple {132#false} call main_#t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {132#false} is VALID [2020-07-28 18:11:43,979 INFO L280 TraceCheckUtils]: 5: Hoare triple {132#false} assume !(0 != main_#t~mem1);havoc main_#t~mem1; {132#false} is VALID [2020-07-28 18:11:43,979 INFO L280 TraceCheckUtils]: 6: Hoare triple {132#false} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {132#false} is VALID [2020-07-28 18:11:43,980 INFO L280 TraceCheckUtils]: 7: Hoare triple {132#false} assume ~k~0 >= 0 && ~k~0 < ~i~0;call main_#t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {132#false} is VALID [2020-07-28 18:11:43,980 INFO L280 TraceCheckUtils]: 8: Hoare triple {132#false} assume 0 == main_#t~mem4;havoc main_#t~mem4; {132#false} is VALID [2020-07-28 18:11:43,980 INFO L280 TraceCheckUtils]: 9: Hoare triple {132#false} assume !false; {132#false} is VALID [2020-07-28 18:11:43,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:11:43,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954091363] [2020-07-28 18:11:43,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:11:43,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 18:11:43,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084935668] [2020-07-28 18:11:43,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-28 18:11:43,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:11:43,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:11:44,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:11:44,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:11:44,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:11:44,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:11:44,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:11:44,005 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 4 states. [2020-07-28 18:11:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:44,036 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-07-28 18:11:44,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:11:44,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-28 18:11:44,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:11:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:11:44,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-07-28 18:11:44,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:11:44,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-07-28 18:11:44,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 11 transitions. [2020-07-28 18:11:44,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:11:44,059 INFO L225 Difference]: With dead ends: 11 [2020-07-28 18:11:44,060 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:11:44,061 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:11:44,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:11:44,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:11:44,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:11:44,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:11:44,062 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:11:44,062 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:11:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:44,062 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:11:44,063 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:11:44,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:11:44,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:11:44,064 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:11:44,064 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:11:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:44,064 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:11:44,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:11:44,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:11:44,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:11:44,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:11:44,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:11:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:11:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:11:44,067 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2020-07-28 18:11:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:11:44,068 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:11:44,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:11:44,068 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:11:44,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:11:44,069 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 18:11:44,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:11:44,096 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:11:44,096 INFO L268 CegarLoopResult]: For program point L19(lines 19 20) no Hoare annotation was computed. [2020-07-28 18:11:44,096 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 18:11:44,097 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:11:44,097 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:11:44,097 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2020-07-28 18:11:44,097 INFO L271 CegarLoopResult]: At program point L22(lines 8 23) the Hoare annotation is: true [2020-07-28 18:11:44,098 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-28 18:11:44,098 INFO L268 CegarLoopResult]: For program point L18(lines 18 20) no Hoare annotation was computed. [2020-07-28 18:11:44,098 INFO L268 CegarLoopResult]: For program point L18-1(lines 18 20) no Hoare annotation was computed. [2020-07-28 18:11:44,098 INFO L268 CegarLoopResult]: For program point L12-1(lines 12 15) no Hoare annotation was computed. [2020-07-28 18:11:44,099 INFO L264 CegarLoopResult]: At program point L12-3(lines 12 15) the Hoare annotation is: (and (= 0 ~i~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))) [2020-07-28 18:11:44,099 INFO L268 CegarLoopResult]: For program point L12-4(lines 12 15) no Hoare annotation was computed. [2020-07-28 18:11:44,104 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:11:44,104 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 18:11:44,104 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2020-07-28 18:11:44,105 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2020-07-28 18:11:44,105 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2020-07-28 18:11:44,105 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2020-07-28 18:11:44,105 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2020-07-28 18:11:44,105 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-28 18:11:44,106 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-28 18:11:44,106 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-28 18:11:44,106 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-28 18:11:44,106 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-28 18:11:44,107 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-28 18:11:44,107 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-28 18:11:44,107 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:11:44,107 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:11:44,108 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:11:44,115 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:217) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 18:11:44,123 INFO L168 Benchmark]: Toolchain (without parser) took 1826.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 67.6 MB). Free memory was 960.2 MB in the beginning and 958.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 69.0 MB. Max. memory is 11.5 GB. [2020-07-28 18:11:44,124 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:11:44,125 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.57 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:11:44,126 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 67.6 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -106.7 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:11:44,126 INFO L168 Benchmark]: Boogie Preprocessor took 28.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:11:44,127 INFO L168 Benchmark]: RCFGBuilder took 429.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2020-07-28 18:11:44,128 INFO L168 Benchmark]: TraceAbstraction took 936.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 958.8 MB in the end (delta: 70.6 MB). Peak memory consumption was 70.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:11:44,132 INFO L336 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 309.57 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 110.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 67.6 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -106.7 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 429.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 936.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 958.8 MB in the end (delta: 70.6 MB). Peak memory consumption was 70.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:11:46,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:11:46,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:11:46,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:11:46,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:11:46,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:11:46,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:11:46,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:11:46,132 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:11:46,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:11:46,134 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:11:46,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:11:46,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:11:46,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:11:46,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:11:46,144 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:11:46,145 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:11:46,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:11:46,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:11:46,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:11:46,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:11:46,153 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:11:46,154 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:11:46,155 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:11:46,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:11:46,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:11:46,158 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:11:46,159 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:11:46,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:11:46,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:11:46,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:11:46,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:11:46,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:11:46,163 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:11:46,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:11:46,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:11:46,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:11:46,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:11:46,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:11:46,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:11:46,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:11:46,169 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-07-28 18:11:46,184 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:11:46,184 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:11:46,185 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:11:46,186 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:11:46,186 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:11:46,186 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:11:46,187 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:11:46,187 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:11:46,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:11:46,187 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:11:46,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:11:46,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:11:46,188 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 18:11:46,188 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 18:11:46,189 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:11:46,189 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:11:46,189 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:11:46,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:11:46,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:11:46,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:11:46,190 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:11:46,191 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:11:46,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:11:46,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:11:46,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:11:46,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:11:46,192 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 18:11:46,192 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 18:11:46,193 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:11:46,193 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:11:46,193 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 18:11:46,194 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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(__VERIFIER_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 -> e954357898f010ea28e7deb5d5a1ae907cf090e4 [2020-07-28 18:11:46,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:11:46,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:11:46,545 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:11:46,547 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:11:46,548 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:11:46,549 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/n.c40.c [2020-07-28 18:11:46,621 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6187d218/8f60ef4bfb9d484fb4b9ffa8f7f5f88d/FLAG74ff3bee1 [2020-07-28 18:11:47,087 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:11:47,088 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/n.c40.c [2020-07-28 18:11:47,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6187d218/8f60ef4bfb9d484fb4b9ffa8f7f5f88d/FLAG74ff3bee1 [2020-07-28 18:11:47,532 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6187d218/8f60ef4bfb9d484fb4b9ffa8f7f5f88d [2020-07-28 18:11:47,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:11:47,541 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:11:47,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:11:47,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:11:47,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:11:47,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:11:47" (1/1) ... [2020-07-28 18:11:47,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bdb741a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:47, skipping insertion in model container [2020-07-28 18:11:47,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:11:47" (1/1) ... [2020-07-28 18:11:47,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:11:47,582 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:11:47,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:11:47,790 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:11:47,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:11:47,846 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:11:47,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:47 WrapperNode [2020-07-28 18:11:47,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:11:47,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:11:47,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:11:47,851 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:11:47,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:47" (1/1) ... [2020-07-28 18:11:47,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:47" (1/1) ... [2020-07-28 18:11:47,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:11:47,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:11:47,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:11:47,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:11:47,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:47" (1/1) ... [2020-07-28 18:11:47,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:47" (1/1) ... [2020-07-28 18:11:47,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:47" (1/1) ... [2020-07-28 18:11:47,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:47" (1/1) ... [2020-07-28 18:11:47,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:47" (1/1) ... [2020-07-28 18:11:47,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:47" (1/1) ... [2020-07-28 18:11:47,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:47" (1/1) ... [2020-07-28 18:11:47,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:11:47,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:11:47,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:11:47,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:11:47,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:11:48,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2020-07-28 18:11:48,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:11:48,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:11:48,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2020-07-28 18:11:48,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 18:11:48,376 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:11:48,377 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-28 18:11:48,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:11:48 BoogieIcfgContainer [2020-07-28 18:11:48,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:11:48,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:11:48,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:11:48,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:11:48,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:11:47" (1/3) ... [2020-07-28 18:11:48,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1fb9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:11:48, skipping insertion in model container [2020-07-28 18:11:48,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:11:47" (2/3) ... [2020-07-28 18:11:48,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1fb9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:11:48, skipping insertion in model container [2020-07-28 18:11:48,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:11:48" (3/3) ... [2020-07-28 18:11:48,390 INFO L109 eAbstractionObserver]: Analyzing ICFG n.c40.c [2020-07-28 18:11:48,400 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:11:48,406 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:11:48,419 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:11:48,442 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:11:48,443 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:11:48,443 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:11:48,443 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:11:48,444 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:11:48,444 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:11:48,444 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:11:48,444 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:11:48,459 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2020-07-28 18:11:48,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 18:11:48,464 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:11:48,465 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:11:48,466 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:11:48,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:11:48,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1813493552, now seen corresponding path program 1 times [2020-07-28 18:11:48,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:11:48,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180472803] [2020-07-28 18:11:48,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-28 18:11:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:11:48,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 18:11:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:11:48,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:11:48,613 INFO L280 TraceCheckUtils]: 0: Hoare triple {16#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {16#true} is VALID [2020-07-28 18:11:48,613 INFO L280 TraceCheckUtils]: 1: Hoare triple {16#true} havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~post3, main_#t~mem1, main_#t~mem4;~k~0 := main_#t~nondet0;havoc main_#t~nondet0;~i~0 := 0bv32; {16#true} is VALID [2020-07-28 18:11:48,614 INFO L280 TraceCheckUtils]: 2: Hoare triple {16#true} assume !true; {17#false} is VALID [2020-07-28 18:11:48,615 INFO L280 TraceCheckUtils]: 3: Hoare triple {17#false} call write~intINTTYPE1(0bv8, ~#y~0.base, ~bvadd32(~#y~0.offset, ~i~0), 1bv32); {17#false} is VALID [2020-07-28 18:11:48,615 INFO L280 TraceCheckUtils]: 4: Hoare triple {17#false} assume ~bvsge32(~k~0, 0bv32) && ~bvslt32(~k~0, ~i~0);call main_#t~mem4 := read~intINTTYPE1(~#y~0.base, ~bvadd32(~#y~0.offset, ~k~0), 1bv32); {17#false} is VALID [2020-07-28 18:11:48,615 INFO L280 TraceCheckUtils]: 5: Hoare triple {17#false} assume 0bv32 == ~sign_extendFrom8To32(main_#t~mem4);havoc main_#t~mem4; {17#false} is VALID [2020-07-28 18:11:48,616 INFO L280 TraceCheckUtils]: 6: Hoare triple {17#false} assume !false; {17#false} is VALID [2020-07-28 18:11:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:11:48,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:11:48,632 INFO L280 TraceCheckUtils]: 6: Hoare triple {17#false} assume !false; {17#false} is VALID [2020-07-28 18:11:48,633 INFO L280 TraceCheckUtils]: 5: Hoare triple {17#false} assume 0bv32 == ~sign_extendFrom8To32(main_#t~mem4);havoc main_#t~mem4; {17#false} is VALID [2020-07-28 18:11:48,633 INFO L280 TraceCheckUtils]: 4: Hoare triple {17#false} assume ~bvsge32(~k~0, 0bv32) && ~bvslt32(~k~0, ~i~0);call main_#t~mem4 := read~intINTTYPE1(~#y~0.base, ~bvadd32(~#y~0.offset, ~k~0), 1bv32); {17#false} is VALID [2020-07-28 18:11:48,634 INFO L280 TraceCheckUtils]: 3: Hoare triple {17#false} call write~intINTTYPE1(0bv8, ~#y~0.base, ~bvadd32(~#y~0.offset, ~i~0), 1bv32); {17#false} is VALID [2020-07-28 18:11:48,635 INFO L280 TraceCheckUtils]: 2: Hoare triple {16#true} assume !true; {17#false} is VALID [2020-07-28 18:11:48,635 INFO L280 TraceCheckUtils]: 1: Hoare triple {16#true} havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~post3, main_#t~mem1, main_#t~mem4;~k~0 := main_#t~nondet0;havoc main_#t~nondet0;~i~0 := 0bv32; {16#true} is VALID [2020-07-28 18:11:48,635 INFO L280 TraceCheckUtils]: 0: Hoare triple {16#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {16#true} is VALID [2020-07-28 18:11:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:11:48,637 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180472803] [2020-07-28 18:11:48,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:11:48,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 18:11:48,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646154724] [2020-07-28 18:11:48,646 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-07-28 18:11:48,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:11:48,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:11:48,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:11:48,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:11:48,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:11:48,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:11:48,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:11:48,686 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2020-07-28 18:11:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:48,740 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-28 18:11:48,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:11:48,740 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-07-28 18:11:48,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:11:48,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:11:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2020-07-28 18:11:48,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:11:48,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2020-07-28 18:11:48,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 26 transitions. [2020-07-28 18:11:48,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:11:48,809 INFO L225 Difference]: With dead ends: 22 [2020-07-28 18:11:48,809 INFO L226 Difference]: Without dead ends: 9 [2020-07-28 18:11:48,812 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:11:48,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-07-28 18:11:48,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-28 18:11:48,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:11:48,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2020-07-28 18:11:48,846 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2020-07-28 18:11:48,847 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2020-07-28 18:11:48,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:48,849 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2020-07-28 18:11:48,849 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-07-28 18:11:48,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:11:48,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:11:48,850 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2020-07-28 18:11:48,850 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2020-07-28 18:11:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:48,852 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2020-07-28 18:11:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-07-28 18:11:48,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:11:48,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:11:48,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:11:48,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:11:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 18:11:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2020-07-28 18:11:48,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2020-07-28 18:11:48,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:11:48,858 INFO L479 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2020-07-28 18:11:48,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:11:48,858 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-07-28 18:11:48,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-28 18:11:48,859 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:11:48,859 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:11:49,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 18:11:49,071 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:11:49,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:11:49,072 INFO L82 PathProgramCache]: Analyzing trace with hash 177687787, now seen corresponding path program 1 times [2020-07-28 18:11:49,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:11:49,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305712736] [2020-07-28 18:11:49,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-28 18:11:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:11:49,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-28 18:11:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:11:49,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:11:49,176 INFO L280 TraceCheckUtils]: 0: Hoare triple {109#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {109#true} is VALID [2020-07-28 18:11:49,177 INFO L280 TraceCheckUtils]: 1: Hoare triple {109#true} havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~post3, main_#t~mem1, main_#t~mem4;~k~0 := main_#t~nondet0;havoc main_#t~nondet0;~i~0 := 0bv32; {117#(= ~i~0 (_ bv0 32))} is VALID [2020-07-28 18:11:49,178 INFO L280 TraceCheckUtils]: 2: Hoare triple {117#(= ~i~0 (_ bv0 32))} call main_#t~mem1 := read~intINTTYPE1(~#x~0.base, ~bvadd32(~#x~0.offset, ~i~0), 1bv32); {117#(= ~i~0 (_ bv0 32))} is VALID [2020-07-28 18:11:49,179 INFO L280 TraceCheckUtils]: 3: Hoare triple {117#(= ~i~0 (_ bv0 32))} assume !(0bv32 != ~sign_extendFrom8To32(main_#t~mem1));havoc main_#t~mem1; {117#(= ~i~0 (_ bv0 32))} is VALID [2020-07-28 18:11:49,180 INFO L280 TraceCheckUtils]: 4: Hoare triple {117#(= ~i~0 (_ bv0 32))} call write~intINTTYPE1(0bv8, ~#y~0.base, ~bvadd32(~#y~0.offset, ~i~0), 1bv32); {117#(= ~i~0 (_ bv0 32))} is VALID [2020-07-28 18:11:49,181 INFO L280 TraceCheckUtils]: 5: Hoare triple {117#(= ~i~0 (_ bv0 32))} assume ~bvsge32(~k~0, 0bv32) && ~bvslt32(~k~0, ~i~0);call main_#t~mem4 := read~intINTTYPE1(~#y~0.base, ~bvadd32(~#y~0.offset, ~k~0), 1bv32); {110#false} is VALID [2020-07-28 18:11:49,182 INFO L280 TraceCheckUtils]: 6: Hoare triple {110#false} assume 0bv32 == ~sign_extendFrom8To32(main_#t~mem4);havoc main_#t~mem4; {110#false} is VALID [2020-07-28 18:11:49,182 INFO L280 TraceCheckUtils]: 7: Hoare triple {110#false} assume !false; {110#false} is VALID [2020-07-28 18:11:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:11:49,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:11:49,264 INFO L280 TraceCheckUtils]: 7: Hoare triple {110#false} assume !false; {110#false} is VALID [2020-07-28 18:11:49,265 INFO L280 TraceCheckUtils]: 6: Hoare triple {110#false} assume 0bv32 == ~sign_extendFrom8To32(main_#t~mem4);havoc main_#t~mem4; {110#false} is VALID [2020-07-28 18:11:49,269 INFO L280 TraceCheckUtils]: 5: Hoare triple {142#(forall ((~k~0 (_ BitVec 32))) (or (not (bvslt ~k~0 ~i~0)) (not (bvsge ~k~0 (_ bv0 32)))))} assume ~bvsge32(~k~0, 0bv32) && ~bvslt32(~k~0, ~i~0);call main_#t~mem4 := read~intINTTYPE1(~#y~0.base, ~bvadd32(~#y~0.offset, ~k~0), 1bv32); {110#false} is VALID [2020-07-28 18:11:49,271 INFO L280 TraceCheckUtils]: 4: Hoare triple {142#(forall ((~k~0 (_ BitVec 32))) (or (not (bvslt ~k~0 ~i~0)) (not (bvsge ~k~0 (_ bv0 32)))))} call write~intINTTYPE1(0bv8, ~#y~0.base, ~bvadd32(~#y~0.offset, ~i~0), 1bv32); {142#(forall ((~k~0 (_ BitVec 32))) (or (not (bvslt ~k~0 ~i~0)) (not (bvsge ~k~0 (_ bv0 32)))))} is VALID [2020-07-28 18:11:49,272 INFO L280 TraceCheckUtils]: 3: Hoare triple {142#(forall ((~k~0 (_ BitVec 32))) (or (not (bvslt ~k~0 ~i~0)) (not (bvsge ~k~0 (_ bv0 32)))))} assume !(0bv32 != ~sign_extendFrom8To32(main_#t~mem1));havoc main_#t~mem1; {142#(forall ((~k~0 (_ BitVec 32))) (or (not (bvslt ~k~0 ~i~0)) (not (bvsge ~k~0 (_ bv0 32)))))} is VALID [2020-07-28 18:11:49,273 INFO L280 TraceCheckUtils]: 2: Hoare triple {142#(forall ((~k~0 (_ BitVec 32))) (or (not (bvslt ~k~0 ~i~0)) (not (bvsge ~k~0 (_ bv0 32)))))} call main_#t~mem1 := read~intINTTYPE1(~#x~0.base, ~bvadd32(~#x~0.offset, ~i~0), 1bv32); {142#(forall ((~k~0 (_ BitVec 32))) (or (not (bvslt ~k~0 ~i~0)) (not (bvsge ~k~0 (_ bv0 32)))))} is VALID [2020-07-28 18:11:49,274 INFO L280 TraceCheckUtils]: 1: Hoare triple {109#true} havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~post3, main_#t~mem1, main_#t~mem4;~k~0 := main_#t~nondet0;havoc main_#t~nondet0;~i~0 := 0bv32; {142#(forall ((~k~0 (_ BitVec 32))) (or (not (bvslt ~k~0 ~i~0)) (not (bvsge ~k~0 (_ bv0 32)))))} is VALID [2020-07-28 18:11:49,274 INFO L280 TraceCheckUtils]: 0: Hoare triple {109#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {109#true} is VALID [2020-07-28 18:11:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:11:49,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305712736] [2020-07-28 18:11:49,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:11:49,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-07-28 18:11:49,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963075259] [2020-07-28 18:11:49,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-28 18:11:49,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:11:49,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:11:49,318 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:11:49,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:11:49,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:11:49,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:11:49,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:11:49,320 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 4 states. [2020-07-28 18:11:49,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:49,418 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 18:11:49,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:11:49,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-28 18:11:49,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:11:49,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:11:49,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-07-28 18:11:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:11:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-07-28 18:11:49,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2020-07-28 18:11:49,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:11:49,460 INFO L225 Difference]: With dead ends: 16 [2020-07-28 18:11:49,460 INFO L226 Difference]: Without dead ends: 11 [2020-07-28 18:11:49,461 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:11:49,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-28 18:11:49,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-28 18:11:49,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:11:49,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2020-07-28 18:11:49,467 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2020-07-28 18:11:49,467 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2020-07-28 18:11:49,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:49,469 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-07-28 18:11:49,469 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-07-28 18:11:49,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:11:49,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:11:49,470 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2020-07-28 18:11:49,470 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2020-07-28 18:11:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:11:49,472 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-07-28 18:11:49,472 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-07-28 18:11:49,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:11:49,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:11:49,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:11:49,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:11:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 18:11:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2020-07-28 18:11:49,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2020-07-28 18:11:49,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:11:49,476 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2020-07-28 18:11:49,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:11:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-07-28 18:11:49,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 18:11:49,477 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:11:49,478 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:11:49,689 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 18:11:49,690 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:11:49,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:11:49,691 INFO L82 PathProgramCache]: Analyzing trace with hash 468121936, now seen corresponding path program 1 times [2020-07-28 18:11:49,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:11:49,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085472753] [2020-07-28 18:11:49,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-28 18:11:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:11:49,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-28 18:11:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:11:49,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:11:49,927 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 18:11:49,928 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 41 [2020-07-28 18:11:49,931 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-28 18:11:49,933 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 18:11:49,940 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-28 18:11:49,941 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 18:11:49,945 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-28 18:11:49,993 INFO L624 ElimStorePlain]: treesize reduction 14, result has 70.2 percent of original size [2020-07-28 18:11:49,999 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-28 18:11:49,999 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:22 [2020-07-28 18:11:52,403 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 18:11:52,404 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_12|, |~#x~0.base|]. (let ((.cse0 ((_ sign_extend 24) ((_ extract 7 0) (select (select |v_#memory_int_12| |~#x~0.base|) (_ bv0 32)))))) (and (= |~#y~0.offset| (_ bv0 32)) (= ~i~0 (_ bv1 32)) (= (store |v_#memory_int_12| |~#y~0.base| (store (select |v_#memory_int_12| |~#y~0.base|) |~#y~0.offset| .cse0)) |#memory_int|) (not (= (_ bv0 32) .cse0)))) [2020-07-28 18:11:52,404 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_1]. (let ((.cse0 ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1)))) (and (= |~#y~0.offset| (_ bv0 32)) (= .cse0 (select (select |#memory_int| |~#y~0.base|) |~#y~0.offset|)) (= ~i~0 (_ bv1 32)) (not (= .cse0 (_ bv0 32))))) [2020-07-28 18:11:52,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-28 18:11:52,546 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2020-07-28 18:11:52,547 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 18:11:52,568 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 18:11:52,570 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-28 18:11:52,570 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2020-07-28 18:11:52,660 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-28 18:11:52,665 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 18:11:52,666 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 17 [2020-07-28 18:11:52,668 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 18:11:52,684 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 18:11:52,688 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-28 18:11:52,688 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:13 [2020-07-28 18:11:52,706 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 18:11:52,706 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |~#y~0.base|, ~k~0, v_arrayElimCell_1]. (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1))) (.cse0 (select |#memory_int| |~#y~0.base|))) (and (= |ULTIMATE.start_main_#t~mem4| ((_ extract 7 0) (select .cse0 ~k~0))) (= (select .cse0 (_ bv0 32)) .cse1) (not (= .cse1 (_ bv0 32))) (bvsge ~k~0 (_ bv0 32)) (bvslt ~k~0 (_ bv1 32)) (= ((_ sign_extend 24) (_ bv0 8)) (select .cse0 (_ bv1 32))))) [2020-07-28 18:11:52,707 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_1]. (let ((.cse0 ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1)))) (and (not (= .cse0 (_ bv0 32))) (= |ULTIMATE.start_main_#t~mem4| ((_ extract 7 0) .cse0)))) [2020-07-28 18:11:52,750 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {215#(and (= |~#y~0.offset| (_ bv0 32)) (= |~#x~0.offset| (_ bv0 32)))} is VALID [2020-07-28 18:11:52,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {215#(and (= |~#y~0.offset| (_ bv0 32)) (= |~#x~0.offset| (_ bv0 32)))} havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~post3, main_#t~mem1, main_#t~mem4;~k~0 := main_#t~nondet0;havoc main_#t~nondet0;~i~0 := 0bv32; {219#(and (= |~#y~0.offset| (_ bv0 32)) (= ~i~0 (_ bv0 32)) (= |~#x~0.offset| (_ bv0 32)))} is VALID [2020-07-28 18:11:52,752 INFO L280 TraceCheckUtils]: 2: Hoare triple {219#(and (= |~#y~0.offset| (_ bv0 32)) (= ~i~0 (_ bv0 32)) (= |~#x~0.offset| (_ bv0 32)))} call main_#t~mem1 := read~intINTTYPE1(~#x~0.base, ~bvadd32(~#x~0.offset, ~i~0), 1bv32); {223#(and (= |~#y~0.offset| (_ bv0 32)) (= ~i~0 (_ bv0 32)) (= |ULTIMATE.start_main_#t~mem1| ((_ extract 7 0) (select (select |#memory_int| |~#x~0.base|) (bvadd ~i~0 |~#x~0.offset|)))) (= |~#x~0.offset| (_ bv0 32)))} is VALID [2020-07-28 18:11:52,775 INFO L280 TraceCheckUtils]: 3: Hoare triple {223#(and (= |~#y~0.offset| (_ bv0 32)) (= ~i~0 (_ bv0 32)) (= |ULTIMATE.start_main_#t~mem1| ((_ extract 7 0) (select (select |#memory_int| |~#x~0.base|) (bvadd ~i~0 |~#x~0.offset|)))) (= |~#x~0.offset| (_ bv0 32)))} assume !!(0bv32 != ~sign_extendFrom8To32(main_#t~mem1));havoc main_#t~mem1;call main_#t~mem2 := read~intINTTYPE1(~#x~0.base, ~bvadd32(~#x~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(main_#t~mem2, ~#y~0.base, ~bvadd32(~#y~0.offset, ~i~0), 1bv32);havoc main_#t~mem2;main_#t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, main_#t~post3);havoc main_#t~post3; {227#(and (= |~#y~0.offset| (_ bv0 32)) (= (bvadd ~i~0 (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1)) (select (select |#memory_int| |~#y~0.base|) |~#y~0.offset|)) (not (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1)) (_ bv0 32))))))} is VALID [2020-07-28 18:11:52,777 INFO L280 TraceCheckUtils]: 4: Hoare triple {227#(and (= |~#y~0.offset| (_ bv0 32)) (= (bvadd ~i~0 (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1)) (select (select |#memory_int| |~#y~0.base|) |~#y~0.offset|)) (not (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1)) (_ bv0 32))))))} call main_#t~mem1 := read~intINTTYPE1(~#x~0.base, ~bvadd32(~#x~0.offset, ~i~0), 1bv32); {227#(and (= |~#y~0.offset| (_ bv0 32)) (= (bvadd ~i~0 (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1)) (select (select |#memory_int| |~#y~0.base|) |~#y~0.offset|)) (not (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1)) (_ bv0 32))))))} is VALID [2020-07-28 18:11:52,779 INFO L280 TraceCheckUtils]: 5: Hoare triple {227#(and (= |~#y~0.offset| (_ bv0 32)) (= (bvadd ~i~0 (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1)) (select (select |#memory_int| |~#y~0.base|) |~#y~0.offset|)) (not (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1)) (_ bv0 32))))))} assume !(0bv32 != ~sign_extendFrom8To32(main_#t~mem1));havoc main_#t~mem1; {227#(and (= |~#y~0.offset| (_ bv0 32)) (= (bvadd ~i~0 (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1)) (select (select |#memory_int| |~#y~0.base|) |~#y~0.offset|)) (not (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1)) (_ bv0 32))))))} is VALID [2020-07-28 18:11:52,781 INFO L280 TraceCheckUtils]: 6: Hoare triple {227#(and (= |~#y~0.offset| (_ bv0 32)) (= (bvadd ~i~0 (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1)) (select (select |#memory_int| |~#y~0.base|) |~#y~0.offset|)) (not (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1)) (_ bv0 32))))))} call write~intINTTYPE1(0bv8, ~#y~0.base, ~bvadd32(~#y~0.offset, ~i~0), 1bv32); {237#(and (= |~#y~0.offset| (_ bv0 32)) (= (bvadd ~i~0 (_ bv4294967295 32)) (_ bv0 32)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |~#y~0.base|) (bvadd |~#y~0.offset| ~i~0))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1)) (select (select |#memory_int| |~#y~0.base|) |~#y~0.offset|)) (not (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1)) (_ bv0 32))))))} is VALID [2020-07-28 18:11:52,802 INFO L280 TraceCheckUtils]: 7: Hoare triple {237#(and (= |~#y~0.offset| (_ bv0 32)) (= (bvadd ~i~0 (_ bv4294967295 32)) (_ bv0 32)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |~#y~0.base|) (bvadd |~#y~0.offset| ~i~0))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1)) (select (select |#memory_int| |~#y~0.base|) |~#y~0.offset|)) (not (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1)) (_ bv0 32))))))} assume ~bvsge32(~k~0, 0bv32) && ~bvslt32(~k~0, ~i~0);call main_#t~mem4 := read~intINTTYPE1(~#y~0.base, ~bvadd32(~#y~0.offset, ~k~0), 1bv32); {241#(exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (not (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1)) (_ bv0 32))) (= |ULTIMATE.start_main_#t~mem4| ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1))))))} is VALID [2020-07-28 18:11:52,804 INFO L280 TraceCheckUtils]: 8: Hoare triple {241#(exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (not (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1)) (_ bv0 32))) (= |ULTIMATE.start_main_#t~mem4| ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_1))))))} assume 0bv32 == ~sign_extendFrom8To32(main_#t~mem4);havoc main_#t~mem4; {211#false} is VALID [2020-07-28 18:11:52,805 INFO L280 TraceCheckUtils]: 9: Hoare triple {211#false} assume !false; {211#false} is VALID [2020-07-28 18:11:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:11:52,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:11:56,924 WARN L193 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 38 [2020-07-28 18:11:56,994 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 18:11:56,994 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2020-07-28 18:11:56,996 INFO L523 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-28 18:11:57,004 INFO L440 ElimStorePlain]: Different costs {0=[v_arrayElimCell_6], 2=[v_arrayElimCell_7]} [2020-07-28 18:11:57,230 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 18:11:57,231 INFO L384 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 37 treesize of output 39 [2020-07-28 18:11:57,232 INFO L523 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-28 18:11:57,244 INFO L440 ElimStorePlain]: Different costs {0=[v_arrayElimCell_8], 2=[v_arrayElimCell_9]} [2020-07-28 18:11:57,267 INFO L280 TraceCheckUtils]: 9: Hoare triple {211#false} assume !false; {211#false} is VALID [2020-07-28 18:11:57,268 INFO L280 TraceCheckUtils]: 8: Hoare triple {251#(not (= ((_ sign_extend 24) |ULTIMATE.start_main_#t~mem4|) (_ bv0 32)))} assume 0bv32 == ~sign_extendFrom8To32(main_#t~mem4);havoc main_#t~mem4; {211#false} is VALID [2020-07-28 18:11:57,278 INFO L280 TraceCheckUtils]: 7: Hoare triple {255#(forall ((~k~0 (_ BitVec 32))) (or (not (bvslt ~k~0 ~i~0)) (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |~#y~0.base|) (bvadd |~#y~0.offset| ~k~0)))))) (not (bvsge ~k~0 (_ bv0 32)))))} assume ~bvsge32(~k~0, 0bv32) && ~bvslt32(~k~0, ~i~0);call main_#t~mem4 := read~intINTTYPE1(~#y~0.base, ~bvadd32(~#y~0.offset, ~k~0), 1bv32); {251#(not (= ((_ sign_extend 24) |ULTIMATE.start_main_#t~mem4|) (_ bv0 32)))} is VALID [2020-07-28 18:11:59,245 INFO L280 TraceCheckUtils]: 6: Hoare triple {259#(forall ((~k~0 (_ BitVec 32))) (or (not (= ((_ sign_extend 24) ((_ extract 7 0) (select (store (select |#memory_int| |~#y~0.base|) (bvadd |~#y~0.offset| ~i~0) ((_ sign_extend 24) (_ bv0 8))) (bvadd |~#y~0.offset| ~k~0)))) (_ bv0 32))) (not (bvslt ~k~0 ~i~0)) (not (bvsge ~k~0 (_ bv0 32)))))} call write~intINTTYPE1(0bv8, ~#y~0.base, ~bvadd32(~#y~0.offset, ~i~0), 1bv32); {255#(forall ((~k~0 (_ BitVec 32))) (or (not (bvslt ~k~0 ~i~0)) (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |~#y~0.base|) (bvadd |~#y~0.offset| ~k~0)))))) (not (bvsge ~k~0 (_ bv0 32)))))} is UNKNOWN [2020-07-28 18:11:59,246 INFO L280 TraceCheckUtils]: 5: Hoare triple {259#(forall ((~k~0 (_ BitVec 32))) (or (not (= ((_ sign_extend 24) ((_ extract 7 0) (select (store (select |#memory_int| |~#y~0.base|) (bvadd |~#y~0.offset| ~i~0) ((_ sign_extend 24) (_ bv0 8))) (bvadd |~#y~0.offset| ~k~0)))) (_ bv0 32))) (not (bvslt ~k~0 ~i~0)) (not (bvsge ~k~0 (_ bv0 32)))))} assume !(0bv32 != ~sign_extendFrom8To32(main_#t~mem1));havoc main_#t~mem1; {259#(forall ((~k~0 (_ BitVec 32))) (or (not (= ((_ sign_extend 24) ((_ extract 7 0) (select (store (select |#memory_int| |~#y~0.base|) (bvadd |~#y~0.offset| ~i~0) ((_ sign_extend 24) (_ bv0 8))) (bvadd |~#y~0.offset| ~k~0)))) (_ bv0 32))) (not (bvslt ~k~0 ~i~0)) (not (bvsge ~k~0 (_ bv0 32)))))} is VALID [2020-07-28 18:11:59,247 INFO L280 TraceCheckUtils]: 4: Hoare triple {259#(forall ((~k~0 (_ BitVec 32))) (or (not (= ((_ sign_extend 24) ((_ extract 7 0) (select (store (select |#memory_int| |~#y~0.base|) (bvadd |~#y~0.offset| ~i~0) ((_ sign_extend 24) (_ bv0 8))) (bvadd |~#y~0.offset| ~k~0)))) (_ bv0 32))) (not (bvslt ~k~0 ~i~0)) (not (bvsge ~k~0 (_ bv0 32)))))} call main_#t~mem1 := read~intINTTYPE1(~#x~0.base, ~bvadd32(~#x~0.offset, ~i~0), 1bv32); {259#(forall ((~k~0 (_ BitVec 32))) (or (not (= ((_ sign_extend 24) ((_ extract 7 0) (select (store (select |#memory_int| |~#y~0.base|) (bvadd |~#y~0.offset| ~i~0) ((_ sign_extend 24) (_ bv0 8))) (bvadd |~#y~0.offset| ~k~0)))) (_ bv0 32))) (not (bvslt ~k~0 ~i~0)) (not (bvsge ~k~0 (_ bv0 32)))))} is VALID [2020-07-28 18:12:01,260 INFO L280 TraceCheckUtils]: 3: Hoare triple {269#(or (forall ((|~#y~0.base| (_ BitVec 32)) (~k~0 (_ BitVec 32))) (or (not (bvslt ~k~0 (bvadd ~i~0 (_ bv1 32)))) (not (bvsge ~k~0 (_ bv0 32))) (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (store (store (select |#memory_int| |~#y~0.base|) (bvadd |~#y~0.offset| ~i~0) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |~#x~0.base|) (bvadd ~i~0 |~#x~0.offset|))))) (bvadd |~#y~0.offset| ~i~0 (_ bv1 32)) ((_ sign_extend 24) (_ bv0 8))) (bvadd |~#y~0.offset| ~k~0)))))))) (= ((_ sign_extend 24) |ULTIMATE.start_main_#t~mem1|) (_ bv0 32)))} assume !!(0bv32 != ~sign_extendFrom8To32(main_#t~mem1));havoc main_#t~mem1;call main_#t~mem2 := read~intINTTYPE1(~#x~0.base, ~bvadd32(~#x~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(main_#t~mem2, ~#y~0.base, ~bvadd32(~#y~0.offset, ~i~0), 1bv32);havoc main_#t~mem2;main_#t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, main_#t~post3);havoc main_#t~post3; {259#(forall ((~k~0 (_ BitVec 32))) (or (not (= ((_ sign_extend 24) ((_ extract 7 0) (select (store (select |#memory_int| |~#y~0.base|) (bvadd |~#y~0.offset| ~i~0) ((_ sign_extend 24) (_ bv0 8))) (bvadd |~#y~0.offset| ~k~0)))) (_ bv0 32))) (not (bvslt ~k~0 ~i~0)) (not (bvsge ~k~0 (_ bv0 32)))))} is UNKNOWN [2020-07-28 18:12:01,284 INFO L280 TraceCheckUtils]: 2: Hoare triple {273#(forall ((|#memory_int| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|~#x~0.base| (_ BitVec 32)) (|~#y~0.base| (_ BitVec 32)) (~k~0 (_ BitVec 32))) (or (not (bvslt ~k~0 (bvadd ~i~0 (_ bv1 32)))) (not (bvsge ~k~0 (_ bv0 32))) (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (store (store (select |#memory_int| |~#y~0.base|) (bvadd |~#y~0.offset| ~i~0) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |~#x~0.base|) (bvadd ~i~0 |~#x~0.offset|))))) (bvadd |~#y~0.offset| ~i~0 (_ bv1 32)) ((_ sign_extend 24) (_ bv0 8))) (bvadd |~#y~0.offset| ~k~0)))))) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |~#x~0.base|) (bvadd ~i~0 |~#x~0.offset|)))))))} call main_#t~mem1 := read~intINTTYPE1(~#x~0.base, ~bvadd32(~#x~0.offset, ~i~0), 1bv32); {269#(or (forall ((|~#y~0.base| (_ BitVec 32)) (~k~0 (_ BitVec 32))) (or (not (bvslt ~k~0 (bvadd ~i~0 (_ bv1 32)))) (not (bvsge ~k~0 (_ bv0 32))) (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (store (store (select |#memory_int| |~#y~0.base|) (bvadd |~#y~0.offset| ~i~0) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |~#x~0.base|) (bvadd ~i~0 |~#x~0.offset|))))) (bvadd |~#y~0.offset| ~i~0 (_ bv1 32)) ((_ sign_extend 24) (_ bv0 8))) (bvadd |~#y~0.offset| ~k~0)))))))) (= ((_ sign_extend 24) |ULTIMATE.start_main_#t~mem1|) (_ bv0 32)))} is UNKNOWN [2020-07-28 18:12:01,288 INFO L280 TraceCheckUtils]: 1: Hoare triple {210#true} havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~post3, main_#t~mem1, main_#t~mem4;~k~0 := main_#t~nondet0;havoc main_#t~nondet0;~i~0 := 0bv32; {273#(forall ((|#memory_int| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|~#x~0.base| (_ BitVec 32)) (|~#y~0.base| (_ BitVec 32)) (~k~0 (_ BitVec 32))) (or (not (bvslt ~k~0 (bvadd ~i~0 (_ bv1 32)))) (not (bvsge ~k~0 (_ bv0 32))) (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (store (store (select |#memory_int| |~#y~0.base|) (bvadd |~#y~0.offset| ~i~0) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |~#x~0.base|) (bvadd ~i~0 |~#x~0.offset|))))) (bvadd |~#y~0.offset| ~i~0 (_ bv1 32)) ((_ sign_extend 24) (_ bv0 8))) (bvadd |~#y~0.offset| ~k~0)))))) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |~#x~0.base|) (bvadd ~i~0 |~#x~0.offset|)))))))} is VALID [2020-07-28 18:12:01,288 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {210#true} is VALID [2020-07-28 18:12:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:01,291 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085472753] [2020-07-28 18:12:01,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:01,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2020-07-28 18:12:01,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30377700] [2020-07-28 18:12:01,292 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2020-07-28 18:12:01,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:01,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-28 18:12:09,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 14 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:09,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-28 18:12:09,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:12:09,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-28 18:12:09,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=111, Unknown=4, NotChecked=0, Total=156 [2020-07-28 18:12:09,256 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 13 states. [2020-07-28 18:12:10,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:10,176 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-28 18:12:10,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 18:12:10,176 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2020-07-28 18:12:10,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:10,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 18:12:10,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2020-07-28 18:12:10,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 18:12:10,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2020-07-28 18:12:10,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 18 transitions. [2020-07-28 18:12:10,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:10,262 INFO L225 Difference]: With dead ends: 18 [2020-07-28 18:12:10,262 INFO L226 Difference]: Without dead ends: 13 [2020-07-28 18:12:10,263 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=66, Invalid=170, Unknown=4, NotChecked=0, Total=240 [2020-07-28 18:12:10,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-28 18:12:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-28 18:12:10,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:10,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2020-07-28 18:12:10,279 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-28 18:12:10,279 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-28 18:12:10,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:10,281 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-28 18:12:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-28 18:12:10,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:10,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:10,282 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-28 18:12:10,282 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-28 18:12:10,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:10,283 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-28 18:12:10,283 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-28 18:12:10,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:10,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:10,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:10,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 18:12:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2020-07-28 18:12:10,285 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2020-07-28 18:12:10,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:10,285 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2020-07-28 18:12:10,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-28 18:12:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-28 18:12:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 18:12:10,286 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:10,287 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:10,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 18:12:10,488 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:10,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:10,488 INFO L82 PathProgramCache]: Analyzing trace with hash 402464885, now seen corresponding path program 2 times [2020-07-28 18:12:10,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:12:10,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174936863] [2020-07-28 18:12:10,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-28 18:12:10,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 18:12:10,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:12:10,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 18:12:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:10,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:10,589 INFO L384 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 23 treesize of output 21 [2020-07-28 18:12:10,591 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-28 18:12:10,619 INFO L624 ElimStorePlain]: treesize reduction 14, result has 53.3 percent of original size [2020-07-28 18:12:10,626 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2020-07-28 18:12:10,626 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 18:12:10,637 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 18:12:10,650 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-28 18:12:10,650 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:17 [2020-07-28 18:12:10,657 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 18:12:10,657 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|, |~#y~0.base|, |v_#valid_5|]. (and (= |#memory_int| (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (store (store |v_#memory_int_16| |~#x~0.base| .cse0) |~#y~0.base| .cse0))) (= (_ bv0 1) (select (store (store |v_#valid_5| (_ bv0 32) (_ bv0 1)) |~#x~0.base| (_ bv1 1)) |~#y~0.base|))) [2020-07-28 18:12:10,658 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|~#y~0.base|]. (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (not (= |~#y~0.base| |~#x~0.base|)) (= (select |#memory_int| |~#y~0.base|) .cse0) (= .cse0 (select |#memory_int| |~#x~0.base|)))) [2020-07-28 18:12:12,679 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 14 [2020-07-28 18:12:12,748 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2020-07-28 18:12:12,750 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 18:12:12,758 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 18:12:12,764 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-28 18:12:12,764 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:9 [2020-07-28 18:12:12,769 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 18:12:12,770 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |~#x~0.base|, ~i~0, |~#x~0.offset|, |~#y~0.base|]. (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32))) (.cse1 (select |#memory_int| |~#x~0.base|))) (and (not (= |~#y~0.base| |~#x~0.base|)) (= (select |#memory_int| |~#y~0.base|) .cse0) (= |ULTIMATE.start_main_#t~mem1| ((_ extract 7 0) (select .cse1 (bvadd ~i~0 |~#x~0.offset|)))) (= .cse0 .cse1))) [2020-07-28 18:12:12,770 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [~i~0, |~#x~0.offset|]. (= |ULTIMATE.start_main_#t~mem1| ((_ extract 7 0) (select ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (bvadd ~i~0 |~#x~0.offset|)))) [2020-07-28 18:12:12,798 INFO L280 TraceCheckUtils]: 0: Hoare triple {348#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {353#(and (exists ((|~#y~0.base| (_ BitVec 32))) (and (not (= |~#y~0.base| |~#x~0.base|)) (= (select |#memory_int| |~#y~0.base|) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32))))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-28 18:12:12,799 INFO L280 TraceCheckUtils]: 1: Hoare triple {353#(and (exists ((|~#y~0.base| (_ BitVec 32))) (and (not (= |~#y~0.base| |~#x~0.base|)) (= (select |#memory_int| |~#y~0.base|) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32))))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |~#x~0.base|)))} havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~post3, main_#t~mem1, main_#t~mem4;~k~0 := main_#t~nondet0;havoc main_#t~nondet0;~i~0 := 0bv32; {353#(and (exists ((|~#y~0.base| (_ BitVec 32))) (and (not (= |~#y~0.base| |~#x~0.base|)) (= (select |#memory_int| |~#y~0.base|) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32))))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-28 18:12:12,804 INFO L280 TraceCheckUtils]: 2: Hoare triple {353#(and (exists ((|~#y~0.base| (_ BitVec 32))) (and (not (= |~#y~0.base| |~#x~0.base|)) (= (select |#memory_int| |~#y~0.base|) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32))))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |~#x~0.base|)))} call main_#t~mem1 := read~intINTTYPE1(~#x~0.base, ~bvadd32(~#x~0.offset, ~i~0), 1bv32); {360#(exists ((~i~0 (_ BitVec 32)) (|~#x~0.offset| (_ BitVec 32))) (= |ULTIMATE.start_main_#t~mem1| ((_ extract 7 0) (select ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (bvadd ~i~0 |~#x~0.offset|)))))} is VALID [2020-07-28 18:12:12,805 INFO L280 TraceCheckUtils]: 3: Hoare triple {360#(exists ((~i~0 (_ BitVec 32)) (|~#x~0.offset| (_ BitVec 32))) (= |ULTIMATE.start_main_#t~mem1| ((_ extract 7 0) (select ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (bvadd ~i~0 |~#x~0.offset|)))))} assume !!(0bv32 != ~sign_extendFrom8To32(main_#t~mem1));havoc main_#t~mem1;call main_#t~mem2 := read~intINTTYPE1(~#x~0.base, ~bvadd32(~#x~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(main_#t~mem2, ~#y~0.base, ~bvadd32(~#y~0.offset, ~i~0), 1bv32);havoc main_#t~mem2;main_#t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, main_#t~post3);havoc main_#t~post3; {349#false} is VALID [2020-07-28 18:12:12,805 INFO L280 TraceCheckUtils]: 4: Hoare triple {349#false} call main_#t~mem1 := read~intINTTYPE1(~#x~0.base, ~bvadd32(~#x~0.offset, ~i~0), 1bv32); {349#false} is VALID [2020-07-28 18:12:12,805 INFO L280 TraceCheckUtils]: 5: Hoare triple {349#false} assume !!(0bv32 != ~sign_extendFrom8To32(main_#t~mem1));havoc main_#t~mem1;call main_#t~mem2 := read~intINTTYPE1(~#x~0.base, ~bvadd32(~#x~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(main_#t~mem2, ~#y~0.base, ~bvadd32(~#y~0.offset, ~i~0), 1bv32);havoc main_#t~mem2;main_#t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, main_#t~post3);havoc main_#t~post3; {349#false} is VALID [2020-07-28 18:12:12,806 INFO L280 TraceCheckUtils]: 6: Hoare triple {349#false} call main_#t~mem1 := read~intINTTYPE1(~#x~0.base, ~bvadd32(~#x~0.offset, ~i~0), 1bv32); {349#false} is VALID [2020-07-28 18:12:12,806 INFO L280 TraceCheckUtils]: 7: Hoare triple {349#false} assume !(0bv32 != ~sign_extendFrom8To32(main_#t~mem1));havoc main_#t~mem1; {349#false} is VALID [2020-07-28 18:12:12,807 INFO L280 TraceCheckUtils]: 8: Hoare triple {349#false} call write~intINTTYPE1(0bv8, ~#y~0.base, ~bvadd32(~#y~0.offset, ~i~0), 1bv32); {349#false} is VALID [2020-07-28 18:12:12,807 INFO L280 TraceCheckUtils]: 9: Hoare triple {349#false} assume ~bvsge32(~k~0, 0bv32) && ~bvslt32(~k~0, ~i~0);call main_#t~mem4 := read~intINTTYPE1(~#y~0.base, ~bvadd32(~#y~0.offset, ~k~0), 1bv32); {349#false} is VALID [2020-07-28 18:12:12,807 INFO L280 TraceCheckUtils]: 10: Hoare triple {349#false} assume 0bv32 == ~sign_extendFrom8To32(main_#t~mem4);havoc main_#t~mem4; {349#false} is VALID [2020-07-28 18:12:12,808 INFO L280 TraceCheckUtils]: 11: Hoare triple {349#false} assume !false; {349#false} is VALID [2020-07-28 18:12:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 18:12:12,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:12:12,897 INFO L280 TraceCheckUtils]: 11: Hoare triple {349#false} assume !false; {349#false} is VALID [2020-07-28 18:12:12,897 INFO L280 TraceCheckUtils]: 10: Hoare triple {349#false} assume 0bv32 == ~sign_extendFrom8To32(main_#t~mem4);havoc main_#t~mem4; {349#false} is VALID [2020-07-28 18:12:12,898 INFO L280 TraceCheckUtils]: 9: Hoare triple {349#false} assume ~bvsge32(~k~0, 0bv32) && ~bvslt32(~k~0, ~i~0);call main_#t~mem4 := read~intINTTYPE1(~#y~0.base, ~bvadd32(~#y~0.offset, ~k~0), 1bv32); {349#false} is VALID [2020-07-28 18:12:12,898 INFO L280 TraceCheckUtils]: 8: Hoare triple {349#false} call write~intINTTYPE1(0bv8, ~#y~0.base, ~bvadd32(~#y~0.offset, ~i~0), 1bv32); {349#false} is VALID [2020-07-28 18:12:12,898 INFO L280 TraceCheckUtils]: 7: Hoare triple {349#false} assume !(0bv32 != ~sign_extendFrom8To32(main_#t~mem1));havoc main_#t~mem1; {349#false} is VALID [2020-07-28 18:12:12,899 INFO L280 TraceCheckUtils]: 6: Hoare triple {349#false} call main_#t~mem1 := read~intINTTYPE1(~#x~0.base, ~bvadd32(~#x~0.offset, ~i~0), 1bv32); {349#false} is VALID [2020-07-28 18:12:12,899 INFO L280 TraceCheckUtils]: 5: Hoare triple {349#false} assume !!(0bv32 != ~sign_extendFrom8To32(main_#t~mem1));havoc main_#t~mem1;call main_#t~mem2 := read~intINTTYPE1(~#x~0.base, ~bvadd32(~#x~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(main_#t~mem2, ~#y~0.base, ~bvadd32(~#y~0.offset, ~i~0), 1bv32);havoc main_#t~mem2;main_#t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, main_#t~post3);havoc main_#t~post3; {349#false} is VALID [2020-07-28 18:12:12,900 INFO L280 TraceCheckUtils]: 4: Hoare triple {349#false} call main_#t~mem1 := read~intINTTYPE1(~#x~0.base, ~bvadd32(~#x~0.offset, ~i~0), 1bv32); {349#false} is VALID [2020-07-28 18:12:12,902 INFO L280 TraceCheckUtils]: 3: Hoare triple {412#(= ((_ sign_extend 24) |ULTIMATE.start_main_#t~mem1|) (_ bv0 32))} assume !!(0bv32 != ~sign_extendFrom8To32(main_#t~mem1));havoc main_#t~mem1;call main_#t~mem2 := read~intINTTYPE1(~#x~0.base, ~bvadd32(~#x~0.offset, ~i~0), 1bv32);call write~intINTTYPE1(main_#t~mem2, ~#y~0.base, ~bvadd32(~#y~0.offset, ~i~0), 1bv32);havoc main_#t~mem2;main_#t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, main_#t~post3);havoc main_#t~post3; {349#false} is VALID [2020-07-28 18:12:12,904 INFO L280 TraceCheckUtils]: 2: Hoare triple {416#(forall ((~i~0 (_ BitVec 32)) (|~#x~0.offset| (_ BitVec 32))) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |~#x~0.base|) (bvadd ~i~0 |~#x~0.offset|))))))} call main_#t~mem1 := read~intINTTYPE1(~#x~0.base, ~bvadd32(~#x~0.offset, ~i~0), 1bv32); {412#(= ((_ sign_extend 24) |ULTIMATE.start_main_#t~mem1|) (_ bv0 32))} is VALID [2020-07-28 18:12:12,905 INFO L280 TraceCheckUtils]: 1: Hoare triple {416#(forall ((~i~0 (_ BitVec 32)) (|~#x~0.offset| (_ BitVec 32))) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |~#x~0.base|) (bvadd ~i~0 |~#x~0.offset|))))))} havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~post3, main_#t~mem1, main_#t~mem4;~k~0 := main_#t~nondet0;havoc main_#t~nondet0;~i~0 := 0bv32; {416#(forall ((~i~0 (_ BitVec 32)) (|~#x~0.offset| (_ BitVec 32))) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |~#x~0.base|) (bvadd ~i~0 |~#x~0.offset|))))))} is VALID [2020-07-28 18:12:12,911 INFO L280 TraceCheckUtils]: 0: Hoare triple {348#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {416#(forall ((~i~0 (_ BitVec 32)) (|~#x~0.offset| (_ BitVec 32))) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |~#x~0.base|) (bvadd ~i~0 |~#x~0.offset|))))))} is VALID [2020-07-28 18:12:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 18:12:12,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174936863] [2020-07-28 18:12:12,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:12:12,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-07-28 18:12:12,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861793284] [2020-07-28 18:12:12,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-28 18:12:12,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:12,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:12:12,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:12,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:12:12,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:12:12,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:12:12,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:12:12,948 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2020-07-28 18:12:17,015 WARN L193 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2020-07-28 18:12:17,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:17,022 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-28 18:12:17,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:12:17,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-28 18:12:17,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:12:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-07-28 18:12:17,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:12:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-07-28 18:12:17,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 11 transitions. [2020-07-28 18:12:17,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:17,050 INFO L225 Difference]: With dead ends: 13 [2020-07-28 18:12:17,050 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:12:17,051 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:12:17,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:12:17,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:12:17,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:17,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:12:17,052 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:12:17,052 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:12:17,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:17,052 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:12:17,052 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:12:17,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:17,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:17,053 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:12:17,053 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:12:17,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:17,053 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:12:17,053 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:12:17,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:17,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:17,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:17,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:12:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:12:17,054 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2020-07-28 18:12:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:17,054 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:12:17,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:12:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:12:17,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:17,255 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 18:12:17,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:12:19,348 WARN L193 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 20 [2020-07-28 18:12:19,352 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:12:19,352 INFO L268 CegarLoopResult]: For program point L19(lines 19 20) no Hoare annotation was computed. [2020-07-28 18:12:19,352 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 18:12:19,353 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:12:19,353 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:12:19,353 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2020-07-28 18:12:19,353 INFO L271 CegarLoopResult]: At program point L22(lines 8 23) the Hoare annotation is: true [2020-07-28 18:12:19,353 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-28 18:12:19,354 INFO L268 CegarLoopResult]: For program point L18(lines 18 20) no Hoare annotation was computed. [2020-07-28 18:12:19,354 INFO L268 CegarLoopResult]: For program point L18-1(lines 18 20) no Hoare annotation was computed. [2020-07-28 18:12:19,354 INFO L268 CegarLoopResult]: For program point L12-1(lines 12 15) no Hoare annotation was computed. [2020-07-28 18:12:19,354 INFO L264 CegarLoopResult]: At program point L12-3(lines 12 15) the Hoare annotation is: (and (= |~#y~0.offset| (_ bv0 32)) (exists ((|~#y~0.base| (_ BitVec 32))) (and (not (= |~#y~0.base| |~#x~0.base|)) (= (select |#memory_int| |~#y~0.base|) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32))))) (= ~i~0 (_ bv0 32)) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |~#x~0.base|)) (= |~#x~0.offset| (_ bv0 32))) [2020-07-28 18:12:19,354 INFO L268 CegarLoopResult]: For program point L12-4(lines 12 15) no Hoare annotation was computed. [2020-07-28 18:12:19,359 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:12:19,359 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 18:12:19,359 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2020-07-28 18:12:19,359 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2020-07-28 18:12:19,359 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2020-07-28 18:12:19,360 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2020-07-28 18:12:19,360 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2020-07-28 18:12:19,360 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-28 18:12:19,360 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-28 18:12:19,360 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-28 18:12:19,360 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-28 18:12:19,361 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-28 18:12:19,361 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-28 18:12:19,361 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-28 18:12:19,361 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:12:19,361 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:12:19,362 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:12:19,368 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:217) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 18:12:19,375 INFO L168 Benchmark]: Toolchain (without parser) took 31835.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 961.6 MB in the beginning and 1.2 GB in the end (delta: -190.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:12:19,375 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:12:19,382 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.15 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:19,384 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:19,385 INFO L168 Benchmark]: Boogie Preprocessor took 30.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:12:19,390 INFO L168 Benchmark]: RCFGBuilder took 401.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:19,393 INFO L168 Benchmark]: TraceAbstraction took 30988.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -58.4 MB). Peak memory consumption was 6.1 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:19,396 INFO L336 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.15 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 401.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30988.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -58.4 MB). Peak memory consumption was 6.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...