./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/simple_1-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-acceleration/simple_1-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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5f1f98a9d9569081927d70508ec5957471f4b9a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:05:31,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:05:31,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:05:31,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:05:31,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:05:31,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:05:31,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:05:31,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:05:31,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:05:31,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:05:31,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:05:31,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:05:31,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:05:31,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:05:31,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:05:31,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:05:31,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:05:31,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:05:31,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:05:31,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:05:31,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:05:31,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:05:31,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:05:31,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:05:31,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:05:31,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:05:31,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:05:31,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:05:31,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:05:31,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:05:31,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:05:31,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:05:31,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:05:31,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:05:31,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:05:31,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:05:31,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:05:31,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:05:31,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:05:31,429 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:05:31,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:05:31,432 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-13 14:05:31,473 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:05:31,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:05:31,474 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:05:31,474 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:05:31,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:05:31,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:05:31,476 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:05:31,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:05:31,476 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:05:31,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:05:31,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:05:31,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:05:31,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:05:31,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:05:31,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:05:31,477 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:05:31,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:05:31,477 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:05:31,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:05:31,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:05:31,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:05:31,478 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:05:31,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:05:31,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:05:31,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:05:31,478 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:05:31,478 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:05:31,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:05:31,491 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:05:31,491 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:05:31,491 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e5f1f98a9d9569081927d70508ec5957471f4b9a [2021-09-13 14:05:31,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:05:31,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:05:31,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:05:31,788 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:05:31,788 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:05:31,789 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/simple_1-2.c [2021-09-13 14:05:31,837 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e7d28063/45cd90e9450644b7b4251574d6e574b7/FLAG3747ce921 [2021-09-13 14:05:32,289 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:05:32,290 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/simple_1-2.c [2021-09-13 14:05:32,295 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e7d28063/45cd90e9450644b7b4251574d6e574b7/FLAG3747ce921 [2021-09-13 14:05:32,309 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e7d28063/45cd90e9450644b7b4251574d6e574b7 [2021-09-13 14:05:32,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:05:32,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:05:32,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:05:32,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:05:32,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:05:32,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:05:32" (1/1) ... [2021-09-13 14:05:32,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1159cd96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:05:32, skipping insertion in model container [2021-09-13 14:05:32,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:05:32" (1/1) ... [2021-09-13 14:05:32,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:05:32,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:05:32,442 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/simple_1-2.c[322,335] [2021-09-13 14:05:32,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:05:32,468 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:05:32,487 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/simple_1-2.c[322,335] [2021-09-13 14:05:32,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:05:32,515 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:05:32,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:05:32 WrapperNode [2021-09-13 14:05:32,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:05:32,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:05:32,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:05:32,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:05:32,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:05:32" (1/1) ... [2021-09-13 14:05:32,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:05:32" (1/1) ... [2021-09-13 14:05:32,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:05:32,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:05:32,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:05:32,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:05:32,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:05:32" (1/1) ... [2021-09-13 14:05:32,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:05:32" (1/1) ... [2021-09-13 14:05:32,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:05:32" (1/1) ... [2021-09-13 14:05:32,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:05:32" (1/1) ... [2021-09-13 14:05:32,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:05:32" (1/1) ... [2021-09-13 14:05:32,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:05:32" (1/1) ... [2021-09-13 14:05:32,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:05:32" (1/1) ... [2021-09-13 14:05:32,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:05:32,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:05:32,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:05:32,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:05:32,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:05:32" (1/1) ... [2021-09-13 14:05:32,572 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:05:32,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:05:32,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-09-13 14:05:32,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-09-13 14:05:32,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:05:32,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:05:32,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:05:32,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:05:32,848 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:05:32,853 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-09-13 14:05:32,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:05:32 BoogieIcfgContainer [2021-09-13 14:05:32,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:05:32,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:05:32,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:05:32,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:05:32,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:05:32" (1/3) ... [2021-09-13 14:05:32,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e9874e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:05:32, skipping insertion in model container [2021-09-13 14:05:32,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:05:32" (2/3) ... [2021-09-13 14:05:32,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e9874e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:05:32, skipping insertion in model container [2021-09-13 14:05:32,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:05:32" (3/3) ... [2021-09-13 14:05:32,872 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_1-2.c [2021-09-13 14:05:32,875 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:05:32,880 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-09-13 14:05:32,938 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:05:32,943 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-09-13 14:05:32,943 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-09-13 14:05:32,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:05:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-09-13 14:05:32,956 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:05:32,957 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-09-13 14:05:32,957 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:05:32,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:05:32,961 INFO L82 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2021-09-13 14:05:32,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:05:32,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310832943] [2021-09-13 14:05:32,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:05:32,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:05:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:05:33,108 INFO L281 TraceCheckUtils]: 0: Hoare triple {13#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {13#true} is VALID [2021-09-13 14:05:33,109 INFO L281 TraceCheckUtils]: 1: Hoare triple {13#true} havoc main_#res;havoc main_~x~0;main_~x~0 := 0; {15#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:05:33,110 INFO L281 TraceCheckUtils]: 2: Hoare triple {15#(= ULTIMATE.start_main_~x~0 0)} assume !(main_~x~0 % 4294967296 < 268435455); {14#false} is VALID [2021-09-13 14:05:33,110 INFO L281 TraceCheckUtils]: 3: Hoare triple {14#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {14#false} is VALID [2021-09-13 14:05:33,110 INFO L281 TraceCheckUtils]: 4: Hoare triple {14#false} assume 0 == __VERIFIER_assert_~cond; {14#false} is VALID [2021-09-13 14:05:33,110 INFO L281 TraceCheckUtils]: 5: Hoare triple {14#false} assume !false; {14#false} is VALID [2021-09-13 14:05:33,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:05:33,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:05:33,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310832943] [2021-09-13 14:05:33,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310832943] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:05:33,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:05:33,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-13 14:05:33,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396434027] [2021-09-13 14:05:33,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-09-13 14:05:33,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:05:33,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:05:33,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:05:33,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-13 14:05:33,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:05:33,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-13 14:05:33,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-13 14:05:33,143 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:05:33,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:05:33,213 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2021-09-13 14:05:33,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-13 14:05:33,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-09-13 14:05:33,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:05:33,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:05:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2021-09-13 14:05:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:05:33,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2021-09-13 14:05:33,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2021-09-13 14:05:33,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:05:33,262 INFO L225 Difference]: With dead ends: 18 [2021-09-13 14:05:33,264 INFO L226 Difference]: Without dead ends: 8 [2021-09-13 14:05:33,267 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.25ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-13 14:05:33,272 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.45ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.34ms IncrementalHoareTripleChecker+Time [2021-09-13 14:05:33,273 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 19 Unknown, 0 Unchecked, 0.45ms Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 23.34ms Time] [2021-09-13 14:05:33,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-09-13 14:05:33,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-09-13 14:05:33,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:05:33,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:05:33,323 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:05:33,323 INFO L87 Difference]: Start difference. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:05:33,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:05:33,324 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2021-09-13 14:05:33,324 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-09-13 14:05:33,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:05:33,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:05:33,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states. [2021-09-13 14:05:33,325 INFO L87 Difference]: Start difference. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states. [2021-09-13 14:05:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:05:33,326 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2021-09-13 14:05:33,326 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-09-13 14:05:33,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:05:33,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:05:33,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:05:33,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:05:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:05:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-09-13 14:05:33,329 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2021-09-13 14:05:33,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:05:33,329 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-09-13 14:05:33,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:05:33,329 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-09-13 14:05:33,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-09-13 14:05:33,330 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:05:33,330 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:05:33,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 14:05:33,330 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:05:33,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:05:33,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2021-09-13 14:05:33,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:05:33,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321781018] [2021-09-13 14:05:33,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:05:33,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:05:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:05:33,442 INFO L281 TraceCheckUtils]: 0: Hoare triple {66#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {66#true} is VALID [2021-09-13 14:05:33,442 INFO L281 TraceCheckUtils]: 1: Hoare triple {66#true} havoc main_#res;havoc main_~x~0;main_~x~0 := 0; {68#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:05:33,443 INFO L281 TraceCheckUtils]: 2: Hoare triple {68#(= ULTIMATE.start_main_~x~0 0)} assume !!(main_~x~0 % 4294967296 < 268435455);main_~x~0 := 2 + main_~x~0; {69#(and (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:05:33,443 INFO L281 TraceCheckUtils]: 3: Hoare triple {69#(and (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)) (<= ULTIMATE.start_main_~x~0 2))} assume !(main_~x~0 % 4294967296 < 268435455); {67#false} is VALID [2021-09-13 14:05:33,443 INFO L281 TraceCheckUtils]: 4: Hoare triple {67#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {67#false} is VALID [2021-09-13 14:05:33,444 INFO L281 TraceCheckUtils]: 5: Hoare triple {67#false} assume 0 == __VERIFIER_assert_~cond; {67#false} is VALID [2021-09-13 14:05:33,444 INFO L281 TraceCheckUtils]: 6: Hoare triple {67#false} assume !false; {67#false} is VALID [2021-09-13 14:05:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:05:33,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:05:33,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321781018] [2021-09-13 14:05:33,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321781018] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:05:33,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605429731] [2021-09-13 14:05:33,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:05:33,450 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:05:33,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:05:33,452 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:05:33,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-09-13 14:05:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:05:33,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:05:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:05:33,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:05:33,723 INFO L281 TraceCheckUtils]: 0: Hoare triple {66#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {66#true} is VALID [2021-09-13 14:05:33,724 INFO L281 TraceCheckUtils]: 1: Hoare triple {66#true} havoc main_#res;havoc main_~x~0;main_~x~0 := 0; {68#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:05:33,724 INFO L281 TraceCheckUtils]: 2: Hoare triple {68#(= ULTIMATE.start_main_~x~0 0)} assume !!(main_~x~0 % 4294967296 < 268435455);main_~x~0 := 2 + main_~x~0; {79#(= ULTIMATE.start_main_~x~0 2)} is VALID [2021-09-13 14:05:33,725 INFO L281 TraceCheckUtils]: 3: Hoare triple {79#(= ULTIMATE.start_main_~x~0 2)} assume !(main_~x~0 % 4294967296 < 268435455); {79#(= ULTIMATE.start_main_~x~0 2)} is VALID [2021-09-13 14:05:33,729 INFO L281 TraceCheckUtils]: 4: Hoare triple {79#(= ULTIMATE.start_main_~x~0 2)} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {86#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:05:33,729 INFO L281 TraceCheckUtils]: 5: Hoare triple {86#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {67#false} is VALID [2021-09-13 14:05:33,729 INFO L281 TraceCheckUtils]: 6: Hoare triple {67#false} assume !false; {67#false} is VALID [2021-09-13 14:05:33,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:05:33,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:05:33,874 INFO L281 TraceCheckUtils]: 6: Hoare triple {67#false} assume !false; {67#false} is VALID [2021-09-13 14:05:33,875 INFO L281 TraceCheckUtils]: 5: Hoare triple {86#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {67#false} is VALID [2021-09-13 14:05:33,875 INFO L281 TraceCheckUtils]: 4: Hoare triple {99#(= (mod ULTIMATE.start_main_~x~0 2) 0)} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {86#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:05:33,876 INFO L281 TraceCheckUtils]: 3: Hoare triple {99#(= (mod ULTIMATE.start_main_~x~0 2) 0)} assume !(main_~x~0 % 4294967296 < 268435455); {99#(= (mod ULTIMATE.start_main_~x~0 2) 0)} is VALID [2021-09-13 14:05:33,877 INFO L281 TraceCheckUtils]: 2: Hoare triple {99#(= (mod ULTIMATE.start_main_~x~0 2) 0)} assume !!(main_~x~0 % 4294967296 < 268435455);main_~x~0 := 2 + main_~x~0; {99#(= (mod ULTIMATE.start_main_~x~0 2) 0)} is VALID [2021-09-13 14:05:33,877 INFO L281 TraceCheckUtils]: 1: Hoare triple {66#true} havoc main_#res;havoc main_~x~0;main_~x~0 := 0; {99#(= (mod ULTIMATE.start_main_~x~0 2) 0)} is VALID [2021-09-13 14:05:33,877 INFO L281 TraceCheckUtils]: 0: Hoare triple {66#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {66#true} is VALID [2021-09-13 14:05:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-09-13 14:05:33,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605429731] provided 1 perfect and 1 imperfect interpolant sequences [2021-09-13 14:05:33,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:05:33,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 7 [2021-09-13 14:05:33,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990290343] [2021-09-13 14:05:33,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-09-13 14:05:33,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:05:33,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:05:33,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:05:33,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:05:33,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:05:33,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:05:33,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:05:33,893 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:05:33,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:05:33,929 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2021-09-13 14:05:33,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:05:33,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-09-13 14:05:33,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:05:33,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:05:33,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2021-09-13 14:05:33,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:05:33,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2021-09-13 14:05:33,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 7 transitions. [2021-09-13 14:05:33,941 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:05:33,941 INFO L225 Difference]: With dead ends: 8 [2021-09-13 14:05:33,941 INFO L226 Difference]: Without dead ends: 0 [2021-09-13 14:05:33,941 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 52.66ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:05:33,943 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.11ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.90ms IncrementalHoareTripleChecker+Time [2021-09-13 14:05:33,944 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 10 Unknown, 0 Unchecked, 0.11ms Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 11.90ms Time] [2021-09-13 14:05:33,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-09-13 14:05:33,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-09-13 14:05:33,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:05:33,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:05:33,947 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:05:33,947 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:05:33,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:05:33,947 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:05:33,947 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:05:33,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:05:33,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:05:33,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2021-09-13 14:05:33,948 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2021-09-13 14:05:33,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:05:33,948 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:05:33,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:05:33,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:05:33,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:05:33,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:05:33,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:05:33,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:05:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-09-13 14:05:33,951 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2021-09-13 14:05:33,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:05:33,951 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-09-13 14:05:33,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:05:33,951 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:05:33,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:05:33,953 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-09-13 14:05:33,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-09-13 14:05:34,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:05:34,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-09-13 14:05:34,176 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:05:34,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:05:34,224 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-09-13 14:05:34,224 INFO L854 garLoopResultBuilder]: At program point L15-2(lines 15 17) the Hoare annotation is: (= (mod ULTIMATE.start_main_~x~0 2) 0) [2021-09-13 14:05:34,225 INFO L858 garLoopResultBuilder]: For program point L15-3(lines 15 17) no Hoare annotation was computed. [2021-09-13 14:05:34,225 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2021-09-13 14:05:34,225 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-09-13 14:05:34,225 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-09-13 14:05:34,225 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-09-13 14:05:34,225 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2021-09-13 14:05:34,225 INFO L858 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2021-09-13 14:05:34,226 INFO L861 garLoopResultBuilder]: At program point L6-2(lines 1 20) the Hoare annotation is: true [2021-09-13 14:05:34,228 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 14:05:34,231 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 14:05:34,238 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 14:05:34,238 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2021-09-13 14:05:34,238 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2021-09-13 14:05:34,239 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2021-09-13 14:05:34,239 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2021-09-13 14:05:34,239 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2021-09-13 14:05:34,240 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2021-09-13 14:05:34,240 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2021-09-13 14:05:34,240 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:05:34,240 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:05:34,240 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. [2021-09-13 14:05:34,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 02:05:34 BoogieIcfgContainer [2021-09-13 14:05:34,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 14:05:34,245 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 14:05:34,248 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 14:05:34,248 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 14:05:34,249 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:05:32" (3/4) ... [2021-09-13 14:05:34,251 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-09-13 14:05:34,256 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-09-13 14:05:34,257 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-09-13 14:05:34,257 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:05:34,257 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:05:34,288 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-13 14:05:34,297 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 14:05:34,298 INFO L158 Benchmark]: Toolchain (without parser) took 1985.43ms. Allocated memory was 60.8MB in the beginning and 83.9MB in the end (delta: 23.1MB). Free memory was 43.3MB in the beginning and 66.1MB in the end (delta: -22.8MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2021-09-13 14:05:34,300 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 44.0MB. Free memory was 26.0MB in the beginning and 26.0MB in the end (delta: 61.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:05:34,301 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.82ms. Allocated memory is still 60.8MB. Free memory was 43.2MB in the beginning and 44.6MB in the end (delta: -1.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 14:05:34,301 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.42ms. Allocated memory is still 60.8MB. Free memory was 44.4MB in the beginning and 43.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:05:34,302 INFO L158 Benchmark]: Boogie Preprocessor took 22.01ms. Allocated memory is still 60.8MB. Free memory was 43.1MB in the beginning and 42.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:05:34,303 INFO L158 Benchmark]: RCFGBuilder took 299.06ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 33.0MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 14:05:34,303 INFO L158 Benchmark]: TraceAbstraction took 1378.64ms. Allocated memory was 60.8MB in the beginning and 83.9MB in the end (delta: 23.1MB). Free memory was 32.5MB in the beginning and 41.7MB in the end (delta: -9.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-09-13 14:05:34,304 INFO L158 Benchmark]: Witness Printer took 51.42ms. Allocated memory is still 83.9MB. Free memory was 41.7MB in the beginning and 66.1MB in the end (delta: -24.4MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2021-09-13 14:05:34,321 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 44.0MB. Free memory was 26.0MB in the beginning and 26.0MB in the end (delta: 61.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.82ms. Allocated memory is still 60.8MB. Free memory was 43.2MB in the beginning and 44.6MB in the end (delta: -1.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.42ms. Allocated memory is still 60.8MB. Free memory was 44.4MB in the beginning and 43.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.01ms. Allocated memory is still 60.8MB. Free memory was 43.1MB in the beginning and 42.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 299.06ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 33.0MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1378.64ms. Allocated memory was 60.8MB in the beginning and 83.9MB in the end (delta: 23.1MB). Free memory was 32.5MB in the beginning and 41.7MB in the end (delta: -9.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 51.42ms. Allocated memory is still 83.9MB. Free memory was 41.7MB in the beginning and 66.1MB in the end (delta: -24.4MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1291.64ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 7.17ms, AutomataDifference: 200.33ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 51.73ms, InitialAbstractionConstructionTime: 6.04ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 35.24ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 33.84ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 29 mSolverCounterSat, 0.56ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 57.91ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 49.88ms AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 6 HoareAnnotationTreeSize, 2 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 36.01ms HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 10.25ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 8.61ms SsaConstructionTime, 53.34ms SatisfiabilityAnalysisTime, 534.79ms InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 59 SizeOfPredicates, 2 NumberOfNonLiveVariables, 44 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 1/3 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: x % 2 == 0 RESULT: Ultimate proved your program to be correct! [2021-09-13 14:05:34,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...