./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/test24-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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/test24-1.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 043660dc5a969bbd34b12cbb93ba3e467b4f8613 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 16:57:35,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:57:35,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:57:35,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:57:35,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:57:35,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:57:35,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:57:35,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:57:35,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:57:35,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:57:35,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:57:35,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:57:35,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:57:35,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:57:35,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:57:35,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:57:35,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:57:35,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:57:35,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:57:35,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:57:35,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:57:35,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:57:35,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:57:35,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:57:35,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:57:35,986 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:57:35,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:57:35,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:57:35,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:57:35,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:57:35,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:57:35,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:57:35,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:57:35,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:57:35,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:57:35,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:57:35,994 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:57:35,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:57:35,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:57:35,995 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:57:35,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:57:35,998 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 16:57:36,021 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:57:36,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:57:36,024 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:57:36,025 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:57:36,025 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:57:36,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:57:36,026 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:57:36,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 16:57:36,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:57:36,027 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:57:36,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:57:36,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:57:36,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:57:36,029 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:57:36,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:57:36,030 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:57:36,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:57:36,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:57:36,031 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:57:36,031 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:57:36,032 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:57:36,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:57:36,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:57:36,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:57:36,033 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:57:36,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 16:57:36,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 16:57:36,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:57:36,034 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:57:36,034 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 -> 043660dc5a969bbd34b12cbb93ba3e467b4f8613 [2019-11-28 16:57:36,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:57:36,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:57:36,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:57:36,377 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:57:36,377 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:57:36,378 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test24-1.c [2019-11-28 16:57:36,440 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90be4b5f/83250cfb1c0e428c950d31145ec29fef/FLAG9a4491a4f [2019-11-28 16:57:36,903 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:57:36,904 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test24-1.c [2019-11-28 16:57:36,911 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90be4b5f/83250cfb1c0e428c950d31145ec29fef/FLAG9a4491a4f [2019-11-28 16:57:37,309 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90be4b5f/83250cfb1c0e428c950d31145ec29fef [2019-11-28 16:57:37,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:57:37,315 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:57:37,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:57:37,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:57:37,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:57:37,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:57:37" (1/1) ... [2019-11-28 16:57:37,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600cef8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:37, skipping insertion in model container [2019-11-28 16:57:37,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:57:37" (1/1) ... [2019-11-28 16:57:37,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:57:37,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:57:37,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:57:37,609 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:57:37,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:57:37,645 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:57:37,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:37 WrapperNode [2019-11-28 16:57:37,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:57:37,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:57:37,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:57:37,647 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:57:37,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:37" (1/1) ... [2019-11-28 16:57:37,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:37" (1/1) ... [2019-11-28 16:57:37,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:57:37,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:57:37,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:57:37,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:57:37,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:37" (1/1) ... [2019-11-28 16:57:37,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:37" (1/1) ... [2019-11-28 16:57:37,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:37" (1/1) ... [2019-11-28 16:57:37,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:37" (1/1) ... [2019-11-28 16:57:37,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:37" (1/1) ... [2019-11-28 16:57:37,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:37" (1/1) ... [2019-11-28 16:57:37,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:37" (1/1) ... [2019-11-28 16:57:37,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:57:37,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:57:37,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:57:37,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:57:37,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:37" (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 [2019-11-28 16:57:37,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 16:57:37,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:57:37,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:57:37,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 16:57:37,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 16:57:37,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 16:57:38,121 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:57:38,121 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 16:57:38,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:57:38 BoogieIcfgContainer [2019-11-28 16:57:38,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:57:38,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:57:38,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:57:38,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:57:38,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:57:37" (1/3) ... [2019-11-28 16:57:38,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf45789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:57:38, skipping insertion in model container [2019-11-28 16:57:38,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:37" (2/3) ... [2019-11-28 16:57:38,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf45789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:57:38, skipping insertion in model container [2019-11-28 16:57:38,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:57:38" (3/3) ... [2019-11-28 16:57:38,143 INFO L109 eAbstractionObserver]: Analyzing ICFG test24-1.c [2019-11-28 16:57:38,162 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:57:38,169 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 16:57:38,182 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 16:57:38,202 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:57:38,202 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:57:38,202 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:57:38,202 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:57:38,202 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:57:38,202 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:57:38,203 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:57:38,203 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:57:38,219 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-11-28 16:57:38,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 16:57:38,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:38,232 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:38,232 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:38,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:38,240 INFO L82 PathProgramCache]: Analyzing trace with hash 126985497, now seen corresponding path program 1 times [2019-11-28 16:57:38,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:38,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902974962] [2019-11-28 16:57:38,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:38,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902974962] [2019-11-28 16:57:38,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:57:38,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 16:57:38,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109621387] [2019-11-28 16:57:38,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:57:38,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:38,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:57:38,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:57:38,410 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-11-28 16:57:38,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:38,426 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-11-28 16:57:38,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:57:38,428 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-28 16:57:38,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:38,436 INFO L225 Difference]: With dead ends: 23 [2019-11-28 16:57:38,436 INFO L226 Difference]: Without dead ends: 10 [2019-11-28 16:57:38,440 INFO L630 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 [2019-11-28 16:57:38,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-11-28 16:57:38,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-28 16:57:38,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 16:57:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-11-28 16:57:38,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-11-28 16:57:38,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:38,472 INFO L462 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-11-28 16:57:38,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:57:38,472 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-11-28 16:57:38,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 16:57:38,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:38,473 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:38,473 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:38,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:38,474 INFO L82 PathProgramCache]: Analyzing trace with hash -564424753, now seen corresponding path program 1 times [2019-11-28 16:57:38,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:38,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588678041] [2019-11-28 16:57:38,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:38,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588678041] [2019-11-28 16:57:38,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:57:38,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:57:38,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495226727] [2019-11-28 16:57:38,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:57:38,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:38,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:57:38,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:57:38,629 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 4 states. [2019-11-28 16:57:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:38,708 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-11-28 16:57:38,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:57:38,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 16:57:38,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:38,710 INFO L225 Difference]: With dead ends: 17 [2019-11-28 16:57:38,710 INFO L226 Difference]: Without dead ends: 12 [2019-11-28 16:57:38,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:57:38,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-11-28 16:57:38,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-28 16:57:38,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 16:57:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-11-28 16:57:38,715 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-11-28 16:57:38,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:38,715 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-11-28 16:57:38,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:57:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-11-28 16:57:38,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 16:57:38,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:38,716 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:38,716 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:38,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:38,717 INFO L82 PathProgramCache]: Analyzing trace with hash 263489748, now seen corresponding path program 1 times [2019-11-28 16:57:38,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:38,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169221626] [2019-11-28 16:57:38,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:38,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169221626] [2019-11-28 16:57:38,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631821850] [2019-11-28 16:57:38,857 INFO L94 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 [2019-11-28 16:57:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:38,926 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 16:57:38,932 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:57:43,095 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 16:57:43,100 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:57:43,101 INFO L377 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 27 treesize of output 12 [2019-11-28 16:57:43,102 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:57:43,116 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:57:43,119 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:57:43,119 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-11-28 16:57:43,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:43,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:57:43,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-11-28 16:57:43,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800081722] [2019-11-28 16:57:43,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 16:57:43,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:43,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 16:57:43,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=44, Unknown=2, NotChecked=0, Total=72 [2019-11-28 16:57:43,136 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2019-11-28 16:57:43,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:43,259 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-28 16:57:43,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 16:57:43,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-11-28 16:57:43,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:43,261 INFO L225 Difference]: With dead ends: 21 [2019-11-28 16:57:43,261 INFO L226 Difference]: Without dead ends: 16 [2019-11-28 16:57:43,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=57, Invalid=97, Unknown=2, NotChecked=0, Total=156 [2019-11-28 16:57:43,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-28 16:57:43,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-28 16:57:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 16:57:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-11-28 16:57:43,267 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 11 [2019-11-28 16:57:43,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:43,268 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-11-28 16:57:43,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 16:57:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-11-28 16:57:43,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 16:57:43,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:43,269 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:43,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:57:43,474 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:43,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:43,475 INFO L82 PathProgramCache]: Analyzing trace with hash -919715042, now seen corresponding path program 2 times [2019-11-28 16:57:43,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:43,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767250846] [2019-11-28 16:57:43,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:43,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767250846] [2019-11-28 16:57:43,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459191347] [2019-11-28 16:57:43,625 INFO L92 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 [2019-11-28 16:57:43,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 16:57:43,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 16:57:43,684 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 16:57:43,688 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:57:43,724 INFO L377 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 27 treesize of output 23 [2019-11-28 16:57:43,724 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:57:43,739 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:57:43,741 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:57:43,741 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:55 [2019-11-28 16:57:43,898 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 16:57:43,900 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:57:43,901 INFO L377 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 50 treesize of output 21 [2019-11-28 16:57:43,902 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:57:43,912 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:57:43,913 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 16:57:43,914 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:30 [2019-11-28 16:57:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:47,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:57:47,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-28 16:57:47,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978694233] [2019-11-28 16:57:47,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 16:57:47,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:47,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 16:57:47,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=104, Unknown=2, NotChecked=0, Total=156 [2019-11-28 16:57:47,270 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 13 states. [2019-11-28 16:57:49,324 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-28 16:57:53,392 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-11-28 16:57:55,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:55,552 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-11-28 16:57:55,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 16:57:55,553 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-11-28 16:57:55,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:55,554 INFO L225 Difference]: With dead ends: 23 [2019-11-28 16:57:55,554 INFO L226 Difference]: Without dead ends: 18 [2019-11-28 16:57:55,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=103, Invalid=200, Unknown=3, NotChecked=0, Total=306 [2019-11-28 16:57:55,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-28 16:57:55,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-28 16:57:55,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 16:57:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-11-28 16:57:55,560 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-11-28 16:57:55,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:55,560 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-11-28 16:57:55,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 16:57:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-11-28 16:57:55,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 16:57:55,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:55,561 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:55,762 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:57:55,763 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:55,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:55,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1868061597, now seen corresponding path program 3 times [2019-11-28 16:57:55,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:55,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493547448] [2019-11-28 16:57:55,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:57:55,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493547448] [2019-11-28 16:57:55,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038580341] [2019-11-28 16:57:55,942 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-11-28 16:57:55,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 16:57:55,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 16:57:55,989 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 16:57:55,991 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:57:55,999 INFO L377 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 25 treesize of output 21 [2019-11-28 16:57:56,000 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:57:56,010 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:57:56,010 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:57:56,011 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-11-28 16:57:56,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:57:56,271 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 16:57:56,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:57:56,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-28 16:57:56,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981084790] [2019-11-28 16:57:56,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 16:57:56,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:56,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 16:57:56,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-11-28 16:57:56,273 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2019-11-28 16:57:57,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:57,313 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-11-28 16:57:57,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 16:57:57,313 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-11-28 16:57:57,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:57,314 INFO L225 Difference]: With dead ends: 23 [2019-11-28 16:57:57,314 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 16:57:57,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2019-11-28 16:57:57,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 16:57:57,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 16:57:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 16:57:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 16:57:57,317 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-11-28 16:57:57,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:57,317 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 16:57:57,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 16:57:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 16:57:57,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 16:57:57,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:57:57,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 16:57:57,645 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 16:57:57,646 INFO L246 CegarLoopResult]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-11-28 16:57:57,646 INFO L246 CegarLoopResult]: For program point L21(lines 21 32) no Hoare annotation was computed. [2019-11-28 16:57:57,646 INFO L246 CegarLoopResult]: For program point L21-2(lines 21 32) no Hoare annotation was computed. [2019-11-28 16:57:57,662 INFO L242 CegarLoopResult]: At program point L11(lines 9 12) the Hoare annotation is: (and (= (mod (+ (* |ULTIMATE.start_main_~#ad1~0.offset| 7) ULTIMATE.start_main_~pa~0.offset) 8) 0) (let ((.cse0 (div (+ (- |ULTIMATE.start_main_~#ad1~0.offset|) ULTIMATE.start_main_~pa~0.offset) 8))) (= .cse0 (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* .cse0 8))))) (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|) (= 1 |ULTIMATE.start_check_#res|) (exists ((ULTIMATE.start_main_~pa~0.offset Int)) (let ((.cse3 (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|))) (let ((.cse1 (select .cse3 ULTIMATE.start_main_~pa~0.offset))) (and (<= .cse1 ULTIMATE.start_main_~i~0) (= (mod (+ (* |ULTIMATE.start_main_~#ad1~0.offset| 7) ULTIMATE.start_main_~pa~0.offset) 8) 0) (let ((.cse2 (div (+ (- |ULTIMATE.start_main_~#ad1~0.offset|) ULTIMATE.start_main_~pa~0.offset) 8))) (= .cse2 (select .cse3 (+ |ULTIMATE.start_main_~#ad1~0.offset| (* .cse2 8))))) (<= ULTIMATE.start_main_~i~0 .cse1)))))) [2019-11-28 16:57:57,662 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 16:57:57,663 INFO L242 CegarLoopResult]: At program point L30(lines 15 38) the Hoare annotation is: false [2019-11-28 16:57:57,663 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 16:57:57,663 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 16:57:57,663 INFO L246 CegarLoopResult]: For program point L26-1(lines 26 28) no Hoare annotation was computed. [2019-11-28 16:57:57,664 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2019-11-28 16:57:57,664 INFO L242 CegarLoopResult]: At program point L26-3(lines 26 28) the Hoare annotation is: (and (= (mod (+ (* |ULTIMATE.start_main_~#ad1~0.offset| 7) ULTIMATE.start_main_~pa~0.offset) 8) 0) (let ((.cse0 (div (+ (* |ULTIMATE.start_main_~#ad1~0.offset| (- 1)) ULTIMATE.start_main_~pa~0.offset) 8))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* .cse0 8))) .cse0)) (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|)) [2019-11-28 16:57:57,664 INFO L246 CegarLoopResult]: For program point L26-4(lines 26 28) no Hoare annotation was computed. [2019-11-28 16:57:57,664 INFO L249 CegarLoopResult]: At program point L37(lines 14 38) the Hoare annotation is: true [2019-11-28 16:57:57,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2019-11-28 16:57:57,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2019-11-28 16:57:57,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2019-11-28 16:57:57,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2019-11-28 16:57:57,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2019-11-28 16:57:57,682 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,682 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,683 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,683 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,683 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2019-11-28 16:57:57,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2019-11-28 16:57:57,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2019-11-28 16:57:57,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2019-11-28 16:57:57,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2019-11-28 16:57:57,691 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,691 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,692 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,692 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,692 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,695 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,695 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,696 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,697 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:57:57 BoogieIcfgContainer [2019-11-28 16:57:57,702 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:57:57,702 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:57:57,703 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:57:57,704 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:57:57,705 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:57:38" (3/4) ... [2019-11-28 16:57:57,708 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 16:57:57,721 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-28 16:57:57,721 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 16:57:57,721 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 16:57:57,753 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ad1 * 7 + pa) % 8 == 0 && (-ad1 + pa) / 8 == unknown-#memory_int-unknown[ad1][ad1 + (-ad1 + pa) / 8 * 8]) && i <= unknown-#memory_int-unknown[pa][pa]) && pa == ad1) && 1 == \result) && (\exists ULTIMATE.start_main_~pa~0.offset : int :: ((unknown-#memory_int-unknown[ad1][ULTIMATE.start_main_~pa~0.offset] <= i && (ad1 * 7 + ULTIMATE.start_main_~pa~0.offset) % 8 == 0) && (-ad1 + ULTIMATE.start_main_~pa~0.offset) / 8 == unknown-#memory_int-unknown[ad1][ad1 + (-ad1 + ULTIMATE.start_main_~pa~0.offset) / 8 * 8]) && i <= unknown-#memory_int-unknown[ad1][ULTIMATE.start_main_~pa~0.offset]) [2019-11-28 16:57:57,774 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 16:57:57,777 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:57:57,779 INFO L168 Benchmark]: Toolchain (without parser) took 20464.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -222.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:57:57,783 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:57:57,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.20 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 16:57:57,785 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 16:57:57,785 INFO L168 Benchmark]: Boogie Preprocessor took 28.26 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. [2019-11-28 16:57:57,786 INFO L168 Benchmark]: RCFGBuilder took 343.01 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: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:57:57,790 INFO L168 Benchmark]: TraceAbstraction took 19577.97 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.7 MB). Peak memory consumption was 295.3 MB. Max. memory is 11.5 GB. [2019-11-28 16:57:57,792 INFO L168 Benchmark]: Witness Printer took 74.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-28 16:57:57,798 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.20 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 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 104.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.26 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 343.01 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: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19577.97 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.7 MB). Peak memory consumption was 295.3 MB. Max. memory is 11.5 GB. * Witness Printer took 74.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 36]: 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: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9]: Loop Invariant [2019-11-28 16:57:57,821 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2019-11-28 16:57:57,821 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2019-11-28 16:57:57,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2019-11-28 16:57:57,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2019-11-28 16:57:57,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2019-11-28 16:57:57,823 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,825 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,825 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,825 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,826 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2019-11-28 16:57:57,828 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2019-11-28 16:57:57,828 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2019-11-28 16:57:57,828 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2019-11-28 16:57:57,830 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2019-11-28 16:57:57,832 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((ad1 * 7 + pa) % 8 == 0 && (-ad1 + pa) / 8 == unknown-#memory_int-unknown[ad1][ad1 + (-ad1 + pa) / 8 * 8]) && i <= unknown-#memory_int-unknown[pa][pa]) && pa == ad1) && 1 == \result) && (\exists ULTIMATE.start_main_~pa~0.offset : int :: ((unknown-#memory_int-unknown[ad1][ULTIMATE.start_main_~pa~0.offset] <= i && (ad1 * 7 + ULTIMATE.start_main_~pa~0.offset) % 8 == 0) && (-ad1 + ULTIMATE.start_main_~pa~0.offset) / 8 == unknown-#memory_int-unknown[ad1][ad1 + (-ad1 + ULTIMATE.start_main_~pa~0.offset) / 8 * 8]) && i <= unknown-#memory_int-unknown[ad1][ULTIMATE.start_main_~pa~0.offset]) - InvariantResult [Line: 26]: Loop Invariant [2019-11-28 16:57:57,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,838 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 16:57:57,839 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((ad1 * 7 + pa) % 8 == 0 && unknown-#memory_int-unknown[ad1][ad1 + (ad1 * -1 + pa) / 8 * 8] == (ad1 * -1 + pa) / 8) && i <= unknown-#memory_int-unknown[pa][pa]) && pa == ad1 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Result: SAFE, OverallTime: 19.3s, OverallIterations: 5, TraceHistogramMax: 5, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 42 SDtfs, 30 SDslu, 56 SDs, 0 SdLazy, 141 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 17.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 11 NumberOfFragments, 135 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 475 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 103 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 95 ConstructedInterpolants, 13 QuantifiedInterpolants, 17107 SizeOfPredicates, 30 NumberOfNonLiveVariables, 201 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 16/68 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...