./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/psyco/psyco_io_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/psyco/psyco_io_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 69c831b1eda23dac6e2f4454b4feebfba511ade3 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:30:08,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:30:08,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:30:08,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:30:08,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:30:08,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:30:08,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:30:08,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:30:08,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:30:08,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:30:08,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:30:08,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:30:08,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:30:08,079 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:30:08,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:30:08,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:30:08,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:30:08,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:30:08,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:30:08,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:30:08,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:30:08,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:30:08,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:30:08,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:30:08,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:30:08,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:30:08,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:30:08,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:30:08,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:30:08,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:30:08,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:30:08,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:30:08,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:30:08,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:30:08,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:30:08,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:30:08,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:30:08,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:30:08,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:30:08,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:30:08,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:30:08,106 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:30:08,122 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:30:08,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:30:08,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:30:08,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:30:08,125 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:30:08,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:30:08,125 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:30:08,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 16:30:08,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:30:08,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:30:08,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:30:08,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:30:08,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:30:08,127 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:30:08,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:30:08,128 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:30:08,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:30:08,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:30:08,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:30:08,129 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:30:08,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:30:08,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:30:08,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:30:08,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:30:08,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:30:08,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 16:30:08,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 16:30:08,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:30:08,131 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:30:08,132 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 -> 69c831b1eda23dac6e2f4454b4feebfba511ade3 [2019-11-28 16:30:08,418 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:30:08,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:30:08,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:30:08,436 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:30:08,436 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:30:08,437 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_io_1.c [2019-11-28 16:30:08,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/955161031/c98b786cf76443a39a95deac61bd0feb/FLAGe6c86c991 [2019-11-28 16:30:08,923 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:30:08,923 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_io_1.c [2019-11-28 16:30:08,937 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/955161031/c98b786cf76443a39a95deac61bd0feb/FLAGe6c86c991 [2019-11-28 16:30:09,347 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/955161031/c98b786cf76443a39a95deac61bd0feb [2019-11-28 16:30:09,352 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:30:09,354 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:30:09,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:30:09,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:30:09,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:30:09,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:30:09" (1/1) ... [2019-11-28 16:30:09,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dfc87d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:09, skipping insertion in model container [2019-11-28 16:30:09,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:30:09" (1/1) ... [2019-11-28 16:30:09,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:30:09,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:30:09,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:30:09,651 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:30:09,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:30:09,764 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:30:09,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:09 WrapperNode [2019-11-28 16:30:09,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:30:09,772 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:30:09,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:30:09,772 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:30:09,782 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:30:09" (1/1) ... [2019-11-28 16:30:09,788 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:30:09" (1/1) ... [2019-11-28 16:30:09,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:30:09,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:30:09,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:30:09,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:30:09,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:09" (1/1) ... [2019-11-28 16:30:09,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:09" (1/1) ... [2019-11-28 16:30:09,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:09" (1/1) ... [2019-11-28 16:30:09,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:09" (1/1) ... [2019-11-28 16:30:09,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:09" (1/1) ... [2019-11-28 16:30:09,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:09" (1/1) ... [2019-11-28 16:30:09,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:09" (1/1) ... [2019-11-28 16:30:09,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:30:09,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:30:09,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:30:09,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:30:09,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:09" (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:30:09,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:30:09,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:30:10,406 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:30:10,407 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-28 16:30:10,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:30:10 BoogieIcfgContainer [2019-11-28 16:30:10,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:30:10,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:30:10,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:30:10,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:30:10,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:30:09" (1/3) ... [2019-11-28 16:30:10,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f207c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:30:10, skipping insertion in model container [2019-11-28 16:30:10,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:09" (2/3) ... [2019-11-28 16:30:10,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f207c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:30:10, skipping insertion in model container [2019-11-28 16:30:10,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:30:10" (3/3) ... [2019-11-28 16:30:10,417 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_io_1.c [2019-11-28 16:30:10,428 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:30:10,436 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 16:30:10,449 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 16:30:10,475 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:30:10,476 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:30:10,476 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:30:10,476 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:30:10,477 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:30:10,477 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:30:10,477 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:30:10,477 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:30:10,491 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2019-11-28 16:30:10,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 16:30:10,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:10,498 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:10,498 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:10,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:10,503 INFO L82 PathProgramCache]: Analyzing trace with hash 352571312, now seen corresponding path program 1 times [2019-11-28 16:30:10,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:10,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235235459] [2019-11-28 16:30:10,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:10,629 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:30:10,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235235459] [2019-11-28 16:30:10,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:10,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 16:30:10,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355763832] [2019-11-28 16:30:10,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:30:10,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:10,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:30:10,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:30:10,650 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2019-11-28 16:30:10,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:10,675 INFO L93 Difference]: Finished difference Result 130 states and 244 transitions. [2019-11-28 16:30:10,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:30:10,677 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-28 16:30:10,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:10,689 INFO L225 Difference]: With dead ends: 130 [2019-11-28 16:30:10,689 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 16:30:10,693 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:30:10,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 16:30:10,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-28 16:30:10,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 16:30:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 87 transitions. [2019-11-28 16:30:10,731 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 87 transitions. Word has length 9 [2019-11-28 16:30:10,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:10,732 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 87 transitions. [2019-11-28 16:30:10,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:30:10,734 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 87 transitions. [2019-11-28 16:30:10,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 16:30:10,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:10,735 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:10,735 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:10,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:10,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1422697760, now seen corresponding path program 1 times [2019-11-28 16:30:10,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:10,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251571960] [2019-11-28 16:30:10,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:10,791 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:30:10,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251571960] [2019-11-28 16:30:10,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:10,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:30:10,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115410497] [2019-11-28 16:30:10,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:30:10,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:10,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:30:10,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:10,796 INFO L87 Difference]: Start difference. First operand 57 states and 87 transitions. Second operand 3 states. [2019-11-28 16:30:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:10,870 INFO L93 Difference]: Finished difference Result 115 states and 176 transitions. [2019-11-28 16:30:10,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:30:10,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 16:30:10,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:10,872 INFO L225 Difference]: With dead ends: 115 [2019-11-28 16:30:10,872 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 16:30:10,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:10,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 16:30:10,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-11-28 16:30:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 16:30:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2019-11-28 16:30:10,883 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 10 [2019-11-28 16:30:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:10,884 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2019-11-28 16:30:10,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:30:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2019-11-28 16:30:10,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 16:30:10,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:10,887 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:10,887 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:10,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:10,888 INFO L82 PathProgramCache]: Analyzing trace with hash 658032531, now seen corresponding path program 1 times [2019-11-28 16:30:10,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:10,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257154320] [2019-11-28 16:30:10,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:30:10,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257154320] [2019-11-28 16:30:10,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:10,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:30:10,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085117000] [2019-11-28 16:30:10,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:30:10,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:10,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:30:10,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:10,959 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. Second operand 3 states. [2019-11-28 16:30:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:11,010 INFO L93 Difference]: Finished difference Result 109 states and 165 transitions. [2019-11-28 16:30:11,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:30:11,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 16:30:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:11,012 INFO L225 Difference]: With dead ends: 109 [2019-11-28 16:30:11,012 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 16:30:11,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:11,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 16:30:11,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-28 16:30:11,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 16:30:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-11-28 16:30:11,021 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 15 [2019-11-28 16:30:11,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:11,021 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-11-28 16:30:11,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:30:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-11-28 16:30:11,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 16:30:11,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:11,023 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:11,023 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:11,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:11,024 INFO L82 PathProgramCache]: Analyzing trace with hash 2017993163, now seen corresponding path program 1 times [2019-11-28 16:30:11,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:11,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067365886] [2019-11-28 16:30:11,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:30:11,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067365886] [2019-11-28 16:30:11,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:11,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:30:11,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062510696] [2019-11-28 16:30:11,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:30:11,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:11,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:30:11,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:11,085 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 3 states. [2019-11-28 16:30:11,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:11,154 INFO L93 Difference]: Finished difference Result 136 states and 206 transitions. [2019-11-28 16:30:11,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:30:11,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 16:30:11,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:11,156 INFO L225 Difference]: With dead ends: 136 [2019-11-28 16:30:11,156 INFO L226 Difference]: Without dead ends: 90 [2019-11-28 16:30:11,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:11,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-28 16:30:11,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2019-11-28 16:30:11,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-28 16:30:11,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 128 transitions. [2019-11-28 16:30:11,167 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 128 transitions. Word has length 20 [2019-11-28 16:30:11,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:11,168 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 128 transitions. [2019-11-28 16:30:11,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:30:11,168 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 128 transitions. [2019-11-28 16:30:11,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 16:30:11,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:11,169 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:11,170 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:11,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:11,170 INFO L82 PathProgramCache]: Analyzing trace with hash 398483104, now seen corresponding path program 1 times [2019-11-28 16:30:11,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:11,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450406298] [2019-11-28 16:30:11,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:11,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:30:11,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450406298] [2019-11-28 16:30:11,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:11,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:30:11,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022157846] [2019-11-28 16:30:11,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:30:11,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:11,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:30:11,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:11,213 INFO L87 Difference]: Start difference. First operand 87 states and 128 transitions. Second operand 3 states. [2019-11-28 16:30:11,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:11,259 INFO L93 Difference]: Finished difference Result 176 states and 258 transitions. [2019-11-28 16:30:11,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:30:11,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 16:30:11,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:11,262 INFO L225 Difference]: With dead ends: 176 [2019-11-28 16:30:11,262 INFO L226 Difference]: Without dead ends: 97 [2019-11-28 16:30:11,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:11,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-28 16:30:11,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2019-11-28 16:30:11,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-28 16:30:11,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 136 transitions. [2019-11-28 16:30:11,273 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 136 transitions. Word has length 21 [2019-11-28 16:30:11,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:11,273 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 136 transitions. [2019-11-28 16:30:11,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:30:11,274 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 136 transitions. [2019-11-28 16:30:11,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 16:30:11,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:11,275 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:11,276 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:11,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:11,276 INFO L82 PathProgramCache]: Analyzing trace with hash -162530645, now seen corresponding path program 1 times [2019-11-28 16:30:11,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:11,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998755713] [2019-11-28 16:30:11,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:11,359 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 16:30:11,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998755713] [2019-11-28 16:30:11,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:11,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:30:11,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918989030] [2019-11-28 16:30:11,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:30:11,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:11,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:30:11,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:11,363 INFO L87 Difference]: Start difference. First operand 95 states and 136 transitions. Second operand 3 states. [2019-11-28 16:30:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:11,388 INFO L93 Difference]: Finished difference Result 160 states and 230 transitions. [2019-11-28 16:30:11,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:30:11,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-28 16:30:11,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:11,390 INFO L225 Difference]: With dead ends: 160 [2019-11-28 16:30:11,390 INFO L226 Difference]: Without dead ends: 73 [2019-11-28 16:30:11,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:11,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-28 16:30:11,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-28 16:30:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 16:30:11,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2019-11-28 16:30:11,398 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 32 [2019-11-28 16:30:11,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:11,399 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2019-11-28 16:30:11,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:30:11,399 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2019-11-28 16:30:11,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 16:30:11,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:11,401 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:11,401 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:11,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:11,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1521721792, now seen corresponding path program 1 times [2019-11-28 16:30:11,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:11,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468747650] [2019-11-28 16:30:11,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 16:30:11,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468747650] [2019-11-28 16:30:11,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:11,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:30:11,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338289699] [2019-11-28 16:30:11,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:30:11,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:11,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:30:11,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:30:11,521 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand 4 states. [2019-11-28 16:30:11,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:11,596 INFO L93 Difference]: Finished difference Result 76 states and 104 transitions. [2019-11-28 16:30:11,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 16:30:11,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-28 16:30:11,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:11,597 INFO L225 Difference]: With dead ends: 76 [2019-11-28 16:30:11,597 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 16:30:11,598 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:30:11,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 16:30:11,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 16:30:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 16:30:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 16:30:11,599 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-11-28 16:30:11,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:11,599 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 16:30:11,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:30:11,600 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 16:30:11,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 16:30:11,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 16:30:11,732 INFO L246 CegarLoopResult]: For program point L36(lines 36 47) no Hoare annotation was computed. [2019-11-28 16:30:11,732 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 16:30:11,732 INFO L246 CegarLoopResult]: For program point L86(lines 86 101) no Hoare annotation was computed. [2019-11-28 16:30:11,732 INFO L246 CegarLoopResult]: For program point L53(lines 53 104) no Hoare annotation was computed. [2019-11-28 16:30:11,732 INFO L246 CegarLoopResult]: For program point L202(lines 202 217) no Hoare annotation was computed. [2019-11-28 16:30:11,732 INFO L246 CegarLoopResult]: For program point L70(lines 70 85) no Hoare annotation was computed. [2019-11-28 16:30:11,733 INFO L246 CegarLoopResult]: For program point L318(lines 318 333) no Hoare annotation was computed. [2019-11-28 16:30:11,734 INFO L246 CegarLoopResult]: For program point L186(lines 186 201) no Hoare annotation was computed. [2019-11-28 16:30:11,734 INFO L246 CegarLoopResult]: For program point L54(lines 54 69) no Hoare annotation was computed. [2019-11-28 16:30:11,735 INFO L242 CegarLoopResult]: At program point L335(lines 23 339) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~this_sink~0 0))) (or (and .cse0 (= ULTIMATE.start_main_~q~0 2)) (and (or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0)) (<= 3 ULTIMATE.start_main_~q~0)) (and .cse0 (= ULTIMATE.start_main_~q~0 0)))) [2019-11-28 16:30:11,735 INFO L246 CegarLoopResult]: For program point L302(lines 302 317) no Hoare annotation was computed. [2019-11-28 16:30:11,735 INFO L246 CegarLoopResult]: For program point L170(lines 170 185) no Hoare annotation was computed. [2019-11-28 16:30:11,735 INFO L246 CegarLoopResult]: For program point L286(lines 286 301) no Hoare annotation was computed. [2019-11-28 16:30:11,736 INFO L246 CegarLoopResult]: For program point L154(lines 154 169) no Hoare annotation was computed. [2019-11-28 16:30:11,736 INFO L246 CegarLoopResult]: For program point L88(lines 88 99) no Hoare annotation was computed. [2019-11-28 16:30:11,736 INFO L246 CegarLoopResult]: For program point L270(lines 270 285) no Hoare annotation was computed. [2019-11-28 16:30:11,736 INFO L246 CegarLoopResult]: For program point L204(lines 204 215) no Hoare annotation was computed. [2019-11-28 16:30:11,736 INFO L246 CegarLoopResult]: For program point L138(lines 138 153) no Hoare annotation was computed. [2019-11-28 16:30:11,736 INFO L246 CegarLoopResult]: For program point L105(lines 105 220) no Hoare annotation was computed. [2019-11-28 16:30:11,736 INFO L246 CegarLoopResult]: For program point L72(lines 72 83) no Hoare annotation was computed. [2019-11-28 16:30:11,737 INFO L246 CegarLoopResult]: For program point L320(lines 320 331) no Hoare annotation was computed. [2019-11-28 16:30:11,737 INFO L246 CegarLoopResult]: For program point L254(lines 254 269) no Hoare annotation was computed. [2019-11-28 16:30:11,737 INFO L246 CegarLoopResult]: For program point L221(lines 221 336) no Hoare annotation was computed. [2019-11-28 16:30:11,737 INFO L246 CegarLoopResult]: For program point L188(lines 188 199) no Hoare annotation was computed. [2019-11-28 16:30:11,737 INFO L246 CegarLoopResult]: For program point L122(lines 122 137) no Hoare annotation was computed. [2019-11-28 16:30:11,737 INFO L246 CegarLoopResult]: For program point L56(lines 56 67) no Hoare annotation was computed. [2019-11-28 16:30:11,738 INFO L242 CegarLoopResult]: At program point L23-2(lines 23 339) the Hoare annotation is: (or (and (or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0)) (<= 3 ULTIMATE.start_main_~q~0)) (and (= ULTIMATE.start_main_~this_sink~0 0) (= ULTIMATE.start_main_~q~0 0))) [2019-11-28 16:30:11,738 INFO L246 CegarLoopResult]: For program point L23-3(lines 23 339) no Hoare annotation was computed. [2019-11-28 16:30:11,738 INFO L246 CegarLoopResult]: For program point L304(lines 304 315) no Hoare annotation was computed. [2019-11-28 16:30:11,738 INFO L246 CegarLoopResult]: For program point L238(lines 238 253) no Hoare annotation was computed. [2019-11-28 16:30:11,738 INFO L246 CegarLoopResult]: For program point L172(lines 172 183) no Hoare annotation was computed. [2019-11-28 16:30:11,738 INFO L246 CegarLoopResult]: For program point L106(lines 106 121) no Hoare annotation was computed. [2019-11-28 16:30:11,739 INFO L246 CegarLoopResult]: For program point L40(lines 40 42) no Hoare annotation was computed. [2019-11-28 16:30:11,739 INFO L246 CegarLoopResult]: For program point L288(lines 288 299) no Hoare annotation was computed. [2019-11-28 16:30:11,739 INFO L246 CegarLoopResult]: For program point L222(lines 222 237) no Hoare annotation was computed. [2019-11-28 16:30:11,739 INFO L246 CegarLoopResult]: For program point L156(lines 156 167) no Hoare annotation was computed. [2019-11-28 16:30:11,739 INFO L246 CegarLoopResult]: For program point L272(lines 272 283) no Hoare annotation was computed. [2019-11-28 16:30:11,739 INFO L246 CegarLoopResult]: For program point L140(lines 140 151) no Hoare annotation was computed. [2019-11-28 16:30:11,739 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 16:30:11,740 INFO L246 CegarLoopResult]: For program point L256(lines 256 267) no Hoare annotation was computed. [2019-11-28 16:30:11,740 INFO L246 CegarLoopResult]: For program point L124(lines 124 135) no Hoare annotation was computed. [2019-11-28 16:30:11,742 INFO L246 CegarLoopResult]: For program point L240(lines 240 251) no Hoare annotation was computed. [2019-11-28 16:30:11,742 INFO L246 CegarLoopResult]: For program point L108(lines 108 119) no Hoare annotation was computed. [2019-11-28 16:30:11,742 INFO L246 CegarLoopResult]: For program point L224(lines 224 235) no Hoare annotation was computed. [2019-11-28 16:30:11,742 INFO L246 CegarLoopResult]: For program point L92(lines 92 94) no Hoare annotation was computed. [2019-11-28 16:30:11,742 INFO L246 CegarLoopResult]: For program point L208(lines 208 210) no Hoare annotation was computed. [2019-11-28 16:30:11,742 INFO L246 CegarLoopResult]: For program point L76(lines 76 78) no Hoare annotation was computed. [2019-11-28 16:30:11,743 INFO L246 CegarLoopResult]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-11-28 16:30:11,743 INFO L246 CegarLoopResult]: For program point L192(lines 192 194) no Hoare annotation was computed. [2019-11-28 16:30:11,743 INFO L246 CegarLoopResult]: For program point L60(lines 60 62) no Hoare annotation was computed. [2019-11-28 16:30:11,743 INFO L246 CegarLoopResult]: For program point L308(lines 308 310) no Hoare annotation was computed. [2019-11-28 16:30:11,743 INFO L246 CegarLoopResult]: For program point L176(lines 176 178) no Hoare annotation was computed. [2019-11-28 16:30:11,743 INFO L242 CegarLoopResult]: At program point L325(lines 13 344) the Hoare annotation is: false [2019-11-28 16:30:11,744 INFO L246 CegarLoopResult]: For program point L292(lines 292 294) no Hoare annotation was computed. [2019-11-28 16:30:11,744 INFO L246 CegarLoopResult]: For program point L160(lines 160 162) no Hoare annotation was computed. [2019-11-28 16:30:11,744 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 16:30:11,744 INFO L246 CegarLoopResult]: For program point L276(lines 276 278) no Hoare annotation was computed. [2019-11-28 16:30:11,745 INFO L246 CegarLoopResult]: For program point L144(lines 144 146) no Hoare annotation was computed. [2019-11-28 16:30:11,745 INFO L246 CegarLoopResult]: For program point L260(lines 260 262) no Hoare annotation was computed. [2019-11-28 16:30:11,745 INFO L246 CegarLoopResult]: For program point L128(lines 128 130) no Hoare annotation was computed. [2019-11-28 16:30:11,745 INFO L246 CegarLoopResult]: For program point L244(lines 244 246) no Hoare annotation was computed. [2019-11-28 16:30:11,746 INFO L246 CegarLoopResult]: For program point L112(lines 112 114) no Hoare annotation was computed. [2019-11-28 16:30:11,746 INFO L249 CegarLoopResult]: At program point L13(lines 13 344) the Hoare annotation is: true [2019-11-28 16:30:11,746 INFO L246 CegarLoopResult]: For program point L228(lines 228 230) no Hoare annotation was computed. [2019-11-28 16:30:11,746 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 16:30:11,747 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 343) no Hoare annotation was computed. [2019-11-28 16:30:11,747 INFO L246 CegarLoopResult]: For program point L33(lines 33 52) no Hoare annotation was computed. [2019-11-28 16:30:11,747 INFO L246 CegarLoopResult]: For program point L34(lines 34 49) no Hoare annotation was computed. [2019-11-28 16:30:11,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:30:11 BoogieIcfgContainer [2019-11-28 16:30:11,775 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:30:11,775 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:30:11,775 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:30:11,776 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:30:11,776 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:30:10" (3/4) ... [2019-11-28 16:30:11,780 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 16:30:11,811 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 16:30:11,811 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 16:30:11,882 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 16:30:11,883 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:30:11,886 INFO L168 Benchmark]: Toolchain (without parser) took 2530.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 961.7 MB in the beginning and 1.0 GB in the end (delta: -41.8 MB). Peak memory consumption was 105.0 MB. Max. memory is 11.5 GB. [2019-11-28 16:30:11,886 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:30:11,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-28 16:30:11,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.41 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:30:11,889 INFO L168 Benchmark]: Boogie Preprocessor took 29.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:30:11,890 INFO L168 Benchmark]: RCFGBuilder took 559.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:30:11,890 INFO L168 Benchmark]: TraceAbstraction took 1365.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.4 MB). Peak memory consumption was 99.4 MB. Max. memory is 11.5 GB. [2019-11-28 16:30:11,891 INFO L168 Benchmark]: Witness Printer took 107.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:30:11,896 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 413.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.41 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. * Boogie Preprocessor took 29.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 559.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1365.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.4 MB). Peak memory consumption was 99.4 MB. Max. memory is 11.5 GB. * Witness Printer took 107.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 343]: 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: 23]: Loop Invariant Derived loop invariant: ((this_sink + 1 <= 0 || 1 <= this_sink) && 3 <= q) || (this_sink == 0 && q == 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((this_sink == 0 && q == 2) || ((this_sink + 1 <= 0 || 1 <= this_sink) && 3 <= q)) || (this_sink == 0 && q == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 68 locations, 1 error locations. Result: SAFE, OverallTime: 1.1s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 520 SDtfs, 190 SDslu, 262 SDs, 0 SdLazy, 88 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=5, 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, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 12 NumberOfFragments, 51 HoareAnnotationTreeSize, 4 FomulaSimplifications, 34 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 7219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 27/27 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...