./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i --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/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i -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 5f5357e64289d6bac41f74df7b40a85eebbaa806 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 17:04:23,274 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 17:04:23,276 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 17:04:23,287 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 17:04:23,288 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 17:04:23,289 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 17:04:23,290 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 17:04:23,292 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 17:04:23,294 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 17:04:23,294 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 17:04:23,295 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 17:04:23,296 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 17:04:23,297 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 17:04:23,297 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 17:04:23,299 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 17:04:23,299 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 17:04:23,300 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 17:04:23,302 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 17:04:23,304 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 17:04:23,305 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 17:04:23,307 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 17:04:23,308 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 17:04:23,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 17:04:23,310 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 17:04:23,311 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 17:04:23,311 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 17:04:23,312 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 17:04:23,313 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 17:04:23,314 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 17:04:23,315 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 17:04:23,315 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 17:04:23,316 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 17:04:23,316 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 17:04:23,316 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 17:04:23,318 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 17:04:23,318 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 17:04:23,319 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 17:04:23,334 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 17:04:23,334 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 17:04:23,336 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 17:04:23,336 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 17:04:23,337 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 17:04:23,337 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 17:04:23,337 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 17:04:23,337 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 17:04:23,337 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 17:04:23,337 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 17:04:23,338 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 17:04:23,338 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 17:04:23,339 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 17:04:23,339 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 17:04:23,339 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 17:04:23,339 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 17:04:23,339 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 17:04:23,339 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 17:04:23,340 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 17:04:23,340 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 17:04:23,340 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 17:04:23,340 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 17:04:23,340 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 17:04:23,340 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 17:04:23,341 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 17:04:23,342 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 17:04:23,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 17:04:23,342 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 -> 5f5357e64289d6bac41f74df7b40a85eebbaa806 [2019-01-14 17:04:23,396 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 17:04:23,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 17:04:23,419 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 17:04:23,421 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 17:04:23,421 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 17:04:23,422 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2019-01-14 17:04:23,483 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/349d33886/b62fb51265be48e8a7978fb7291ada54/FLAGbb12ec426 [2019-01-14 17:04:23,942 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 17:04:23,942 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2019-01-14 17:04:23,949 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/349d33886/b62fb51265be48e8a7978fb7291ada54/FLAGbb12ec426 [2019-01-14 17:04:24,292 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/349d33886/b62fb51265be48e8a7978fb7291ada54 [2019-01-14 17:04:24,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 17:04:24,297 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 17:04:24,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 17:04:24,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 17:04:24,302 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 17:04:24,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:04:24" (1/1) ... [2019-01-14 17:04:24,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44bde0e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:04:24, skipping insertion in model container [2019-01-14 17:04:24,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:04:24" (1/1) ... [2019-01-14 17:04:24,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 17:04:24,339 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 17:04:24,604 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 17:04:24,623 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 17:04:24,674 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 17:04:24,705 INFO L195 MainTranslator]: Completed translation [2019-01-14 17:04:24,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:04:24 WrapperNode [2019-01-14 17:04:24,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 17:04:24,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 17:04:24,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 17:04:24,707 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 17:04:24,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:04:24" (1/1) ... [2019-01-14 17:04:24,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:04:24" (1/1) ... [2019-01-14 17:04:24,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 17:04:24,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 17:04:24,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 17:04:24,822 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 17:04:24,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:04:24" (1/1) ... [2019-01-14 17:04:24,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:04:24" (1/1) ... [2019-01-14 17:04:24,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:04:24" (1/1) ... [2019-01-14 17:04:24,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:04:24" (1/1) ... [2019-01-14 17:04:24,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:04:24" (1/1) ... [2019-01-14 17:04:24,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:04:24" (1/1) ... [2019-01-14 17:04:24,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:04:24" (1/1) ... [2019-01-14 17:04:24,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 17:04:24,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 17:04:24,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 17:04:24,885 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 17:04:24,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:04:24" (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 17:04:24,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 17:04:24,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 17:04:24,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 17:04:24,953 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-01-14 17:04:24,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 17:04:24,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 17:04:24,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 17:04:25,466 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 17:04:25,467 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-14 17:04:25,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:04:25 BoogieIcfgContainer [2019-01-14 17:04:25,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 17:04:25,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 17:04:25,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 17:04:25,473 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 17:04:25,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 05:04:24" (1/3) ... [2019-01-14 17:04:25,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aecd226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 05:04:25, skipping insertion in model container [2019-01-14 17:04:25,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:04:24" (2/3) ... [2019-01-14 17:04:25,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aecd226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 05:04:25, skipping insertion in model container [2019-01-14 17:04:25,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:04:25" (3/3) ... [2019-01-14 17:04:25,476 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2019-01-14 17:04:25,486 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 17:04:25,494 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 17:04:25,511 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 17:04:25,538 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 17:04:25,539 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 17:04:25,539 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 17:04:25,539 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 17:04:25,540 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 17:04:25,540 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 17:04:25,540 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 17:04:25,540 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 17:04:25,540 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 17:04:25,555 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-01-14 17:04:25,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 17:04:25,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:04:25,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:04:25,565 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:04:25,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:04:25,571 INFO L82 PathProgramCache]: Analyzing trace with hash -649032135, now seen corresponding path program 1 times [2019-01-14 17:04:25,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:04:25,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:04:25,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:25,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:04:25,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:04:25,720 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 17:04:25,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:04:25,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 17:04:25,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 17:04:25,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 17:04:25,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 17:04:25,740 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2019-01-14 17:04:25,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:04:25,758 INFO L93 Difference]: Finished difference Result 65 states and 94 transitions. [2019-01-14 17:04:25,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 17:04:25,759 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-01-14 17:04:25,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:04:25,769 INFO L225 Difference]: With dead ends: 65 [2019-01-14 17:04:25,769 INFO L226 Difference]: Without dead ends: 29 [2019-01-14 17:04:25,772 INFO L631 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-01-14 17:04:25,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-14 17:04:25,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-14 17:04:25,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 17:04:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2019-01-14 17:04:25,806 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 17 [2019-01-14 17:04:25,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:04:25,806 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-01-14 17:04:25,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 17:04:25,807 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2019-01-14 17:04:25,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 17:04:25,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:04:25,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:04:25,808 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:04:25,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:04:25,809 INFO L82 PathProgramCache]: Analyzing trace with hash -829015504, now seen corresponding path program 1 times [2019-01-14 17:04:25,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:04:25,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:04:25,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:25,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:04:25,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:04:25,875 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 17:04:25,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:04:25,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 17:04:25,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 17:04:25,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 17:04:25,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:04:25,878 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 3 states. [2019-01-14 17:04:25,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:04:25,920 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2019-01-14 17:04:25,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 17:04:25,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-14 17:04:25,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:04:25,922 INFO L225 Difference]: With dead ends: 56 [2019-01-14 17:04:25,922 INFO L226 Difference]: Without dead ends: 30 [2019-01-14 17:04:25,923 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 17:04:25,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-14 17:04:25,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-14 17:04:25,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 17:04:25,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-01-14 17:04:25,929 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 21 [2019-01-14 17:04:25,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:04:25,930 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-14 17:04:25,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 17:04:25,930 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2019-01-14 17:04:25,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 17:04:25,931 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:04:25,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:04:25,931 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:04:25,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:04:25,932 INFO L82 PathProgramCache]: Analyzing trace with hash -2108879182, now seen corresponding path program 1 times [2019-01-14 17:04:25,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:04:25,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:04:25,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:25,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:04:25,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:04:26,086 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 17:04:26,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:04:26,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 17:04:26,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 17:04:26,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 17:04:26,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:04:26,088 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand 5 states. [2019-01-14 17:04:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:04:26,453 INFO L93 Difference]: Finished difference Result 85 states and 113 transitions. [2019-01-14 17:04:26,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 17:04:26,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-14 17:04:26,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:04:26,455 INFO L225 Difference]: With dead ends: 85 [2019-01-14 17:04:26,455 INFO L226 Difference]: Without dead ends: 58 [2019-01-14 17:04:26,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:04:26,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-14 17:04:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 38. [2019-01-14 17:04:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 17:04:26,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2019-01-14 17:04:26,463 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 21 [2019-01-14 17:04:26,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:04:26,463 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-01-14 17:04:26,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 17:04:26,463 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2019-01-14 17:04:26,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 17:04:26,464 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:04:26,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:04:26,465 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:04:26,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:04:26,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2049773838, now seen corresponding path program 1 times [2019-01-14 17:04:26,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:04:26,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:04:26,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:26,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:04:26,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:04:26,597 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 17:04:26,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:04:26,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 17:04:26,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 17:04:26,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 17:04:26,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:04:26,599 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand 6 states. [2019-01-14 17:04:27,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:04:27,070 INFO L93 Difference]: Finished difference Result 137 states and 184 transitions. [2019-01-14 17:04:27,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 17:04:27,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-14 17:04:27,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:04:27,074 INFO L225 Difference]: With dead ends: 137 [2019-01-14 17:04:27,074 INFO L226 Difference]: Without dead ends: 77 [2019-01-14 17:04:27,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 17:04:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-14 17:04:27,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 45. [2019-01-14 17:04:27,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 17:04:27,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2019-01-14 17:04:27,083 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 21 [2019-01-14 17:04:27,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:04:27,083 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2019-01-14 17:04:27,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 17:04:27,083 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2019-01-14 17:04:27,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 17:04:27,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:04:27,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:04:27,085 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:04:27,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:04:27,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1791608400, now seen corresponding path program 1 times [2019-01-14 17:04:27,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:04:27,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:04:27,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:27,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:04:27,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:04:27,237 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 17:04:27,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:04:27,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 17:04:27,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 17:04:27,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 17:04:27,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:04:27,239 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand 5 states. [2019-01-14 17:04:27,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:04:27,684 INFO L93 Difference]: Finished difference Result 114 states and 151 transitions. [2019-01-14 17:04:27,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 17:04:27,687 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-14 17:04:27,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:04:27,689 INFO L225 Difference]: With dead ends: 114 [2019-01-14 17:04:27,690 INFO L226 Difference]: Without dead ends: 56 [2019-01-14 17:04:27,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 17:04:27,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-14 17:04:27,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2019-01-14 17:04:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 17:04:27,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2019-01-14 17:04:27,697 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 21 [2019-01-14 17:04:27,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:04:27,697 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2019-01-14 17:04:27,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 17:04:27,697 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2019-01-14 17:04:27,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 17:04:27,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:04:27,699 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 17:04:27,699 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:04:27,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:04:27,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1282522692, now seen corresponding path program 1 times [2019-01-14 17:04:27,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:04:27,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:04:27,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:27,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:04:27,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:04:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 17:04:27,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:04:27,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 17:04:27,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 17:04:27,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 17:04:27,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-14 17:04:27,897 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand 8 states. [2019-01-14 17:04:28,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:04:28,221 INFO L93 Difference]: Finished difference Result 142 states and 189 transitions. [2019-01-14 17:04:28,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 17:04:28,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-01-14 17:04:28,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:04:28,225 INFO L225 Difference]: With dead ends: 142 [2019-01-14 17:04:28,225 INFO L226 Difference]: Without dead ends: 98 [2019-01-14 17:04:28,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-14 17:04:28,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-14 17:04:28,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 62. [2019-01-14 17:04:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-14 17:04:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2019-01-14 17:04:28,236 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 26 [2019-01-14 17:04:28,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:04:28,237 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2019-01-14 17:04:28,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 17:04:28,237 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2019-01-14 17:04:28,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 17:04:28,239 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:04:28,239 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 17:04:28,239 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:04:28,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:04:28,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1024357254, now seen corresponding path program 1 times [2019-01-14 17:04:28,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:04:28,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:04:28,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:28,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:04:28,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:04:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 17:04:28,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:04:28,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 17:04:28,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 17:04:28,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 17:04:28,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:04:28,449 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand 6 states. [2019-01-14 17:04:29,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:04:29,157 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2019-01-14 17:04:29,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 17:04:29,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-14 17:04:29,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:04:29,160 INFO L225 Difference]: With dead ends: 125 [2019-01-14 17:04:29,160 INFO L226 Difference]: Without dead ends: 123 [2019-01-14 17:04:29,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 17:04:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-14 17:04:29,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 79. [2019-01-14 17:04:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-14 17:04:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2019-01-14 17:04:29,172 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 26 [2019-01-14 17:04:29,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:04:29,172 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2019-01-14 17:04:29,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 17:04:29,173 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2019-01-14 17:04:29,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 17:04:29,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:04:29,175 INFO L402 BasicCegarLoop]: trace histogram [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-01-14 17:04:29,175 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:04:29,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:04:29,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2103980087, now seen corresponding path program 1 times [2019-01-14 17:04:29,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:04:29,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:04:29,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:29,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:04:29,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:04:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 17:04:29,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:04:29,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:04:29,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:04:29,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:04:29,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:04:29,246 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand 4 states. [2019-01-14 17:04:29,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:04:29,298 INFO L93 Difference]: Finished difference Result 130 states and 174 transitions. [2019-01-14 17:04:29,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:04:29,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-01-14 17:04:29,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:04:29,301 INFO L225 Difference]: With dead ends: 130 [2019-01-14 17:04:29,301 INFO L226 Difference]: Without dead ends: 89 [2019-01-14 17:04:29,302 INFO L631 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-01-14 17:04:29,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-14 17:04:29,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-14 17:04:29,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-14 17:04:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 116 transitions. [2019-01-14 17:04:29,313 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 116 transitions. Word has length 28 [2019-01-14 17:04:29,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:04:29,313 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 116 transitions. [2019-01-14 17:04:29,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:04:29,313 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 116 transitions. [2019-01-14 17:04:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 17:04:29,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:04:29,316 INFO L402 BasicCegarLoop]: trace histogram [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-01-14 17:04:29,316 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:04:29,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:04:29,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1710953077, now seen corresponding path program 1 times [2019-01-14 17:04:29,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:04:29,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:04:29,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:29,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:04:29,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:04:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:04:29,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:04:29,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:04:29,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:04:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:04:29,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:04:29,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:04:29,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:04:29,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 17:04:29,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 17:04:29,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 17:04:29,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-14 17:04:29,529 INFO L87 Difference]: Start difference. First operand 89 states and 116 transitions. Second operand 8 states. [2019-01-14 17:04:29,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:04:29,801 INFO L93 Difference]: Finished difference Result 194 states and 250 transitions. [2019-01-14 17:04:29,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 17:04:29,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-01-14 17:04:29,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:04:29,806 INFO L225 Difference]: With dead ends: 194 [2019-01-14 17:04:29,806 INFO L226 Difference]: Without dead ends: 119 [2019-01-14 17:04:29,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-01-14 17:04:29,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-14 17:04:29,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2019-01-14 17:04:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-14 17:04:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 112 transitions. [2019-01-14 17:04:29,822 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 112 transitions. Word has length 28 [2019-01-14 17:04:29,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:04:29,823 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 112 transitions. [2019-01-14 17:04:29,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 17:04:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions. [2019-01-14 17:04:29,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 17:04:29,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:04:29,826 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:04:29,826 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:04:29,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:04:29,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2012014699, now seen corresponding path program 2 times [2019-01-14 17:04:29,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:04:29,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:04:29,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:29,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:04:29,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:04:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:04:30,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:04:30,265 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:04:30,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 17:04:30,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 17:04:30,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:04:30,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:04:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:04:30,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:04:30,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-01-14 17:04:30,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 17:04:30,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 17:04:30,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-01-14 17:04:30,481 INFO L87 Difference]: Start difference. First operand 90 states and 112 transitions. Second operand 17 states. [2019-01-14 17:04:31,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:04:31,368 INFO L93 Difference]: Finished difference Result 244 states and 305 transitions. [2019-01-14 17:04:31,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 17:04:31,369 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2019-01-14 17:04:31,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:04:31,372 INFO L225 Difference]: With dead ends: 244 [2019-01-14 17:04:31,372 INFO L226 Difference]: Without dead ends: 197 [2019-01-14 17:04:31,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2019-01-14 17:04:31,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-14 17:04:31,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 114. [2019-01-14 17:04:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 17:04:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 144 transitions. [2019-01-14 17:04:31,383 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 144 transitions. Word has length 33 [2019-01-14 17:04:31,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:04:31,384 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 144 transitions. [2019-01-14 17:04:31,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 17:04:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 144 transitions. [2019-01-14 17:04:31,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 17:04:31,387 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:04:31,387 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:04:31,387 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:04:31,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:04:31,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1000897449, now seen corresponding path program 1 times [2019-01-14 17:04:31,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:04:31,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:04:31,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:31,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:04:31,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:04:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:04:31,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:04:31,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:04:31,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:04:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:04:31,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:04:31,851 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:04:31,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:04:31,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-01-14 17:04:31,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 17:04:31,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 17:04:31,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-01-14 17:04:31,871 INFO L87 Difference]: Start difference. First operand 114 states and 144 transitions. Second operand 15 states. [2019-01-14 17:04:32,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:04:32,389 INFO L93 Difference]: Finished difference Result 214 states and 263 transitions. [2019-01-14 17:04:32,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 17:04:32,390 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2019-01-14 17:04:32,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:04:32,392 INFO L225 Difference]: With dead ends: 214 [2019-01-14 17:04:32,392 INFO L226 Difference]: Without dead ends: 212 [2019-01-14 17:04:32,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2019-01-14 17:04:32,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-14 17:04:32,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 133. [2019-01-14 17:04:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-14 17:04:32,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 173 transitions. [2019-01-14 17:04:32,402 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 173 transitions. Word has length 33 [2019-01-14 17:04:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:04:32,402 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 173 transitions. [2019-01-14 17:04:32,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 17:04:32,402 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2019-01-14 17:04:32,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 17:04:32,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:04:32,406 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:04:32,406 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:04:32,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:04:32,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1002744491, now seen corresponding path program 1 times [2019-01-14 17:04:32,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:04:32,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:04:32,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:32,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:04:32,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:04:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 17:04:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 17:04:32,468 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 17:04:32,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 05:04:32 BoogieIcfgContainer [2019-01-14 17:04:32,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 17:04:32,514 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 17:04:32,514 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 17:04:32,514 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 17:04:32,516 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:04:25" (3/4) ... [2019-01-14 17:04:32,519 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 17:04:32,586 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 17:04:32,586 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 17:04:32,587 INFO L168 Benchmark]: Toolchain (without parser) took 8290.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.1 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -86.0 MB). Peak memory consumption was 111.1 MB. Max. memory is 11.5 GB. [2019-01-14 17:04:32,588 INFO L168 Benchmark]: CDTParser took 0.16 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 17:04:32,589 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.10 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 17:04:32,589 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-14 17:04:32,590 INFO L168 Benchmark]: Boogie Preprocessor took 63.08 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: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-01-14 17:04:32,590 INFO L168 Benchmark]: RCFGBuilder took 583.65 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: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-01-14 17:04:32,594 INFO L168 Benchmark]: TraceAbstraction took 7044.09 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.5 MB). Peak memory consumption was 119.3 MB. Max. memory is 11.5 GB. [2019-01-14 17:04:32,595 INFO L168 Benchmark]: Witness Printer took 72.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 11.5 GB. [2019-01-14 17:04:32,603 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 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 407.10 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 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 114.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.08 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: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 583.65 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: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7044.09 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.5 MB). Peak memory consumption was 119.3 MB. Max. memory is 11.5 GB. * Witness Printer took 72.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L74] char A [2 + 2 + 4 +1]; [L75] A[2 + 2 + 4] = 0 [L48] int start=0, i=-1, j=-1; [L49] char str2[2]; [L50] COND FALSE !(!str) [L52] i++ [L53] str[i] [L54] case 0: [L69] EXPR str[i] [L69] COND TRUE str[i] != 0 [L52] i++ [L53] str[i] [L54] case 0: [L69] EXPR str[i] [L69] COND TRUE str[i] != 0 [L52] i++ [L53] str[i] [L54] case 0: [L55] EXPR str[start] [L55] (str[start] == ' ') || (str[start] == '\t') [L55] EXPR str[start] [L55] (str[start] == ' ') || (str[start] == '\t') [L55] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L56] EXPR str[start] [L56] COND FALSE !(str[start] == '"') [L57] j = i-1 [L58] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L58] EXPR str[j] [L58] EXPR (str[j] == ' ') || (str[j] == '\t') [L58] EXPR str[j] [L58] EXPR (str[j] == ' ') || (str[j] == '\t') [L58] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L58] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L59] (0 < j) && (str[j] == '"') [L59] EXPR str[j] [L59] (0 < j) && (str[j] == '"') [L59] COND FALSE !((0 < j) && (str[j] == '"')) [L60] COND TRUE start<=j [L30] return strncpy(dest,src,n); [L3] COND TRUE !(cond) [L4] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 1 error locations. UNSAFE Result, 6.9s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 468 SDtfs, 1037 SDslu, 1319 SDs, 0 SdLazy, 1254 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=11, 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, 11 MinimizatonAttempts, 339 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 355 ConstructedInterpolants, 0 QuantifiedInterpolants, 40795 SizeOfPredicates, 10 NumberOfNonLiveVariables, 365 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 6/46 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...