./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/test25-2.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/ldv-regression/test25-2.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 5d33db1882917813547794c8974f871f0a78640e ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:58:43,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:58:43,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:58:43,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:58:43,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:58:43,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:58:43,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:58:43,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:58:43,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:58:43,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:58:43,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:58:43,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:58:43,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:58:43,874 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:58:43,875 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:58:43,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:58:43,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:58:43,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:58:43,884 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:58:43,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:58:43,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:58:43,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:58:43,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:58:43,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:58:43,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:58:43,906 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:58:43,906 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:58:43,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:58:43,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:58:43,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:58:43,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:58:43,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:58:43,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:58:43,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:58:43,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:58:43,912 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:58:43,912 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:58:43,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:58:43,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:58:43,914 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:58:43,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:58:43,915 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 17:58:43,930 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:58:43,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:58:43,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:58:43,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:58:43,932 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:58:43,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:58:43,932 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:58:43,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:58:43,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:58:43,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:58:43,933 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:58:43,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:58:43,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:58:43,934 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:58:43,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:58:43,934 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:58:43,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:58:43,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:58:43,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:58:43,935 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:58:43,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:58:43,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:58:43,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:58:43,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:58:43,936 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:58:43,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:58:43,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:58:43,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:58:43,937 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:58:43,937 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 -> 5d33db1882917813547794c8974f871f0a78640e [2020-07-28 17:58:44,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:58:44,255 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:58:44,259 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:58:44,261 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:58:44,262 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:58:44,262 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test25-2.c [2020-07-28 17:58:44,329 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21ddb565e/ad2ccb04e841406aae3a642d78eeafbd/FLAGa88f09d2a [2020-07-28 17:58:44,746 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:58:44,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test25-2.c [2020-07-28 17:58:44,752 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21ddb565e/ad2ccb04e841406aae3a642d78eeafbd/FLAGa88f09d2a [2020-07-28 17:58:45,177 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21ddb565e/ad2ccb04e841406aae3a642d78eeafbd [2020-07-28 17:58:45,180 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:58:45,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:58:45,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:58:45,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:58:45,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:58:45,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:58:45" (1/1) ... [2020-07-28 17:58:45,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c837261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:45, skipping insertion in model container [2020-07-28 17:58:45,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:58:45" (1/1) ... [2020-07-28 17:58:45,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:58:45,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:58:45,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:58:45,418 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:58:45,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:58:45,461 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:58:45,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:45 WrapperNode [2020-07-28 17:58:45,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:58:45,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:58:45,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:58:45,463 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:58:45,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:45" (1/1) ... [2020-07-28 17:58:45,556 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:45" (1/1) ... [2020-07-28 17:58:45,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:58:45,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:58:45,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:58:45,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:58:45,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:45" (1/1) ... [2020-07-28 17:58:45,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:45" (1/1) ... [2020-07-28 17:58:45,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:45" (1/1) ... [2020-07-28 17:58:45,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:45" (1/1) ... [2020-07-28 17:58:45,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:45" (1/1) ... [2020-07-28 17:58:45,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:45" (1/1) ... [2020-07-28 17:58:45,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:45" (1/1) ... [2020-07-28 17:58:45,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:58:45,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:58:45,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:58:45,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:58:45,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:45" (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 17:58:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 17:58:45,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-28 17:58:45,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:58:45,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:58:45,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:58:45,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-28 17:58:45,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:58:45,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:58:46,195 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:58:46,196 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-28 17:58:46,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:58:46 BoogieIcfgContainer [2020-07-28 17:58:46,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:58:46,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:58:46,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:58:46,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:58:46,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:58:45" (1/3) ... [2020-07-28 17:58:46,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b72dc81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:58:46, skipping insertion in model container [2020-07-28 17:58:46,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:45" (2/3) ... [2020-07-28 17:58:46,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b72dc81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:58:46, skipping insertion in model container [2020-07-28 17:58:46,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:58:46" (3/3) ... [2020-07-28 17:58:46,207 INFO L109 eAbstractionObserver]: Analyzing ICFG test25-2.c [2020-07-28 17:58:46,219 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:58:46,226 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:58:46,241 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:58:46,265 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:58:46,265 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:58:46,265 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:58:46,266 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:58:46,266 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:58:46,266 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:58:46,266 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:58:46,266 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:58:46,282 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-07-28 17:58:46,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 17:58:46,288 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:46,289 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:58:46,290 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:46,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:46,296 INFO L82 PathProgramCache]: Analyzing trace with hash -631347226, now seen corresponding path program 1 times [2020-07-28 17:58:46,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:46,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821891954] [2020-07-28 17:58:46,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:46,481 INFO L280 TraceCheckUtils]: 0: Hoare triple {20#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {20#true} is VALID [2020-07-28 17:58:46,482 INFO L280 TraceCheckUtils]: 1: Hoare triple {20#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; {20#true} is VALID [2020-07-28 17:58:46,483 INFO L280 TraceCheckUtils]: 2: Hoare triple {20#true} assume !(main_~j~0 < 10); {20#true} is VALID [2020-07-28 17:58:46,483 INFO L280 TraceCheckUtils]: 3: Hoare triple {20#true} assume main_~i~0 >= 0 && main_~i~0 < 10;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); {20#true} is VALID [2020-07-28 17:58:46,484 INFO L280 TraceCheckUtils]: 4: Hoare triple {20#true} assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; {20#true} is VALID [2020-07-28 17:58:46,485 INFO L280 TraceCheckUtils]: 5: Hoare triple {20#true} assume !true; {21#false} is VALID [2020-07-28 17:58:46,485 INFO L280 TraceCheckUtils]: 6: Hoare triple {21#false} check_#in~pc.base, check_#in~pc.offset, check_#in~i := main_~#cont~0.base, main_~#cont~0.offset, main_~i~0;havoc check_#res;havoc check_#t~mem0.base, check_#t~mem0.offset, check_#t~mem1, check_~pc.base, check_~pc.offset, check_~i;check_~pc.base, check_~pc.offset := check_#in~pc.base, check_#in~pc.offset;check_~i := check_#in~i;call check_#t~mem0.base, check_#t~mem0.offset := read~$Pointer$(check_~pc.base, check_~pc.offset, 4);call check_#t~mem1 := read~int(check_#t~mem0.base, 4 + check_#t~mem0.offset, 4);check_#res := (if check_#t~mem1 == check_~i then 1 else 0);havoc check_#t~mem0.base, check_#t~mem0.offset;havoc check_#t~mem1; {21#false} is VALID [2020-07-28 17:58:46,486 INFO L280 TraceCheckUtils]: 7: Hoare triple {21#false} main_#t~ret12 := check_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647; {21#false} is VALID [2020-07-28 17:58:46,486 INFO L280 TraceCheckUtils]: 8: Hoare triple {21#false} assume 0 == main_#t~ret12;havoc main_#t~ret12; {21#false} is VALID [2020-07-28 17:58:46,487 INFO L280 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2020-07-28 17:58:46,489 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 17:58:46,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821891954] [2020-07-28 17:58:46,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:58:46,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:58:46,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048109108] [2020-07-28 17:58:46,498 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-28 17:58:46,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:46,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:58:46,528 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 17:58:46,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:58:46,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:46,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:58:46,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:58:46,541 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2020-07-28 17:58:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:46,594 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2020-07-28 17:58:46,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:58:46,594 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-28 17:58:46,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:46,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:58:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 40 transitions. [2020-07-28 17:58:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:58:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 40 transitions. [2020-07-28 17:58:46,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 40 transitions. [2020-07-28 17:58:46,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:46,692 INFO L225 Difference]: With dead ends: 30 [2020-07-28 17:58:46,693 INFO L226 Difference]: Without dead ends: 13 [2020-07-28 17:58:46,696 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 17:58:46,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-28 17:58:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-28 17:58:46,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:58:46,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2020-07-28 17:58:46,736 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-28 17:58:46,736 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-28 17:58:46,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:46,739 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-28 17:58:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-28 17:58:46,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:46,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:46,741 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-28 17:58:46,741 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-28 17:58:46,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:46,743 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-28 17:58:46,743 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-28 17:58:46,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:46,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:46,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:58:46,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:58:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 17:58:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-07-28 17:58:46,750 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2020-07-28 17:58:46,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:58:46,750 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-28 17:58:46,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:58:46,751 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-28 17:58:46,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:58:46,751 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:46,751 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:58:46,752 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:58:46,752 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:46,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:46,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1697064536, now seen corresponding path program 1 times [2020-07-28 17:58:46,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:46,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531979755] [2020-07-28 17:58:46,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:46,880 INFO L280 TraceCheckUtils]: 0: Hoare triple {106#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {106#true} is VALID [2020-07-28 17:58:46,882 INFO L280 TraceCheckUtils]: 1: Hoare triple {106#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; {108#(= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 17:58:46,883 INFO L280 TraceCheckUtils]: 2: Hoare triple {108#(= 0 ULTIMATE.start_main_~j~0)} assume !(main_~j~0 < 10); {107#false} is VALID [2020-07-28 17:58:46,884 INFO L280 TraceCheckUtils]: 3: Hoare triple {107#false} assume main_~i~0 >= 0 && main_~i~0 < 10;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); {107#false} is VALID [2020-07-28 17:58:46,884 INFO L280 TraceCheckUtils]: 4: Hoare triple {107#false} assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; {107#false} is VALID [2020-07-28 17:58:46,885 INFO L280 TraceCheckUtils]: 5: Hoare triple {107#false} call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {107#false} is VALID [2020-07-28 17:58:46,885 INFO L280 TraceCheckUtils]: 6: Hoare triple {107#false} assume !(main_~i~0 < main_#t~mem10);havoc main_#t~mem10; {107#false} is VALID [2020-07-28 17:58:46,885 INFO L280 TraceCheckUtils]: 7: Hoare triple {107#false} check_#in~pc.base, check_#in~pc.offset, check_#in~i := main_~#cont~0.base, main_~#cont~0.offset, main_~i~0;havoc check_#res;havoc check_#t~mem0.base, check_#t~mem0.offset, check_#t~mem1, check_~pc.base, check_~pc.offset, check_~i;check_~pc.base, check_~pc.offset := check_#in~pc.base, check_#in~pc.offset;check_~i := check_#in~i;call check_#t~mem0.base, check_#t~mem0.offset := read~$Pointer$(check_~pc.base, check_~pc.offset, 4);call check_#t~mem1 := read~int(check_#t~mem0.base, 4 + check_#t~mem0.offset, 4);check_#res := (if check_#t~mem1 == check_~i then 1 else 0);havoc check_#t~mem0.base, check_#t~mem0.offset;havoc check_#t~mem1; {107#false} is VALID [2020-07-28 17:58:46,886 INFO L280 TraceCheckUtils]: 8: Hoare triple {107#false} main_#t~ret12 := check_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647; {107#false} is VALID [2020-07-28 17:58:46,886 INFO L280 TraceCheckUtils]: 9: Hoare triple {107#false} assume 0 == main_#t~ret12;havoc main_#t~ret12; {107#false} is VALID [2020-07-28 17:58:46,886 INFO L280 TraceCheckUtils]: 10: Hoare triple {107#false} assume !false; {107#false} is VALID [2020-07-28 17:58:46,887 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 17:58:46,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531979755] [2020-07-28 17:58:46,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:58:46,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 17:58:46,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558160001] [2020-07-28 17:58:46,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-28 17:58:46,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:46,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 17:58:46,910 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 17:58:46,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 17:58:46,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:46,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 17:58:46,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:58:46,911 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2020-07-28 17:58:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:46,966 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-28 17:58:46,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 17:58:46,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-28 17:58:46,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:46,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:58:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2020-07-28 17:58:46,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:58:46,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2020-07-28 17:58:46,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2020-07-28 17:58:47,024 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 17:58:47,025 INFO L225 Difference]: With dead ends: 24 [2020-07-28 17:58:47,026 INFO L226 Difference]: Without dead ends: 15 [2020-07-28 17:58:47,027 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 17:58:47,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-28 17:58:47,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-07-28 17:58:47,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:58:47,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 14 states. [2020-07-28 17:58:47,034 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 14 states. [2020-07-28 17:58:47,035 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 14 states. [2020-07-28 17:58:47,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:47,037 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-28 17:58:47,037 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-28 17:58:47,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:47,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:47,038 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 15 states. [2020-07-28 17:58:47,039 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 15 states. [2020-07-28 17:58:47,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:47,041 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-28 17:58:47,041 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-28 17:58:47,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:47,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:47,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:58:47,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:58:47,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 17:58:47,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2020-07-28 17:58:47,045 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2020-07-28 17:58:47,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:58:47,045 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-07-28 17:58:47,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 17:58:47,046 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-28 17:58:47,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 17:58:47,047 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:47,047 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:58:47,047 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:58:47,048 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:47,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:47,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1434190826, now seen corresponding path program 1 times [2020-07-28 17:58:47,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:47,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531635314] [2020-07-28 17:58:47,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:47,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {192#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {192#true} is VALID [2020-07-28 17:58:47,145 INFO L280 TraceCheckUtils]: 1: Hoare triple {192#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; {194#(= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 17:58:47,146 INFO L280 TraceCheckUtils]: 2: Hoare triple {194#(= 0 ULTIMATE.start_main_~j~0)} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {194#(= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 17:58:47,147 INFO L280 TraceCheckUtils]: 3: Hoare triple {194#(= 0 ULTIMATE.start_main_~j~0)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {195#(<= ULTIMATE.start_main_~j~0 1)} is VALID [2020-07-28 17:58:47,148 INFO L280 TraceCheckUtils]: 4: Hoare triple {195#(<= ULTIMATE.start_main_~j~0 1)} assume !(main_~j~0 < 10); {193#false} is VALID [2020-07-28 17:58:47,149 INFO L280 TraceCheckUtils]: 5: Hoare triple {193#false} assume main_~i~0 >= 0 && main_~i~0 < 10;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); {193#false} is VALID [2020-07-28 17:58:47,149 INFO L280 TraceCheckUtils]: 6: Hoare triple {193#false} assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; {193#false} is VALID [2020-07-28 17:58:47,149 INFO L280 TraceCheckUtils]: 7: Hoare triple {193#false} call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {193#false} is VALID [2020-07-28 17:58:47,150 INFO L280 TraceCheckUtils]: 8: Hoare triple {193#false} assume !(main_~i~0 < main_#t~mem10);havoc main_#t~mem10; {193#false} is VALID [2020-07-28 17:58:47,151 INFO L280 TraceCheckUtils]: 9: Hoare triple {193#false} check_#in~pc.base, check_#in~pc.offset, check_#in~i := main_~#cont~0.base, main_~#cont~0.offset, main_~i~0;havoc check_#res;havoc check_#t~mem0.base, check_#t~mem0.offset, check_#t~mem1, check_~pc.base, check_~pc.offset, check_~i;check_~pc.base, check_~pc.offset := check_#in~pc.base, check_#in~pc.offset;check_~i := check_#in~i;call check_#t~mem0.base, check_#t~mem0.offset := read~$Pointer$(check_~pc.base, check_~pc.offset, 4);call check_#t~mem1 := read~int(check_#t~mem0.base, 4 + check_#t~mem0.offset, 4);check_#res := (if check_#t~mem1 == check_~i then 1 else 0);havoc check_#t~mem0.base, check_#t~mem0.offset;havoc check_#t~mem1; {193#false} is VALID [2020-07-28 17:58:47,151 INFO L280 TraceCheckUtils]: 10: Hoare triple {193#false} main_#t~ret12 := check_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647; {193#false} is VALID [2020-07-28 17:58:47,151 INFO L280 TraceCheckUtils]: 11: Hoare triple {193#false} assume 0 == main_#t~ret12;havoc main_#t~ret12; {193#false} is VALID [2020-07-28 17:58:47,152 INFO L280 TraceCheckUtils]: 12: Hoare triple {193#false} assume !false; {193#false} is VALID [2020-07-28 17:58:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:58:47,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531635314] [2020-07-28 17:58:47,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866925161] [2020-07-28 17:58:47,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 17:58:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:47,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-28 17:58:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:47,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:58:47,364 INFO L280 TraceCheckUtils]: 0: Hoare triple {192#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {192#true} is VALID [2020-07-28 17:58:47,366 INFO L280 TraceCheckUtils]: 1: Hoare triple {192#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; {202#(<= ULTIMATE.start_main_~j~0 0)} is VALID [2020-07-28 17:58:47,367 INFO L280 TraceCheckUtils]: 2: Hoare triple {202#(<= ULTIMATE.start_main_~j~0 0)} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {202#(<= ULTIMATE.start_main_~j~0 0)} is VALID [2020-07-28 17:58:47,368 INFO L280 TraceCheckUtils]: 3: Hoare triple {202#(<= ULTIMATE.start_main_~j~0 0)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {195#(<= ULTIMATE.start_main_~j~0 1)} is VALID [2020-07-28 17:58:47,369 INFO L280 TraceCheckUtils]: 4: Hoare triple {195#(<= ULTIMATE.start_main_~j~0 1)} assume !(main_~j~0 < 10); {193#false} is VALID [2020-07-28 17:58:47,370 INFO L280 TraceCheckUtils]: 5: Hoare triple {193#false} assume main_~i~0 >= 0 && main_~i~0 < 10;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); {193#false} is VALID [2020-07-28 17:58:47,370 INFO L280 TraceCheckUtils]: 6: Hoare triple {193#false} assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; {193#false} is VALID [2020-07-28 17:58:47,370 INFO L280 TraceCheckUtils]: 7: Hoare triple {193#false} call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {193#false} is VALID [2020-07-28 17:58:47,371 INFO L280 TraceCheckUtils]: 8: Hoare triple {193#false} assume !(main_~i~0 < main_#t~mem10);havoc main_#t~mem10; {193#false} is VALID [2020-07-28 17:58:47,371 INFO L280 TraceCheckUtils]: 9: Hoare triple {193#false} check_#in~pc.base, check_#in~pc.offset, check_#in~i := main_~#cont~0.base, main_~#cont~0.offset, main_~i~0;havoc check_#res;havoc check_#t~mem0.base, check_#t~mem0.offset, check_#t~mem1, check_~pc.base, check_~pc.offset, check_~i;check_~pc.base, check_~pc.offset := check_#in~pc.base, check_#in~pc.offset;check_~i := check_#in~i;call check_#t~mem0.base, check_#t~mem0.offset := read~$Pointer$(check_~pc.base, check_~pc.offset, 4);call check_#t~mem1 := read~int(check_#t~mem0.base, 4 + check_#t~mem0.offset, 4);check_#res := (if check_#t~mem1 == check_~i then 1 else 0);havoc check_#t~mem0.base, check_#t~mem0.offset;havoc check_#t~mem1; {193#false} is VALID [2020-07-28 17:58:47,372 INFO L280 TraceCheckUtils]: 10: Hoare triple {193#false} main_#t~ret12 := check_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647; {193#false} is VALID [2020-07-28 17:58:47,372 INFO L280 TraceCheckUtils]: 11: Hoare triple {193#false} assume 0 == main_#t~ret12;havoc main_#t~ret12; {193#false} is VALID [2020-07-28 17:58:47,372 INFO L280 TraceCheckUtils]: 12: Hoare triple {193#false} assume !false; {193#false} is VALID [2020-07-28 17:58:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:58:47,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 17:58:47,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-07-28 17:58:47,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403998564] [2020-07-28 17:58:47,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-28 17:58:47,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:47,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 17:58:47,403 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 17:58:47,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 17:58:47,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:47,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 17:58:47,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:58:47,405 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2020-07-28 17:58:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:47,493 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-28 17:58:47,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 17:58:47,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-28 17:58:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:58:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2020-07-28 17:58:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:58:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2020-07-28 17:58:47,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2020-07-28 17:58:47,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:47,545 INFO L225 Difference]: With dead ends: 26 [2020-07-28 17:58:47,545 INFO L226 Difference]: Without dead ends: 17 [2020-07-28 17:58:47,546 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:58:47,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-28 17:58:47,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-07-28 17:58:47,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:58:47,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 16 states. [2020-07-28 17:58:47,554 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 16 states. [2020-07-28 17:58:47,554 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 16 states. [2020-07-28 17:58:47,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:47,556 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-28 17:58:47,556 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-28 17:58:47,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:47,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:47,557 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 17 states. [2020-07-28 17:58:47,557 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 17 states. [2020-07-28 17:58:47,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:47,559 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-28 17:58:47,559 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-28 17:58:47,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:47,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:47,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:58:47,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:58:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 17:58:47,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2020-07-28 17:58:47,562 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2020-07-28 17:58:47,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:58:47,562 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2020-07-28 17:58:47,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 17:58:47,563 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2020-07-28 17:58:47,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:58:47,563 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:47,564 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:58:47,777 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 17:58:47,778 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:47,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:47,779 INFO L82 PathProgramCache]: Analyzing trace with hash 201480788, now seen corresponding path program 2 times [2020-07-28 17:58:47,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:47,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212928961] [2020-07-28 17:58:47,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:47,877 INFO L280 TraceCheckUtils]: 0: Hoare triple {326#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {326#true} is VALID [2020-07-28 17:58:47,878 INFO L280 TraceCheckUtils]: 1: Hoare triple {326#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; {328#(= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 17:58:47,879 INFO L280 TraceCheckUtils]: 2: Hoare triple {328#(= 0 ULTIMATE.start_main_~j~0)} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {328#(= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 17:58:47,880 INFO L280 TraceCheckUtils]: 3: Hoare triple {328#(= 0 ULTIMATE.start_main_~j~0)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {329#(<= ULTIMATE.start_main_~j~0 1)} is VALID [2020-07-28 17:58:47,881 INFO L280 TraceCheckUtils]: 4: Hoare triple {329#(<= ULTIMATE.start_main_~j~0 1)} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {329#(<= ULTIMATE.start_main_~j~0 1)} is VALID [2020-07-28 17:58:47,882 INFO L280 TraceCheckUtils]: 5: Hoare triple {329#(<= ULTIMATE.start_main_~j~0 1)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {330#(<= ULTIMATE.start_main_~j~0 2)} is VALID [2020-07-28 17:58:47,883 INFO L280 TraceCheckUtils]: 6: Hoare triple {330#(<= ULTIMATE.start_main_~j~0 2)} assume !(main_~j~0 < 10); {327#false} is VALID [2020-07-28 17:58:47,883 INFO L280 TraceCheckUtils]: 7: Hoare triple {327#false} assume main_~i~0 >= 0 && main_~i~0 < 10;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); {327#false} is VALID [2020-07-28 17:58:47,883 INFO L280 TraceCheckUtils]: 8: Hoare triple {327#false} assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; {327#false} is VALID [2020-07-28 17:58:47,884 INFO L280 TraceCheckUtils]: 9: Hoare triple {327#false} call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {327#false} is VALID [2020-07-28 17:58:47,884 INFO L280 TraceCheckUtils]: 10: Hoare triple {327#false} assume !(main_~i~0 < main_#t~mem10);havoc main_#t~mem10; {327#false} is VALID [2020-07-28 17:58:47,885 INFO L280 TraceCheckUtils]: 11: Hoare triple {327#false} check_#in~pc.base, check_#in~pc.offset, check_#in~i := main_~#cont~0.base, main_~#cont~0.offset, main_~i~0;havoc check_#res;havoc check_#t~mem0.base, check_#t~mem0.offset, check_#t~mem1, check_~pc.base, check_~pc.offset, check_~i;check_~pc.base, check_~pc.offset := check_#in~pc.base, check_#in~pc.offset;check_~i := check_#in~i;call check_#t~mem0.base, check_#t~mem0.offset := read~$Pointer$(check_~pc.base, check_~pc.offset, 4);call check_#t~mem1 := read~int(check_#t~mem0.base, 4 + check_#t~mem0.offset, 4);check_#res := (if check_#t~mem1 == check_~i then 1 else 0);havoc check_#t~mem0.base, check_#t~mem0.offset;havoc check_#t~mem1; {327#false} is VALID [2020-07-28 17:58:47,885 INFO L280 TraceCheckUtils]: 12: Hoare triple {327#false} main_#t~ret12 := check_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647; {327#false} is VALID [2020-07-28 17:58:47,885 INFO L280 TraceCheckUtils]: 13: Hoare triple {327#false} assume 0 == main_#t~ret12;havoc main_#t~ret12; {327#false} is VALID [2020-07-28 17:58:47,886 INFO L280 TraceCheckUtils]: 14: Hoare triple {327#false} assume !false; {327#false} is VALID [2020-07-28 17:58:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:58:47,887 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212928961] [2020-07-28 17:58:47,887 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432394096] [2020-07-28 17:58:47,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 17:58:47,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-28 17:58:47,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 17:58:47,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-28 17:58:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:47,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:58:48,231 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-28 17:58:48,239 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:58:48,240 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 28 treesize of output 12 [2020-07-28 17:58:48,262 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 17:58:48,270 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:58:48,324 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:58:48,325 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2020-07-28 17:58:48,329 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 17:58:48,329 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, ULTIMATE.start_main_~pa~0.base, ULTIMATE.start_main_~pa~0.offset, |ULTIMATE.start_main_~#array~0.offset|]. (let ((.cse0 (select |#memory_int| ULTIMATE.start_main_~pa~0.base))) (and (<= (select .cse0 ULTIMATE.start_main_~pa~0.offset) |ULTIMATE.start_main_#t~mem10|) (<= (+ ULTIMATE.start_main_~i~0 10) (select .cse0 (+ |ULTIMATE.start_main_~#array~0.offset| (* (div (+ (- ULTIMATE.start_main_~pa~0.offset) |ULTIMATE.start_main_~#array~0.offset| 4) (- 8)) 8) 4))) (= 0 (mod (+ |ULTIMATE.start_main_~#array~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7) 4) (- 8))))) [2020-07-28 17:58:48,329 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ ULTIMATE.start_main_~i~0 10) |ULTIMATE.start_main_#t~mem10|) [2020-07-28 17:58:48,411 INFO L280 TraceCheckUtils]: 0: Hoare triple {326#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {326#true} is VALID [2020-07-28 17:58:48,411 INFO L280 TraceCheckUtils]: 1: Hoare triple {326#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; {326#true} is VALID [2020-07-28 17:58:48,412 INFO L280 TraceCheckUtils]: 2: Hoare triple {326#true} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {326#true} is VALID [2020-07-28 17:58:48,412 INFO L280 TraceCheckUtils]: 3: Hoare triple {326#true} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {326#true} is VALID [2020-07-28 17:58:48,412 INFO L280 TraceCheckUtils]: 4: Hoare triple {326#true} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {326#true} is VALID [2020-07-28 17:58:48,413 INFO L280 TraceCheckUtils]: 5: Hoare triple {326#true} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {326#true} is VALID [2020-07-28 17:58:48,413 INFO L280 TraceCheckUtils]: 6: Hoare triple {326#true} assume !(main_~j~0 < 10); {326#true} is VALID [2020-07-28 17:58:48,416 INFO L280 TraceCheckUtils]: 7: Hoare triple {326#true} assume main_~i~0 >= 0 && main_~i~0 < 10;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); {355#(and (= |ULTIMATE.start_main_~#array~0.base| ULTIMATE.start_main_~pa~0.base) (= (+ |ULTIMATE.start_main_~#array~0.offset| (* 8 ULTIMATE.start_main_~i~0) 4) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:58:48,435 INFO L280 TraceCheckUtils]: 8: Hoare triple {355#(and (= |ULTIMATE.start_main_~#array~0.base| ULTIMATE.start_main_~pa~0.base) (= (+ |ULTIMATE.start_main_~#array~0.offset| (* 8 ULTIMATE.start_main_~i~0) 4) ULTIMATE.start_main_~pa~0.offset))} assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; {359#(exists ((|ULTIMATE.start_main_~#array~0.offset| Int)) (and (<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) (+ |ULTIMATE.start_main_~#array~0.offset| (* (div (+ (- ULTIMATE.start_main_~pa~0.offset) |ULTIMATE.start_main_~#array~0.offset| 4) (- 8)) 8) 4))) (= 0 (mod (+ |ULTIMATE.start_main_~#array~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7) 4) (- 8)))))} is VALID [2020-07-28 17:58:48,438 INFO L280 TraceCheckUtils]: 9: Hoare triple {359#(exists ((|ULTIMATE.start_main_~#array~0.offset| Int)) (and (<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) (+ |ULTIMATE.start_main_~#array~0.offset| (* (div (+ (- ULTIMATE.start_main_~pa~0.offset) |ULTIMATE.start_main_~#array~0.offset| 4) (- 8)) 8) 4))) (= 0 (mod (+ |ULTIMATE.start_main_~#array~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7) 4) (- 8)))))} call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {363#(<= (+ ULTIMATE.start_main_~i~0 10) |ULTIMATE.start_main_#t~mem10|)} is VALID [2020-07-28 17:58:48,439 INFO L280 TraceCheckUtils]: 10: Hoare triple {363#(<= (+ ULTIMATE.start_main_~i~0 10) |ULTIMATE.start_main_#t~mem10|)} assume !(main_~i~0 < main_#t~mem10);havoc main_#t~mem10; {327#false} is VALID [2020-07-28 17:58:48,440 INFO L280 TraceCheckUtils]: 11: Hoare triple {327#false} check_#in~pc.base, check_#in~pc.offset, check_#in~i := main_~#cont~0.base, main_~#cont~0.offset, main_~i~0;havoc check_#res;havoc check_#t~mem0.base, check_#t~mem0.offset, check_#t~mem1, check_~pc.base, check_~pc.offset, check_~i;check_~pc.base, check_~pc.offset := check_#in~pc.base, check_#in~pc.offset;check_~i := check_#in~i;call check_#t~mem0.base, check_#t~mem0.offset := read~$Pointer$(check_~pc.base, check_~pc.offset, 4);call check_#t~mem1 := read~int(check_#t~mem0.base, 4 + check_#t~mem0.offset, 4);check_#res := (if check_#t~mem1 == check_~i then 1 else 0);havoc check_#t~mem0.base, check_#t~mem0.offset;havoc check_#t~mem1; {327#false} is VALID [2020-07-28 17:58:48,440 INFO L280 TraceCheckUtils]: 12: Hoare triple {327#false} main_#t~ret12 := check_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647; {327#false} is VALID [2020-07-28 17:58:48,440 INFO L280 TraceCheckUtils]: 13: Hoare triple {327#false} assume 0 == main_#t~ret12;havoc main_#t~ret12; {327#false} is VALID [2020-07-28 17:58:48,441 INFO L280 TraceCheckUtils]: 14: Hoare triple {327#false} assume !false; {327#false} is VALID [2020-07-28 17:58:48,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-28 17:58:48,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-28 17:58:48,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2020-07-28 17:58:48,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563295234] [2020-07-28 17:58:48,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-28 17:58:48,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:48,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 17:58:50,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 12 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:50,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 17:58:50,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:50,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 17:58:50,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-28 17:58:50,555 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 5 states. [2020-07-28 17:58:50,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:50,769 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-28 17:58:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 17:58:50,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-28 17:58:50,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:50,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:58:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-07-28 17:58:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:58:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-07-28 17:58:50,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 21 transitions. [2020-07-28 17:58:50,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:50,835 INFO L225 Difference]: With dead ends: 23 [2020-07-28 17:58:50,835 INFO L226 Difference]: Without dead ends: 18 [2020-07-28 17:58:50,836 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-07-28 17:58:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-28 17:58:50,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-28 17:58:50,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:58:50,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-28 17:58:50,850 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-28 17:58:50,850 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-28 17:58:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:50,852 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-28 17:58:50,852 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-28 17:58:50,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:50,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:50,857 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-28 17:58:50,857 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-28 17:58:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:50,863 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-28 17:58:50,863 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-28 17:58:50,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:50,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:50,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:58:50,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:58:50,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 17:58:50,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-28 17:58:50,868 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2020-07-28 17:58:50,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:58:50,868 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-28 17:58:50,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 17:58:50,869 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-28 17:58:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-28 17:58:50,870 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:50,870 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:58:51,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 17:58:51,071 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:51,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:51,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1859304665, now seen corresponding path program 1 times [2020-07-28 17:58:51,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:51,073 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652181781] [2020-07-28 17:58:51,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:51,149 INFO L280 TraceCheckUtils]: 0: Hoare triple {473#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {473#true} is VALID [2020-07-28 17:58:51,150 INFO L280 TraceCheckUtils]: 1: Hoare triple {473#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; {475#(= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 17:58:51,151 INFO L280 TraceCheckUtils]: 2: Hoare triple {475#(= 0 ULTIMATE.start_main_~j~0)} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {475#(= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 17:58:51,152 INFO L280 TraceCheckUtils]: 3: Hoare triple {475#(= 0 ULTIMATE.start_main_~j~0)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {476#(<= ULTIMATE.start_main_~j~0 1)} is VALID [2020-07-28 17:58:51,153 INFO L280 TraceCheckUtils]: 4: Hoare triple {476#(<= ULTIMATE.start_main_~j~0 1)} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {476#(<= ULTIMATE.start_main_~j~0 1)} is VALID [2020-07-28 17:58:51,154 INFO L280 TraceCheckUtils]: 5: Hoare triple {476#(<= ULTIMATE.start_main_~j~0 1)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {477#(<= ULTIMATE.start_main_~j~0 2)} is VALID [2020-07-28 17:58:51,155 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#(<= ULTIMATE.start_main_~j~0 2)} assume !(main_~j~0 < 10); {474#false} is VALID [2020-07-28 17:58:51,155 INFO L280 TraceCheckUtils]: 7: Hoare triple {474#false} assume main_~i~0 >= 0 && main_~i~0 < 10;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); {474#false} is VALID [2020-07-28 17:58:51,155 INFO L280 TraceCheckUtils]: 8: Hoare triple {474#false} assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; {474#false} is VALID [2020-07-28 17:58:51,156 INFO L280 TraceCheckUtils]: 9: Hoare triple {474#false} call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {474#false} is VALID [2020-07-28 17:58:51,156 INFO L280 TraceCheckUtils]: 10: Hoare triple {474#false} assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre11; {474#false} is VALID [2020-07-28 17:58:51,156 INFO L280 TraceCheckUtils]: 11: Hoare triple {474#false} call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {474#false} is VALID [2020-07-28 17:58:51,156 INFO L280 TraceCheckUtils]: 12: Hoare triple {474#false} assume !(main_~i~0 < main_#t~mem10);havoc main_#t~mem10; {474#false} is VALID [2020-07-28 17:58:51,157 INFO L280 TraceCheckUtils]: 13: Hoare triple {474#false} check_#in~pc.base, check_#in~pc.offset, check_#in~i := main_~#cont~0.base, main_~#cont~0.offset, main_~i~0;havoc check_#res;havoc check_#t~mem0.base, check_#t~mem0.offset, check_#t~mem1, check_~pc.base, check_~pc.offset, check_~i;check_~pc.base, check_~pc.offset := check_#in~pc.base, check_#in~pc.offset;check_~i := check_#in~i;call check_#t~mem0.base, check_#t~mem0.offset := read~$Pointer$(check_~pc.base, check_~pc.offset, 4);call check_#t~mem1 := read~int(check_#t~mem0.base, 4 + check_#t~mem0.offset, 4);check_#res := (if check_#t~mem1 == check_~i then 1 else 0);havoc check_#t~mem0.base, check_#t~mem0.offset;havoc check_#t~mem1; {474#false} is VALID [2020-07-28 17:58:51,157 INFO L280 TraceCheckUtils]: 14: Hoare triple {474#false} main_#t~ret12 := check_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647; {474#false} is VALID [2020-07-28 17:58:51,157 INFO L280 TraceCheckUtils]: 15: Hoare triple {474#false} assume 0 == main_#t~ret12;havoc main_#t~ret12; {474#false} is VALID [2020-07-28 17:58:51,157 INFO L280 TraceCheckUtils]: 16: Hoare triple {474#false} assume !false; {474#false} is VALID [2020-07-28 17:58:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 17:58:51,158 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652181781] [2020-07-28 17:58:51,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299956690] [2020-07-28 17:58:51,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 17:58:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:51,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 17:58:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:51,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:58:51,341 INFO L280 TraceCheckUtils]: 0: Hoare triple {473#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {473#true} is VALID [2020-07-28 17:58:51,343 INFO L280 TraceCheckUtils]: 1: Hoare triple {473#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; {484#(<= ULTIMATE.start_main_~j~0 0)} is VALID [2020-07-28 17:58:51,344 INFO L280 TraceCheckUtils]: 2: Hoare triple {484#(<= ULTIMATE.start_main_~j~0 0)} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {484#(<= ULTIMATE.start_main_~j~0 0)} is VALID [2020-07-28 17:58:51,345 INFO L280 TraceCheckUtils]: 3: Hoare triple {484#(<= ULTIMATE.start_main_~j~0 0)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {476#(<= ULTIMATE.start_main_~j~0 1)} is VALID [2020-07-28 17:58:51,346 INFO L280 TraceCheckUtils]: 4: Hoare triple {476#(<= ULTIMATE.start_main_~j~0 1)} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {476#(<= ULTIMATE.start_main_~j~0 1)} is VALID [2020-07-28 17:58:51,347 INFO L280 TraceCheckUtils]: 5: Hoare triple {476#(<= ULTIMATE.start_main_~j~0 1)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {477#(<= ULTIMATE.start_main_~j~0 2)} is VALID [2020-07-28 17:58:51,348 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#(<= ULTIMATE.start_main_~j~0 2)} assume !(main_~j~0 < 10); {474#false} is VALID [2020-07-28 17:58:51,348 INFO L280 TraceCheckUtils]: 7: Hoare triple {474#false} assume main_~i~0 >= 0 && main_~i~0 < 10;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); {474#false} is VALID [2020-07-28 17:58:51,349 INFO L280 TraceCheckUtils]: 8: Hoare triple {474#false} assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; {474#false} is VALID [2020-07-28 17:58:51,349 INFO L280 TraceCheckUtils]: 9: Hoare triple {474#false} call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {474#false} is VALID [2020-07-28 17:58:51,349 INFO L280 TraceCheckUtils]: 10: Hoare triple {474#false} assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre11; {474#false} is VALID [2020-07-28 17:58:51,350 INFO L280 TraceCheckUtils]: 11: Hoare triple {474#false} call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {474#false} is VALID [2020-07-28 17:58:51,350 INFO L280 TraceCheckUtils]: 12: Hoare triple {474#false} assume !(main_~i~0 < main_#t~mem10);havoc main_#t~mem10; {474#false} is VALID [2020-07-28 17:58:51,350 INFO L280 TraceCheckUtils]: 13: Hoare triple {474#false} check_#in~pc.base, check_#in~pc.offset, check_#in~i := main_~#cont~0.base, main_~#cont~0.offset, main_~i~0;havoc check_#res;havoc check_#t~mem0.base, check_#t~mem0.offset, check_#t~mem1, check_~pc.base, check_~pc.offset, check_~i;check_~pc.base, check_~pc.offset := check_#in~pc.base, check_#in~pc.offset;check_~i := check_#in~i;call check_#t~mem0.base, check_#t~mem0.offset := read~$Pointer$(check_~pc.base, check_~pc.offset, 4);call check_#t~mem1 := read~int(check_#t~mem0.base, 4 + check_#t~mem0.offset, 4);check_#res := (if check_#t~mem1 == check_~i then 1 else 0);havoc check_#t~mem0.base, check_#t~mem0.offset;havoc check_#t~mem1; {474#false} is VALID [2020-07-28 17:58:51,350 INFO L280 TraceCheckUtils]: 14: Hoare triple {474#false} main_#t~ret12 := check_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647; {474#false} is VALID [2020-07-28 17:58:51,351 INFO L280 TraceCheckUtils]: 15: Hoare triple {474#false} assume 0 == main_#t~ret12;havoc main_#t~ret12; {474#false} is VALID [2020-07-28 17:58:51,351 INFO L280 TraceCheckUtils]: 16: Hoare triple {474#false} assume !false; {474#false} is VALID [2020-07-28 17:58:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 17:58:51,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 17:58:51,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-28 17:58:51,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821247234] [2020-07-28 17:58:51,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-28 17:58:51,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:51,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 17:58:51,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:51,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 17:58:51,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:51,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 17:58:51,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-28 17:58:51,383 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2020-07-28 17:58:51,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:51,494 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-28 17:58:51,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 17:58:51,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-28 17:58:51,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:58:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2020-07-28 17:58:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:58:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2020-07-28 17:58:51,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2020-07-28 17:58:51,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:51,558 INFO L225 Difference]: With dead ends: 32 [2020-07-28 17:58:51,559 INFO L226 Difference]: Without dead ends: 21 [2020-07-28 17:58:51,559 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-28 17:58:51,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-28 17:58:51,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-07-28 17:58:51,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:58:51,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 20 states. [2020-07-28 17:58:51,569 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 20 states. [2020-07-28 17:58:51,569 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 20 states. [2020-07-28 17:58:51,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:51,571 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-28 17:58:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-28 17:58:51,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:51,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:51,572 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states. [2020-07-28 17:58:51,572 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states. [2020-07-28 17:58:51,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:51,574 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-28 17:58:51,575 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-28 17:58:51,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:51,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:51,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:58:51,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:58:51,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-28 17:58:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-28 17:58:51,577 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2020-07-28 17:58:51,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:58:51,578 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-28 17:58:51,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 17:58:51,578 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-28 17:58:51,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-28 17:58:51,579 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:51,579 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:58:51,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 17:58:51,790 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:51,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:51,791 INFO L82 PathProgramCache]: Analyzing trace with hash 291228695, now seen corresponding path program 2 times [2020-07-28 17:58:51,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:51,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016501277] [2020-07-28 17:58:51,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:51,879 INFO L280 TraceCheckUtils]: 0: Hoare triple {643#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {643#true} is VALID [2020-07-28 17:58:51,881 INFO L280 TraceCheckUtils]: 1: Hoare triple {643#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; {645#(= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 17:58:51,882 INFO L280 TraceCheckUtils]: 2: Hoare triple {645#(= 0 ULTIMATE.start_main_~j~0)} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {645#(= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 17:58:51,883 INFO L280 TraceCheckUtils]: 3: Hoare triple {645#(= 0 ULTIMATE.start_main_~j~0)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {646#(<= ULTIMATE.start_main_~j~0 1)} is VALID [2020-07-28 17:58:51,884 INFO L280 TraceCheckUtils]: 4: Hoare triple {646#(<= ULTIMATE.start_main_~j~0 1)} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {646#(<= ULTIMATE.start_main_~j~0 1)} is VALID [2020-07-28 17:58:51,885 INFO L280 TraceCheckUtils]: 5: Hoare triple {646#(<= ULTIMATE.start_main_~j~0 1)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {647#(<= ULTIMATE.start_main_~j~0 2)} is VALID [2020-07-28 17:58:51,886 INFO L280 TraceCheckUtils]: 6: Hoare triple {647#(<= ULTIMATE.start_main_~j~0 2)} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {647#(<= ULTIMATE.start_main_~j~0 2)} is VALID [2020-07-28 17:58:51,887 INFO L280 TraceCheckUtils]: 7: Hoare triple {647#(<= ULTIMATE.start_main_~j~0 2)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {648#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-28 17:58:51,888 INFO L280 TraceCheckUtils]: 8: Hoare triple {648#(<= ULTIMATE.start_main_~j~0 3)} assume !(main_~j~0 < 10); {644#false} is VALID [2020-07-28 17:58:51,888 INFO L280 TraceCheckUtils]: 9: Hoare triple {644#false} assume main_~i~0 >= 0 && main_~i~0 < 10;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); {644#false} is VALID [2020-07-28 17:58:51,888 INFO L280 TraceCheckUtils]: 10: Hoare triple {644#false} assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; {644#false} is VALID [2020-07-28 17:58:51,888 INFO L280 TraceCheckUtils]: 11: Hoare triple {644#false} call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {644#false} is VALID [2020-07-28 17:58:51,889 INFO L280 TraceCheckUtils]: 12: Hoare triple {644#false} assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre11; {644#false} is VALID [2020-07-28 17:58:51,889 INFO L280 TraceCheckUtils]: 13: Hoare triple {644#false} call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {644#false} is VALID [2020-07-28 17:58:51,889 INFO L280 TraceCheckUtils]: 14: Hoare triple {644#false} assume !(main_~i~0 < main_#t~mem10);havoc main_#t~mem10; {644#false} is VALID [2020-07-28 17:58:51,890 INFO L280 TraceCheckUtils]: 15: Hoare triple {644#false} check_#in~pc.base, check_#in~pc.offset, check_#in~i := main_~#cont~0.base, main_~#cont~0.offset, main_~i~0;havoc check_#res;havoc check_#t~mem0.base, check_#t~mem0.offset, check_#t~mem1, check_~pc.base, check_~pc.offset, check_~i;check_~pc.base, check_~pc.offset := check_#in~pc.base, check_#in~pc.offset;check_~i := check_#in~i;call check_#t~mem0.base, check_#t~mem0.offset := read~$Pointer$(check_~pc.base, check_~pc.offset, 4);call check_#t~mem1 := read~int(check_#t~mem0.base, 4 + check_#t~mem0.offset, 4);check_#res := (if check_#t~mem1 == check_~i then 1 else 0);havoc check_#t~mem0.base, check_#t~mem0.offset;havoc check_#t~mem1; {644#false} is VALID [2020-07-28 17:58:51,890 INFO L280 TraceCheckUtils]: 16: Hoare triple {644#false} main_#t~ret12 := check_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647; {644#false} is VALID [2020-07-28 17:58:51,890 INFO L280 TraceCheckUtils]: 17: Hoare triple {644#false} assume 0 == main_#t~ret12;havoc main_#t~ret12; {644#false} is VALID [2020-07-28 17:58:51,890 INFO L280 TraceCheckUtils]: 18: Hoare triple {644#false} assume !false; {644#false} is VALID [2020-07-28 17:58:51,891 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 17:58:51,891 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016501277] [2020-07-28 17:58:51,892 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992679810] [2020-07-28 17:58:51,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 17:58:51,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 17:58:51,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 17:58:51,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-28 17:58:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:51,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:58:52,115 INFO L280 TraceCheckUtils]: 0: Hoare triple {643#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {643#true} is VALID [2020-07-28 17:58:52,117 INFO L280 TraceCheckUtils]: 1: Hoare triple {643#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; {655#(<= ULTIMATE.start_main_~j~0 0)} is VALID [2020-07-28 17:58:52,117 INFO L280 TraceCheckUtils]: 2: Hoare triple {655#(<= ULTIMATE.start_main_~j~0 0)} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {655#(<= ULTIMATE.start_main_~j~0 0)} is VALID [2020-07-28 17:58:52,118 INFO L280 TraceCheckUtils]: 3: Hoare triple {655#(<= ULTIMATE.start_main_~j~0 0)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {646#(<= ULTIMATE.start_main_~j~0 1)} is VALID [2020-07-28 17:58:52,119 INFO L280 TraceCheckUtils]: 4: Hoare triple {646#(<= ULTIMATE.start_main_~j~0 1)} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {646#(<= ULTIMATE.start_main_~j~0 1)} is VALID [2020-07-28 17:58:52,120 INFO L280 TraceCheckUtils]: 5: Hoare triple {646#(<= ULTIMATE.start_main_~j~0 1)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {647#(<= ULTIMATE.start_main_~j~0 2)} is VALID [2020-07-28 17:58:52,121 INFO L280 TraceCheckUtils]: 6: Hoare triple {647#(<= ULTIMATE.start_main_~j~0 2)} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {647#(<= ULTIMATE.start_main_~j~0 2)} is VALID [2020-07-28 17:58:52,122 INFO L280 TraceCheckUtils]: 7: Hoare triple {647#(<= ULTIMATE.start_main_~j~0 2)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {648#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-28 17:58:52,123 INFO L280 TraceCheckUtils]: 8: Hoare triple {648#(<= ULTIMATE.start_main_~j~0 3)} assume !(main_~j~0 < 10); {644#false} is VALID [2020-07-28 17:58:52,123 INFO L280 TraceCheckUtils]: 9: Hoare triple {644#false} assume main_~i~0 >= 0 && main_~i~0 < 10;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); {644#false} is VALID [2020-07-28 17:58:52,123 INFO L280 TraceCheckUtils]: 10: Hoare triple {644#false} assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; {644#false} is VALID [2020-07-28 17:58:52,123 INFO L280 TraceCheckUtils]: 11: Hoare triple {644#false} call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {644#false} is VALID [2020-07-28 17:58:52,124 INFO L280 TraceCheckUtils]: 12: Hoare triple {644#false} assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre11; {644#false} is VALID [2020-07-28 17:58:52,124 INFO L280 TraceCheckUtils]: 13: Hoare triple {644#false} call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {644#false} is VALID [2020-07-28 17:58:52,124 INFO L280 TraceCheckUtils]: 14: Hoare triple {644#false} assume !(main_~i~0 < main_#t~mem10);havoc main_#t~mem10; {644#false} is VALID [2020-07-28 17:58:52,124 INFO L280 TraceCheckUtils]: 15: Hoare triple {644#false} check_#in~pc.base, check_#in~pc.offset, check_#in~i := main_~#cont~0.base, main_~#cont~0.offset, main_~i~0;havoc check_#res;havoc check_#t~mem0.base, check_#t~mem0.offset, check_#t~mem1, check_~pc.base, check_~pc.offset, check_~i;check_~pc.base, check_~pc.offset := check_#in~pc.base, check_#in~pc.offset;check_~i := check_#in~i;call check_#t~mem0.base, check_#t~mem0.offset := read~$Pointer$(check_~pc.base, check_~pc.offset, 4);call check_#t~mem1 := read~int(check_#t~mem0.base, 4 + check_#t~mem0.offset, 4);check_#res := (if check_#t~mem1 == check_~i then 1 else 0);havoc check_#t~mem0.base, check_#t~mem0.offset;havoc check_#t~mem1; {644#false} is VALID [2020-07-28 17:58:52,125 INFO L280 TraceCheckUtils]: 16: Hoare triple {644#false} main_#t~ret12 := check_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647; {644#false} is VALID [2020-07-28 17:58:52,125 INFO L280 TraceCheckUtils]: 17: Hoare triple {644#false} assume 0 == main_#t~ret12;havoc main_#t~ret12; {644#false} is VALID [2020-07-28 17:58:52,125 INFO L280 TraceCheckUtils]: 18: Hoare triple {644#false} assume !false; {644#false} is VALID [2020-07-28 17:58:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 17:58:52,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 17:58:52,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-28 17:58:52,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166482478] [2020-07-28 17:58:52,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-28 17:58:52,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:52,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 17:58:52,159 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:52,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 17:58:52,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:52,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 17:58:52,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-28 17:58:52,160 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 7 states. [2020-07-28 17:58:52,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:52,279 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-28 17:58:52,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:58:52,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-28 17:58:52,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:52,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 17:58:52,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2020-07-28 17:58:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 17:58:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2020-07-28 17:58:52,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2020-07-28 17:58:52,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:52,336 INFO L225 Difference]: With dead ends: 34 [2020-07-28 17:58:52,336 INFO L226 Difference]: Without dead ends: 23 [2020-07-28 17:58:52,337 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-28 17:58:52,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-28 17:58:52,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-07-28 17:58:52,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:58:52,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 22 states. [2020-07-28 17:58:52,348 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 22 states. [2020-07-28 17:58:52,348 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 22 states. [2020-07-28 17:58:52,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:52,349 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-28 17:58:52,350 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-28 17:58:52,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:52,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:52,350 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states. [2020-07-28 17:58:52,350 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states. [2020-07-28 17:58:52,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:52,352 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-28 17:58:52,352 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-28 17:58:52,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:52,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:52,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:58:52,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:58:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-28 17:58:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-28 17:58:52,355 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2020-07-28 17:58:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:58:52,355 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-28 17:58:52,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 17:58:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-28 17:58:52,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 17:58:52,356 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:52,357 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:58:52,566 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 17:58:52,567 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:52,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:52,568 INFO L82 PathProgramCache]: Analyzing trace with hash 903742421, now seen corresponding path program 3 times [2020-07-28 17:58:52,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:52,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551741240] [2020-07-28 17:58:52,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:52,745 INFO L280 TraceCheckUtils]: 0: Hoare triple {830#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {830#true} is VALID [2020-07-28 17:58:52,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {830#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; {832#(= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 17:58:52,748 INFO L280 TraceCheckUtils]: 2: Hoare triple {832#(= 0 ULTIMATE.start_main_~j~0)} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {832#(= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 17:58:52,749 INFO L280 TraceCheckUtils]: 3: Hoare triple {832#(= 0 ULTIMATE.start_main_~j~0)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {833#(<= ULTIMATE.start_main_~j~0 1)} is VALID [2020-07-28 17:58:52,750 INFO L280 TraceCheckUtils]: 4: Hoare triple {833#(<= ULTIMATE.start_main_~j~0 1)} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {833#(<= ULTIMATE.start_main_~j~0 1)} is VALID [2020-07-28 17:58:52,751 INFO L280 TraceCheckUtils]: 5: Hoare triple {833#(<= ULTIMATE.start_main_~j~0 1)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {834#(<= ULTIMATE.start_main_~j~0 2)} is VALID [2020-07-28 17:58:52,752 INFO L280 TraceCheckUtils]: 6: Hoare triple {834#(<= ULTIMATE.start_main_~j~0 2)} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {834#(<= ULTIMATE.start_main_~j~0 2)} is VALID [2020-07-28 17:58:52,753 INFO L280 TraceCheckUtils]: 7: Hoare triple {834#(<= ULTIMATE.start_main_~j~0 2)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {835#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-28 17:58:52,754 INFO L280 TraceCheckUtils]: 8: Hoare triple {835#(<= ULTIMATE.start_main_~j~0 3)} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {835#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-28 17:58:52,755 INFO L280 TraceCheckUtils]: 9: Hoare triple {835#(<= ULTIMATE.start_main_~j~0 3)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {836#(<= ULTIMATE.start_main_~j~0 4)} is VALID [2020-07-28 17:58:52,756 INFO L280 TraceCheckUtils]: 10: Hoare triple {836#(<= ULTIMATE.start_main_~j~0 4)} assume !(main_~j~0 < 10); {831#false} is VALID [2020-07-28 17:58:52,756 INFO L280 TraceCheckUtils]: 11: Hoare triple {831#false} assume main_~i~0 >= 0 && main_~i~0 < 10;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); {831#false} is VALID [2020-07-28 17:58:52,757 INFO L280 TraceCheckUtils]: 12: Hoare triple {831#false} assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; {831#false} is VALID [2020-07-28 17:58:52,757 INFO L280 TraceCheckUtils]: 13: Hoare triple {831#false} call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {831#false} is VALID [2020-07-28 17:58:52,757 INFO L280 TraceCheckUtils]: 14: Hoare triple {831#false} assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre11; {831#false} is VALID [2020-07-28 17:58:52,757 INFO L280 TraceCheckUtils]: 15: Hoare triple {831#false} call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {831#false} is VALID [2020-07-28 17:58:52,757 INFO L280 TraceCheckUtils]: 16: Hoare triple {831#false} assume !(main_~i~0 < main_#t~mem10);havoc main_#t~mem10; {831#false} is VALID [2020-07-28 17:58:52,758 INFO L280 TraceCheckUtils]: 17: Hoare triple {831#false} check_#in~pc.base, check_#in~pc.offset, check_#in~i := main_~#cont~0.base, main_~#cont~0.offset, main_~i~0;havoc check_#res;havoc check_#t~mem0.base, check_#t~mem0.offset, check_#t~mem1, check_~pc.base, check_~pc.offset, check_~i;check_~pc.base, check_~pc.offset := check_#in~pc.base, check_#in~pc.offset;check_~i := check_#in~i;call check_#t~mem0.base, check_#t~mem0.offset := read~$Pointer$(check_~pc.base, check_~pc.offset, 4);call check_#t~mem1 := read~int(check_#t~mem0.base, 4 + check_#t~mem0.offset, 4);check_#res := (if check_#t~mem1 == check_~i then 1 else 0);havoc check_#t~mem0.base, check_#t~mem0.offset;havoc check_#t~mem1; {831#false} is VALID [2020-07-28 17:58:52,758 INFO L280 TraceCheckUtils]: 18: Hoare triple {831#false} main_#t~ret12 := check_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647; {831#false} is VALID [2020-07-28 17:58:52,759 INFO L280 TraceCheckUtils]: 19: Hoare triple {831#false} assume 0 == main_#t~ret12;havoc main_#t~ret12; {831#false} is VALID [2020-07-28 17:58:52,759 INFO L280 TraceCheckUtils]: 20: Hoare triple {831#false} assume !false; {831#false} is VALID [2020-07-28 17:58:52,760 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 17:58:52,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551741240] [2020-07-28 17:58:52,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824462908] [2020-07-28 17:58:52,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 17:58:52,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-28 17:58:52,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 17:58:52,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-28 17:58:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:52,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:58:52,879 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-28 17:58:52,880 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 17:58:52,892 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:58:52,896 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-28 17:58:52,897 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 17:58:52,908 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:58:52,912 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:58:52,912 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:17 [2020-07-28 17:58:52,917 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 17:58:52,917 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_9|, |ULTIMATE.start_main_~#array~0.offset|, ULTIMATE.start_main_~i~0, |v_#memory_$Pointer$.base_9|, |ULTIMATE.start_main_~#array~0.base|]. (and (= (store |v_#memory_$Pointer$.offset_9| |ULTIMATE.start_main_~#cont~0.base| (store (select |v_#memory_$Pointer$.offset_9| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset| (+ |ULTIMATE.start_main_~#array~0.offset| (* ULTIMATE.start_main_~i~0 8)))) |#memory_$Pointer$.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) ULTIMATE.start_main_~pa~0.base) (= (store |v_#memory_$Pointer$.base_9| |ULTIMATE.start_main_~#cont~0.base| (store (select |v_#memory_$Pointer$.base_9| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset| |ULTIMATE.start_main_~#array~0.base|)) |#memory_$Pointer$.base|) (= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4) ULTIMATE.start_main_~pa~0.offset)) [2020-07-28 17:58:52,917 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) ULTIMATE.start_main_~pa~0.base) (= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4) ULTIMATE.start_main_~pa~0.offset)) [2020-07-28 17:58:53,222 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 17:58:53,346 INFO L280 TraceCheckUtils]: 0: Hoare triple {830#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {830#true} is VALID [2020-07-28 17:58:53,346 INFO L280 TraceCheckUtils]: 1: Hoare triple {830#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; {830#true} is VALID [2020-07-28 17:58:53,346 INFO L280 TraceCheckUtils]: 2: Hoare triple {830#true} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {830#true} is VALID [2020-07-28 17:58:53,347 INFO L280 TraceCheckUtils]: 3: Hoare triple {830#true} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {830#true} is VALID [2020-07-28 17:58:53,347 INFO L280 TraceCheckUtils]: 4: Hoare triple {830#true} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {830#true} is VALID [2020-07-28 17:58:53,347 INFO L280 TraceCheckUtils]: 5: Hoare triple {830#true} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {830#true} is VALID [2020-07-28 17:58:53,347 INFO L280 TraceCheckUtils]: 6: Hoare triple {830#true} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {830#true} is VALID [2020-07-28 17:58:53,348 INFO L280 TraceCheckUtils]: 7: Hoare triple {830#true} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {830#true} is VALID [2020-07-28 17:58:53,348 INFO L280 TraceCheckUtils]: 8: Hoare triple {830#true} assume !!(main_~j~0 < 10);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; {830#true} is VALID [2020-07-28 17:58:53,348 INFO L280 TraceCheckUtils]: 9: Hoare triple {830#true} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {830#true} is VALID [2020-07-28 17:58:53,348 INFO L280 TraceCheckUtils]: 10: Hoare triple {830#true} assume !(main_~j~0 < 10); {830#true} is VALID [2020-07-28 17:58:53,350 INFO L280 TraceCheckUtils]: 11: Hoare triple {830#true} assume main_~i~0 >= 0 && main_~i~0 < 10;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); {873#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) ULTIMATE.start_main_~pa~0.base) (= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:58:53,351 INFO L280 TraceCheckUtils]: 12: Hoare triple {873#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) ULTIMATE.start_main_~pa~0.base) (= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4) ULTIMATE.start_main_~pa~0.offset))} assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; {873#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) ULTIMATE.start_main_~pa~0.base) (= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:58:53,352 INFO L280 TraceCheckUtils]: 13: Hoare triple {873#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) ULTIMATE.start_main_~pa~0.base) (= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4) ULTIMATE.start_main_~pa~0.offset))} call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {880#(and (<= |ULTIMATE.start_main_#t~mem10| (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) ULTIMATE.start_main_~pa~0.base) (= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:58:53,353 INFO L280 TraceCheckUtils]: 14: Hoare triple {880#(and (<= |ULTIMATE.start_main_#t~mem10| (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) ULTIMATE.start_main_~pa~0.base) (= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4) ULTIMATE.start_main_~pa~0.offset))} assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre11; {884#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) ULTIMATE.start_main_~pa~0.base) (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:58:53,355 INFO L280 TraceCheckUtils]: 15: Hoare triple {884#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) ULTIMATE.start_main_~pa~0.base) (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4) ULTIMATE.start_main_~pa~0.offset))} call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {888#(and (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4)) |ULTIMATE.start_main_#t~mem10|))} is VALID [2020-07-28 17:58:53,356 INFO L280 TraceCheckUtils]: 16: Hoare triple {888#(and (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4)) |ULTIMATE.start_main_#t~mem10|))} assume !(main_~i~0 < main_#t~mem10);havoc main_#t~mem10; {892#(and (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4)) ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 17:58:53,358 INFO L280 TraceCheckUtils]: 17: Hoare triple {892#(and (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4)) ULTIMATE.start_main_~i~0))} check_#in~pc.base, check_#in~pc.offset, check_#in~i := main_~#cont~0.base, main_~#cont~0.offset, main_~i~0;havoc check_#res;havoc check_#t~mem0.base, check_#t~mem0.offset, check_#t~mem1, check_~pc.base, check_~pc.offset, check_~i;check_~pc.base, check_~pc.offset := check_#in~pc.base, check_#in~pc.offset;check_~i := check_#in~i;call check_#t~mem0.base, check_#t~mem0.offset := read~$Pointer$(check_~pc.base, check_~pc.offset, 4);call check_#t~mem1 := read~int(check_#t~mem0.base, 4 + check_#t~mem0.offset, 4);check_#res := (if check_#t~mem1 == check_~i then 1 else 0);havoc check_#t~mem0.base, check_#t~mem0.offset;havoc check_#t~mem1; {896#(<= 1 |ULTIMATE.start_check_#res|)} is VALID [2020-07-28 17:58:53,362 INFO L280 TraceCheckUtils]: 18: Hoare triple {896#(<= 1 |ULTIMATE.start_check_#res|)} main_#t~ret12 := check_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647; {900#(<= 1 |ULTIMATE.start_main_#t~ret12|)} is VALID [2020-07-28 17:58:53,364 INFO L280 TraceCheckUtils]: 19: Hoare triple {900#(<= 1 |ULTIMATE.start_main_#t~ret12|)} assume 0 == main_#t~ret12;havoc main_#t~ret12; {831#false} is VALID [2020-07-28 17:58:53,365 INFO L280 TraceCheckUtils]: 20: Hoare triple {831#false} assume !false; {831#false} is VALID [2020-07-28 17:58:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-28 17:58:53,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 17:58:53,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2020-07-28 17:58:53,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237458735] [2020-07-28 17:58:53,369 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2020-07-28 17:58:53,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:53,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-28 17:58:53,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:53,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-28 17:58:53,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:53,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-28 17:58:53,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-07-28 17:58:53,420 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 14 states. [2020-07-28 17:58:54,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:54,088 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-28 17:58:54,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-28 17:58:54,089 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2020-07-28 17:58:54,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 17:58:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2020-07-28 17:58:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 17:58:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2020-07-28 17:58:54,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 35 transitions. [2020-07-28 17:58:54,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:54,152 INFO L225 Difference]: With dead ends: 34 [2020-07-28 17:58:54,152 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 17:58:54,153 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2020-07-28 17:58:54,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 17:58:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 17:58:54,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:58:54,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 17:58:54,154 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:58:54,154 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:58:54,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:54,155 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:58:54,156 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:58:54,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:54,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:54,157 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:58:54,157 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:58:54,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:54,157 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:58:54,157 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:58:54,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:54,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:54,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:58:54,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:58:54,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 17:58:54,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 17:58:54,158 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2020-07-28 17:58:54,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:58:54,158 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 17:58:54,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-28 17:58:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:58:54,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:54,361 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-28 17:58:54,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 17:58:54,450 INFO L268 CegarLoopResult]: For program point L27-2(lines 27 30) no Hoare annotation was computed. [2020-07-28 17:58:54,451 INFO L271 CegarLoopResult]: At program point L27-3(lines 27 30) the Hoare annotation is: true [2020-07-28 17:58:54,451 INFO L268 CegarLoopResult]: For program point L27-4(lines 21 50) no Hoare annotation was computed. [2020-07-28 17:58:54,451 INFO L268 CegarLoopResult]: For program point L40(lines 40 42) no Hoare annotation was computed. [2020-07-28 17:58:54,451 INFO L268 CegarLoopResult]: For program point L32(lines 32 44) no Hoare annotation was computed. [2020-07-28 17:58:54,451 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 17:58:54,451 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 17:58:54,451 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 17:58:54,451 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2020-07-28 17:58:54,451 INFO L271 CegarLoopResult]: At program point L49(lines 20 50) the Hoare annotation is: true [2020-07-28 17:58:54,452 INFO L264 CegarLoopResult]: At program point L41(lines 21 50) the Hoare annotation is: false [2020-07-28 17:58:54,452 INFO L268 CegarLoopResult]: For program point L37-1(lines 37 39) no Hoare annotation was computed. [2020-07-28 17:58:54,452 INFO L264 CegarLoopResult]: At program point L37-3(lines 37 39) the Hoare annotation is: (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) ULTIMATE.start_main_~pa~0.base) (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4) ULTIMATE.start_main_~pa~0.offset)) [2020-07-28 17:58:54,452 INFO L268 CegarLoopResult]: For program point L37-4(lines 37 39) no Hoare annotation was computed. [2020-07-28 17:58:54,452 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 17:58:54,452 INFO L264 CegarLoopResult]: At program point L17(lines 15 18) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|)) (.cse2 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4))) (let ((.cse1 (select (select |#memory_int| .cse0) .cse2))) (and (= .cse0 ULTIMATE.start_main_~pa~0.base) (<= ULTIMATE.start_main_~i~0 .cse1) (<= .cse1 ULTIMATE.start_main_~i~0) (= .cse2 ULTIMATE.start_main_~pa~0.offset) (<= 1 |ULTIMATE.start_check_#res|)))) [2020-07-28 17:58:54,452 INFO L268 CegarLoopResult]: For program point L35(lines 35 43) no Hoare annotation was computed. [2020-07-28 17:58:54,456 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:58:54,456 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:58:54,457 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2020-07-28 17:58:54,457 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2020-07-28 17:58:54,457 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2020-07-28 17:58:54,457 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2020-07-28 17:58:54,457 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2020-07-28 17:58:54,457 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2020-07-28 17:58:54,457 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-28 17:58:54,457 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-28 17:58:54,458 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-28 17:58:54,458 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-28 17:58:54,458 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-28 17:58:54,458 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:58:54,458 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-28 17:58:54,458 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-28 17:58:54,458 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-28 17:58:54,458 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:58:54,458 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-28 17:58:54,459 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-28 17:58:54,459 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-28 17:58:54,459 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-28 17:58:54,459 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 17:58:54,467 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-28 17:58:54,468 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-28 17:58:54,468 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-28 17:58:54,469 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-28 17:58:54,469 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-28 17:58:54,469 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-28 17:58:54,472 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:58:54,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,474 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:58:54,474 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,474 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,474 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,476 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-28 17:58:54,476 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-28 17:58:54,476 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-28 17:58:54,477 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-28 17:58:54,477 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-28 17:58:54,477 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-28 17:58:54,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:58:54,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,480 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:58:54,480 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,480 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,480 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,482 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-28 17:58:54,483 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-28 17:58:54,483 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,484 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:58:54,484 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,484 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-28 17:58:54,485 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-28 17:58:54,486 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,486 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:58:54,486 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:58:54 BoogieIcfgContainer [2020-07-28 17:58:54,489 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:58:54,489 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:58:54,489 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:58:54,490 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:58:54,490 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:58:46" (3/4) ... [2020-07-28 17:58:54,494 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 17:58:54,506 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-07-28 17:58:54,507 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-07-28 17:58:54,507 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 17:58:54,539 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((#memory_$Pointer$[cont][cont] == pa && i <= unknown-#memory_int-unknown[#memory_$Pointer$[cont][cont]][#memory_$Pointer$[cont][cont] + 4]) && unknown-#memory_int-unknown[#memory_$Pointer$[cont][cont]][#memory_$Pointer$[cont][cont] + 4] <= i) && #memory_$Pointer$[cont][cont] + 4 == pa) && 1 <= \result [2020-07-28 17:58:54,564 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 17:58:54,565 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:58:54,566 INFO L168 Benchmark]: Toolchain (without parser) took 9384.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 956.2 MB in the beginning and 860.0 MB in the end (delta: 96.2 MB). Peak memory consumption was 303.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:58:54,567 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:58:54,567 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.45 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.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 17:58:54,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 144.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2020-07-28 17:58:54,568 INFO L168 Benchmark]: Boogie Preprocessor took 56.19 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 17:58:54,569 INFO L168 Benchmark]: RCFGBuilder took 535.63 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: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:58:54,571 INFO L168 Benchmark]: TraceAbstraction took 8288.40 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 860.0 MB in the end (delta: 238.6 MB). Peak memory consumption was 303.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:58:54,571 INFO L168 Benchmark]: Witness Printer took 75.31 ms. Allocated memory is still 1.2 GB. Free memory is still 860.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:58:54,574 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 278.45 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.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 144.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.19 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 535.63 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: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8288.40 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 860.0 MB in the end (delta: 238.6 MB). Peak memory consumption was 303.6 MB. Max. memory is 11.5 GB. * Witness Printer took 75.31 ms. Allocated memory is still 1.2 GB. Free memory is still 860.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: 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: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 15]: Loop Invariant [2020-07-28 17:58:54,581 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-28 17:58:54,582 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-28 17:58:54,582 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-28 17:58:54,583 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-28 17:58:54,583 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-28 17:58:54,583 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-28 17:58:54,584 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,584 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:58:54,585 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,585 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,585 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:58:54,585 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,586 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,586 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,586 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-28 17:58:54,587 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-28 17:58:54,587 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-28 17:58:54,587 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-28 17:58:54,588 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-28 17:58:54,588 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-28 17:58:54,589 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,589 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:58:54,589 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,590 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,590 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:58:54,590 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,590 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,591 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((#memory_$Pointer$[cont][cont] == pa && i <= unknown-#memory_int-unknown[#memory_$Pointer$[cont][cont]][#memory_$Pointer$[cont][cont] + 4]) && unknown-#memory_int-unknown[#memory_$Pointer$[cont][cont]][#memory_$Pointer$[cont][cont] + 4] <= i) && #memory_$Pointer$[cont][cont] + 4 == pa) && 1 <= \result - InvariantResult [Line: 37]: Loop Invariant [2020-07-28 17:58:54,591 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-28 17:58:54,592 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-28 17:58:54,592 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,593 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:58:54,593 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,593 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-28 17:58:54,593 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-28 17:58:54,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-28 17:58:54,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:58:54,595 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (#memory_$Pointer$[cont][cont] == pa && i <= unknown-#memory_int-unknown[pa][pa]) && #memory_$Pointer$[cont][cont] + 4 == pa - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.1s, OverallIterations: 7, TraceHistogramMax: 4, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 84 SDtfs, 23 SDslu, 153 SDs, 0 SdLazy, 180 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 14 NumberOfFragments, 81 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 50 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 191 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 179 ConstructedInterpolants, 1 QuantifiedInterpolants, 7953 SizeOfPredicates, 35 NumberOfNonLiveVariables, 454 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 31/80 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...