./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.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 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 15:00:07,303 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:00:07,305 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:00:07,317 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:00:07,317 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:00:07,318 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:00:07,319 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:00:07,321 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:00:07,323 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:00:07,324 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:00:07,325 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:00:07,325 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:00:07,326 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:00:07,327 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:00:07,328 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:00:07,329 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:00:07,330 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:00:07,332 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:00:07,339 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:00:07,340 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:00:07,346 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:00:07,347 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:00:07,350 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:00:07,350 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:00:07,350 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:00:07,351 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:00:07,352 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:00:07,353 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:00:07,354 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:00:07,355 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:00:07,355 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:00:07,356 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:00:07,356 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:00:07,356 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:00:07,357 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:00:07,358 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:00:07,358 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 15:00:07,372 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:00:07,373 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:00:07,374 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:00:07,374 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:00:07,374 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:00:07,375 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:00:07,375 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:00:07,375 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 15:00:07,375 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:00:07,375 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:00:07,375 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:00:07,376 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:00:07,376 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:00:07,376 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:00:07,376 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:00:07,376 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:00:07,377 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:00:07,377 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:00:07,377 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:00:07,377 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:00:07,377 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:00:07,378 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:00:07,378 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:00:07,378 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:00:07,378 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 15:00:07,378 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:00:07,378 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 15:00:07,379 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb [2019-01-14 15:00:07,429 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:00:07,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:00:07,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:00:07,456 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:00:07,456 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:00:07,457 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 15:00:07,520 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a51958d28/ed5237937a224d849d32b2a52d22f906/FLAGab897c958 [2019-01-14 15:00:07,914 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:00:07,915 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 15:00:07,923 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a51958d28/ed5237937a224d849d32b2a52d22f906/FLAGab897c958 [2019-01-14 15:00:08,285 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a51958d28/ed5237937a224d849d32b2a52d22f906 [2019-01-14 15:00:08,289 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:00:08,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:00:08,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:00:08,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:00:08,296 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:00:08,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:00:08" (1/1) ... [2019-01-14 15:00:08,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1098246e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:08, skipping insertion in model container [2019-01-14 15:00:08,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:00:08" (1/1) ... [2019-01-14 15:00:08,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:00:08,326 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:00:08,535 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:00:08,539 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:00:08,566 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:00:08,580 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:00:08,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:08 WrapperNode [2019-01-14 15:00:08,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:00:08,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:00:08,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:00:08,581 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:00:08,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:08" (1/1) ... [2019-01-14 15:00:08,594 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:08" (1/1) ... [2019-01-14 15:00:08,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:00:08,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:00:08,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:00:08,616 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:00:08,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:08" (1/1) ... [2019-01-14 15:00:08,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:08" (1/1) ... [2019-01-14 15:00:08,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:08" (1/1) ... [2019-01-14 15:00:08,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:08" (1/1) ... [2019-01-14 15:00:08,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:08" (1/1) ... [2019-01-14 15:00:08,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:08" (1/1) ... [2019-01-14 15:00:08,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:08" (1/1) ... [2019-01-14 15:00:08,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:00:08,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:00:08,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:00:08,643 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:00:08,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:08" (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-01-14 15:00:08,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:00:08,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:00:09,143 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:00:09,143 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 15:00:09,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:00:09 BoogieIcfgContainer [2019-01-14 15:00:09,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:00:09,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:00:09,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:00:09,148 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:00:09,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:00:08" (1/3) ... [2019-01-14 15:00:09,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700dd58b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:00:09, skipping insertion in model container [2019-01-14 15:00:09,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:08" (2/3) ... [2019-01-14 15:00:09,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700dd58b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:00:09, skipping insertion in model container [2019-01-14 15:00:09,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:00:09" (3/3) ... [2019-01-14 15:00:09,152 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 15:00:09,160 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:00:09,167 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 15:00:09,180 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 15:00:09,210 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:00:09,211 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:00:09,211 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:00:09,211 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:00:09,211 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:00:09,212 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:00:09,212 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:00:09,212 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:00:09,212 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:00:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-01-14 15:00:09,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 15:00:09,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:09,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:09,237 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:09,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:09,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1401695884, now seen corresponding path program 1 times [2019-01-14 15:00:09,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:09,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:09,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:09,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:09,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:09,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:09,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:09,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:09,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:09,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:09,415 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-01-14 15:00:09,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:09,467 INFO L93 Difference]: Finished difference Result 52 states and 84 transitions. [2019-01-14 15:00:09,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:09,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-14 15:00:09,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:09,478 INFO L225 Difference]: With dead ends: 52 [2019-01-14 15:00:09,478 INFO L226 Difference]: Without dead ends: 38 [2019-01-14 15:00:09,482 INFO L631 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-01-14 15:00:09,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-14 15:00:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2019-01-14 15:00:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 15:00:09,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2019-01-14 15:00:09,514 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 11 [2019-01-14 15:00:09,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:09,515 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 45 transitions. [2019-01-14 15:00:09,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:09,515 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2019-01-14 15:00:09,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 15:00:09,516 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:09,516 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:09,517 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:09,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:09,517 INFO L82 PathProgramCache]: Analyzing trace with hash 592349258, now seen corresponding path program 1 times [2019-01-14 15:00:09,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:09,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:09,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:09,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:09,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:09,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:09,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:09,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:09,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:09,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:09,583 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand 3 states. [2019-01-14 15:00:09,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:09,644 INFO L93 Difference]: Finished difference Result 63 states and 108 transitions. [2019-01-14 15:00:09,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:09,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-14 15:00:09,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:09,646 INFO L225 Difference]: With dead ends: 63 [2019-01-14 15:00:09,646 INFO L226 Difference]: Without dead ends: 38 [2019-01-14 15:00:09,648 INFO L631 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-01-14 15:00:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-14 15:00:09,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-01-14 15:00:09,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 15:00:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 61 transitions. [2019-01-14 15:00:09,654 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 61 transitions. Word has length 11 [2019-01-14 15:00:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:09,654 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 61 transitions. [2019-01-14 15:00:09,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 61 transitions. [2019-01-14 15:00:09,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 15:00:09,656 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:09,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:09,656 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:09,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:09,656 INFO L82 PathProgramCache]: Analyzing trace with hash 503114411, now seen corresponding path program 1 times [2019-01-14 15:00:09,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:09,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:09,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:09,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:09,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:09,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:09,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:09,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:09,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:09,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:09,732 INFO L87 Difference]: Start difference. First operand 36 states and 61 transitions. Second operand 3 states. [2019-01-14 15:00:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:09,786 INFO L93 Difference]: Finished difference Result 59 states and 95 transitions. [2019-01-14 15:00:09,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:09,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-14 15:00:09,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:09,789 INFO L225 Difference]: With dead ends: 59 [2019-01-14 15:00:09,789 INFO L226 Difference]: Without dead ends: 41 [2019-01-14 15:00:09,790 INFO L631 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-01-14 15:00:09,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-14 15:00:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-01-14 15:00:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 15:00:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 63 transitions. [2019-01-14 15:00:09,796 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 63 transitions. Word has length 12 [2019-01-14 15:00:09,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:09,796 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 63 transitions. [2019-01-14 15:00:09,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:09,796 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 63 transitions. [2019-01-14 15:00:09,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 15:00:09,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:09,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:09,798 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:09,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:09,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1183172781, now seen corresponding path program 1 times [2019-01-14 15:00:09,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:09,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:09,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:09,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:09,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:09,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:09,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:09,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:09,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:09,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:09,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:09,844 INFO L87 Difference]: Start difference. First operand 39 states and 63 transitions. Second operand 3 states. [2019-01-14 15:00:09,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:09,890 INFO L93 Difference]: Finished difference Result 72 states and 116 transitions. [2019-01-14 15:00:09,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:09,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-14 15:00:09,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:09,892 INFO L225 Difference]: With dead ends: 72 [2019-01-14 15:00:09,892 INFO L226 Difference]: Without dead ends: 70 [2019-01-14 15:00:09,893 INFO L631 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-01-14 15:00:09,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-14 15:00:09,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-01-14 15:00:09,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 15:00:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 84 transitions. [2019-01-14 15:00:09,901 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 84 transitions. Word has length 12 [2019-01-14 15:00:09,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:09,901 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 84 transitions. [2019-01-14 15:00:09,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:09,901 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 84 transitions. [2019-01-14 15:00:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 15:00:09,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:09,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:09,902 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:09,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:09,903 INFO L82 PathProgramCache]: Analyzing trace with hash 373826155, now seen corresponding path program 1 times [2019-01-14 15:00:09,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:09,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:09,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:09,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:09,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:09,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:09,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:09,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:09,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:09,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:09,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:09,944 INFO L87 Difference]: Start difference. First operand 52 states and 84 transitions. Second operand 3 states. [2019-01-14 15:00:09,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:09,988 INFO L93 Difference]: Finished difference Result 120 states and 194 transitions. [2019-01-14 15:00:09,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:09,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-14 15:00:09,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:09,991 INFO L225 Difference]: With dead ends: 120 [2019-01-14 15:00:09,991 INFO L226 Difference]: Without dead ends: 72 [2019-01-14 15:00:09,992 INFO L631 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-01-14 15:00:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-14 15:00:09,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-01-14 15:00:09,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-14 15:00:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 110 transitions. [2019-01-14 15:00:10,001 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 110 transitions. Word has length 12 [2019-01-14 15:00:10,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:10,001 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 110 transitions. [2019-01-14 15:00:10,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:10,002 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 110 transitions. [2019-01-14 15:00:10,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 15:00:10,002 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:10,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:10,003 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:10,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:10,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1976134145, now seen corresponding path program 1 times [2019-01-14 15:00:10,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:10,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:10,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:10,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:10,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:10,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:10,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:10,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:10,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:10,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:10,039 INFO L87 Difference]: Start difference. First operand 70 states and 110 transitions. Second operand 3 states. [2019-01-14 15:00:10,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:10,121 INFO L93 Difference]: Finished difference Result 107 states and 165 transitions. [2019-01-14 15:00:10,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:10,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-14 15:00:10,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:10,124 INFO L225 Difference]: With dead ends: 107 [2019-01-14 15:00:10,124 INFO L226 Difference]: Without dead ends: 74 [2019-01-14 15:00:10,125 INFO L631 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-01-14 15:00:10,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-14 15:00:10,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-01-14 15:00:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-14 15:00:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2019-01-14 15:00:10,134 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 13 [2019-01-14 15:00:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:10,134 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2019-01-14 15:00:10,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2019-01-14 15:00:10,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 15:00:10,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:10,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:10,136 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:10,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:10,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1296075775, now seen corresponding path program 1 times [2019-01-14 15:00:10,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:10,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:10,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:10,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:10,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:10,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:10,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:10,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:10,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:10,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:10,203 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand 3 states. [2019-01-14 15:00:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:10,299 INFO L93 Difference]: Finished difference Result 200 states and 304 transitions. [2019-01-14 15:00:10,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:10,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-14 15:00:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:10,302 INFO L225 Difference]: With dead ends: 200 [2019-01-14 15:00:10,302 INFO L226 Difference]: Without dead ends: 134 [2019-01-14 15:00:10,303 INFO L631 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-01-14 15:00:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-14 15:00:10,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-01-14 15:00:10,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-14 15:00:10,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 194 transitions. [2019-01-14 15:00:10,318 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 194 transitions. Word has length 13 [2019-01-14 15:00:10,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:10,319 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 194 transitions. [2019-01-14 15:00:10,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 194 transitions. [2019-01-14 15:00:10,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 15:00:10,322 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:10,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:10,322 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:10,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:10,323 INFO L82 PathProgramCache]: Analyzing trace with hash -486729149, now seen corresponding path program 1 times [2019-01-14 15:00:10,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:10,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:10,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:10,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:10,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:10,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:10,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:10,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:10,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:10,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:10,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:10,363 INFO L87 Difference]: Start difference. First operand 132 states and 194 transitions. Second operand 3 states. [2019-01-14 15:00:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:10,390 INFO L93 Difference]: Finished difference Result 160 states and 236 transitions. [2019-01-14 15:00:10,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:10,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-14 15:00:10,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:10,396 INFO L225 Difference]: With dead ends: 160 [2019-01-14 15:00:10,396 INFO L226 Difference]: Without dead ends: 158 [2019-01-14 15:00:10,397 INFO L631 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-01-14 15:00:10,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-14 15:00:10,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 132. [2019-01-14 15:00:10,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-14 15:00:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 190 transitions. [2019-01-14 15:00:10,410 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 190 transitions. Word has length 13 [2019-01-14 15:00:10,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:10,411 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 190 transitions. [2019-01-14 15:00:10,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 190 transitions. [2019-01-14 15:00:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 15:00:10,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:10,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:10,414 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:10,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:10,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1523427712, now seen corresponding path program 1 times [2019-01-14 15:00:10,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:10,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:10,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:10,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:10,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:10,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:10,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:10,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:10,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:10,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:10,482 INFO L87 Difference]: Start difference. First operand 132 states and 190 transitions. Second operand 3 states. [2019-01-14 15:00:10,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:10,541 INFO L93 Difference]: Finished difference Result 228 states and 328 transitions. [2019-01-14 15:00:10,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:10,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-01-14 15:00:10,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:10,544 INFO L225 Difference]: With dead ends: 228 [2019-01-14 15:00:10,544 INFO L226 Difference]: Without dead ends: 226 [2019-01-14 15:00:10,545 INFO L631 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-01-14 15:00:10,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-01-14 15:00:10,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 192. [2019-01-14 15:00:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-14 15:00:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 270 transitions. [2019-01-14 15:00:10,570 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 270 transitions. Word has length 14 [2019-01-14 15:00:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:10,571 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 270 transitions. [2019-01-14 15:00:10,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 270 transitions. [2019-01-14 15:00:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 15:00:10,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:10,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:10,578 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:10,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:10,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1962192958, now seen corresponding path program 1 times [2019-01-14 15:00:10,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:10,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:10,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:10,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:10,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:10,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:10,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:10,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:10,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:10,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:10,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:10,638 INFO L87 Difference]: Start difference. First operand 192 states and 270 transitions. Second operand 3 states. [2019-01-14 15:00:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:10,692 INFO L93 Difference]: Finished difference Result 436 states and 608 transitions. [2019-01-14 15:00:10,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:10,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-01-14 15:00:10,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:10,696 INFO L225 Difference]: With dead ends: 436 [2019-01-14 15:00:10,697 INFO L226 Difference]: Without dead ends: 250 [2019-01-14 15:00:10,698 INFO L631 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-01-14 15:00:10,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-14 15:00:10,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-01-14 15:00:10,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-14 15:00:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 330 transitions. [2019-01-14 15:00:10,722 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 330 transitions. Word has length 14 [2019-01-14 15:00:10,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:10,722 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 330 transitions. [2019-01-14 15:00:10,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 330 transitions. [2019-01-14 15:00:10,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 15:00:10,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:10,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:10,727 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:10,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:10,728 INFO L82 PathProgramCache]: Analyzing trace with hash 18597174, now seen corresponding path program 1 times [2019-01-14 15:00:10,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:10,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:10,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:10,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:10,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:10,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:10,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:10,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:10,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:10,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:10,803 INFO L87 Difference]: Start difference. First operand 248 states and 330 transitions. Second operand 3 states. [2019-01-14 15:00:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:10,891 INFO L93 Difference]: Finished difference Result 380 states and 504 transitions. [2019-01-14 15:00:10,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:10,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-14 15:00:10,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:10,894 INFO L225 Difference]: With dead ends: 380 [2019-01-14 15:00:10,894 INFO L226 Difference]: Without dead ends: 262 [2019-01-14 15:00:10,895 INFO L631 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-01-14 15:00:10,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-01-14 15:00:10,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-01-14 15:00:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-01-14 15:00:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 338 transitions. [2019-01-14 15:00:10,907 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 338 transitions. Word has length 15 [2019-01-14 15:00:10,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:10,907 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 338 transitions. [2019-01-14 15:00:10,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 338 transitions. [2019-01-14 15:00:10,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 15:00:10,909 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:10,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:10,909 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:10,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:10,909 INFO L82 PathProgramCache]: Analyzing trace with hash 698655544, now seen corresponding path program 1 times [2019-01-14 15:00:10,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:10,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:10,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:10,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:10,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:10,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:10,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:10,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:10,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:10,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:10,953 INFO L87 Difference]: Start difference. First operand 260 states and 338 transitions. Second operand 3 states. [2019-01-14 15:00:10,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:10,984 INFO L93 Difference]: Finished difference Result 422 states and 539 transitions. [2019-01-14 15:00:10,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:10,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-14 15:00:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:10,987 INFO L225 Difference]: With dead ends: 422 [2019-01-14 15:00:10,987 INFO L226 Difference]: Without dead ends: 420 [2019-01-14 15:00:10,987 INFO L631 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-01-14 15:00:10,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-01-14 15:00:11,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 388. [2019-01-14 15:00:11,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-01-14 15:00:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 490 transitions. [2019-01-14 15:00:11,003 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 490 transitions. Word has length 15 [2019-01-14 15:00:11,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:11,004 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 490 transitions. [2019-01-14 15:00:11,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 490 transitions. [2019-01-14 15:00:11,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 15:00:11,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:11,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:11,006 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:11,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:11,006 INFO L82 PathProgramCache]: Analyzing trace with hash -110691082, now seen corresponding path program 1 times [2019-01-14 15:00:11,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:11,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:11,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:11,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:11,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:11,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:11,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:11,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:11,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:11,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:11,051 INFO L87 Difference]: Start difference. First operand 388 states and 490 transitions. Second operand 3 states. [2019-01-14 15:00:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:11,102 INFO L93 Difference]: Finished difference Result 852 states and 1050 transitions. [2019-01-14 15:00:11,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:11,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-14 15:00:11,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:11,103 INFO L225 Difference]: With dead ends: 852 [2019-01-14 15:00:11,103 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 15:00:11,104 INFO L631 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-01-14 15:00:11,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 15:00:11,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 15:00:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 15:00:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 15:00:11,105 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-01-14 15:00:11,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:11,105 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 15:00:11,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:11,106 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 15:00:11,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 15:00:11,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 15:00:11,135 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-14 15:00:11,136 INFO L451 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2019-01-14 15:00:11,136 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2019-01-14 15:00:11,136 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-01-14 15:00:11,136 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 15:00:11,136 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 15:00:11,136 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2019-01-14 15:00:11,137 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2019-01-14 15:00:11,137 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2019-01-14 15:00:11,137 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2019-01-14 15:00:11,137 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2019-01-14 15:00:11,137 INFO L448 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-01-14 15:00:11,137 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-01-14 15:00:11,137 INFO L448 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2019-01-14 15:00:11,137 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 15:00:11,138 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-01-14 15:00:11,138 INFO L451 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2019-01-14 15:00:11,138 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-14 15:00:11,138 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2019-01-14 15:00:11,138 INFO L451 ceAbstractionStarter]: At program point L92(lines 4 93) the Hoare annotation is: true [2019-01-14 15:00:11,138 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-01-14 15:00:11,139 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-01-14 15:00:11,139 INFO L444 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2019-01-14 15:00:11,139 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2019-01-14 15:00:11,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:00:11 BoogieIcfgContainer [2019-01-14 15:00:11,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:00:11,146 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:00:11,146 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:00:11,146 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:00:11,147 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:00:09" (3/4) ... [2019-01-14 15:00:11,151 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 15:00:11,163 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 15:00:11,163 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 15:00:11,225 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:00:11,226 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:00:11,227 INFO L168 Benchmark]: Toolchain (without parser) took 2936.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 952.7 MB in the beginning and 994.9 MB in the end (delta: -42.2 MB). Peak memory consumption was 97.2 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:11,228 INFO L168 Benchmark]: CDTParser took 1.29 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:00:11,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.68 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:11,229 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.72 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:00:11,230 INFO L168 Benchmark]: Boogie Preprocessor took 26.73 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:11,230 INFO L168 Benchmark]: RCFGBuilder took 502.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:11,231 INFO L168 Benchmark]: TraceAbstraction took 2000.33 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: 113.0 MB). Peak memory consumption was 113.0 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:11,232 INFO L168 Benchmark]: Witness Printer took 79.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 994.9 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:11,236 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.29 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 288.68 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.72 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.73 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 502.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2000.33 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: 113.0 MB). Peak memory consumption was 113.0 MB. Max. memory is 11.5 GB. * Witness Printer took 79.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 994.9 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. SAFE Result, 1.9s OverallTime, 13 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 561 SDtfs, 264 SDslu, 345 SDs, 0 SdLazy, 69 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=388occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 41 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 3796 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...