./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.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/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.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 5daa60820c0033439eb2fc136c4a16d466a909bc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 17:35:59,128 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 17:35:59,129 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 17:35:59,142 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 17:35:59,142 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 17:35:59,143 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 17:35:59,147 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 17:35:59,149 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 17:35:59,151 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 17:35:59,152 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 17:35:59,159 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 17:35:59,159 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 17:35:59,160 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 17:35:59,164 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 17:35:59,165 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 17:35:59,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 17:35:59,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 17:35:59,172 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 17:35:59,175 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 17:35:59,180 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 17:35:59,182 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 17:35:59,183 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 17:35:59,188 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 17:35:59,188 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 17:35:59,189 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 17:35:59,190 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 17:35:59,191 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 17:35:59,191 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 17:35:59,192 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 17:35:59,194 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 17:35:59,194 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 17:35:59,195 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 17:35:59,195 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 17:35:59,195 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 17:35:59,197 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 17:35:59,198 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 17:35:59,200 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:35:59,219 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 17:35:59,220 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 17:35:59,221 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 17:35:59,221 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 17:35:59,221 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 17:35:59,221 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 17:35:59,222 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 17:35:59,222 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 17:35:59,223 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 17:35:59,223 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 17:35:59,223 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 17:35:59,223 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 17:35:59,223 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 17:35:59,224 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 17:35:59,224 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 17:35:59,225 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 17:35:59,225 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 17:35:59,225 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 17:35:59,225 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 17:35:59,225 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 17:35:59,226 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 17:35:59,226 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 17:35:59,227 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 17:35:59,227 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 17:35:59,227 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 17:35:59,227 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 17:35:59,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 17:35:59,227 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 -> 5daa60820c0033439eb2fc136c4a16d466a909bc [2019-01-14 17:35:59,280 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 17:35:59,295 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 17:35:59,299 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 17:35:59,300 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 17:35:59,300 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 17:35:59,301 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2019-01-14 17:35:59,358 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b74c40f8/5a19e83aa99241cc86159c99045fcace/FLAGcaf3e279b [2019-01-14 17:35:59,729 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 17:35:59,730 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2019-01-14 17:35:59,737 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b74c40f8/5a19e83aa99241cc86159c99045fcace/FLAGcaf3e279b [2019-01-14 17:36:00,116 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b74c40f8/5a19e83aa99241cc86159c99045fcace [2019-01-14 17:36:00,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 17:36:00,122 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 17:36:00,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 17:36:00,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 17:36:00,128 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 17:36:00,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:36:00" (1/1) ... [2019-01-14 17:36:00,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@263a0264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:00, skipping insertion in model container [2019-01-14 17:36:00,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:36:00" (1/1) ... [2019-01-14 17:36:00,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 17:36:00,179 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 17:36:00,447 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 17:36:00,452 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 17:36:00,485 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 17:36:00,503 INFO L195 MainTranslator]: Completed translation [2019-01-14 17:36:00,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:00 WrapperNode [2019-01-14 17:36:00,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 17:36:00,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 17:36:00,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 17:36:00,506 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 17:36:00,515 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:36:00" (1/1) ... [2019-01-14 17:36:00,523 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:36:00" (1/1) ... [2019-01-14 17:36:00,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 17:36:00,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 17:36:00,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 17:36:00,566 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 17:36:00,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:00" (1/1) ... [2019-01-14 17:36:00,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:00" (1/1) ... [2019-01-14 17:36:00,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:00" (1/1) ... [2019-01-14 17:36:00,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:00" (1/1) ... [2019-01-14 17:36:00,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:00" (1/1) ... [2019-01-14 17:36:00,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:00" (1/1) ... [2019-01-14 17:36:00,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:00" (1/1) ... [2019-01-14 17:36:00,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 17:36:00,715 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 17:36:00,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 17:36:00,715 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 17:36:00,716 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:00" (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:36:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 17:36:00,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 17:36:01,306 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 17:36:01,306 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 17:36:01,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:36:01 BoogieIcfgContainer [2019-01-14 17:36:01,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 17:36:01,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 17:36:01,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 17:36:01,312 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 17:36:01,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 05:36:00" (1/3) ... [2019-01-14 17:36:01,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516756b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 05:36:01, skipping insertion in model container [2019-01-14 17:36:01,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:00" (2/3) ... [2019-01-14 17:36:01,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516756b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 05:36:01, skipping insertion in model container [2019-01-14 17:36:01,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:36:01" (3/3) ... [2019-01-14 17:36:01,315 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2019-01-14 17:36:01,324 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 17:36:01,332 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-01-14 17:36:01,348 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-01-14 17:36:01,377 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 17:36:01,377 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 17:36:01,378 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 17:36:01,378 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 17:36:01,378 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 17:36:01,378 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 17:36:01,378 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 17:36:01,379 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 17:36:01,379 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 17:36:01,397 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-01-14 17:36:01,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 17:36:01,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:01,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:36:01,409 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:01,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:01,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1241029004, now seen corresponding path program 1 times [2019-01-14 17:36:01,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:01,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:01,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:01,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:01,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:01,562 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:36:01,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:01,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 17:36:01,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 17:36:01,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 17:36:01,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:36:01,584 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2019-01-14 17:36:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:01,625 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2019-01-14 17:36:01,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 17:36:01,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-14 17:36:01,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:01,638 INFO L225 Difference]: With dead ends: 83 [2019-01-14 17:36:01,638 INFO L226 Difference]: Without dead ends: 72 [2019-01-14 17:36:01,641 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:36:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-14 17:36:01,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2019-01-14 17:36:01,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-14 17:36:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-01-14 17:36:01,676 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 9 [2019-01-14 17:36:01,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:01,677 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-01-14 17:36:01,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 17:36:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-01-14 17:36:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 17:36:01,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:01,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:36:01,679 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:01,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:01,679 INFO L82 PathProgramCache]: Analyzing trace with hash -182802478, now seen corresponding path program 1 times [2019-01-14 17:36:01,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:01,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:01,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:01,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:01,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:01,811 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:36:01,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:01,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 17:36:01,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 17:36:01,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 17:36:01,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:36:01,815 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 5 states. [2019-01-14 17:36:02,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:02,228 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2019-01-14 17:36:02,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 17:36:02,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-14 17:36:02,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:02,231 INFO L225 Difference]: With dead ends: 73 [2019-01-14 17:36:02,231 INFO L226 Difference]: Without dead ends: 71 [2019-01-14 17:36:02,232 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:36:02,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-14 17:36:02,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2019-01-14 17:36:02,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 17:36:02,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-01-14 17:36:02,241 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 10 [2019-01-14 17:36:02,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:02,241 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-01-14 17:36:02,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 17:36:02,241 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-01-14 17:36:02,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 17:36:02,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:02,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:36:02,243 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:02,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:02,244 INFO L82 PathProgramCache]: Analyzing trace with hash -179156060, now seen corresponding path program 1 times [2019-01-14 17:36:02,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:02,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:02,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:02,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:02,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:02,300 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:36:02,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:02,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:36:02,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:36:02,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:36:02,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:36:02,303 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 4 states. [2019-01-14 17:36:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:02,426 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2019-01-14 17:36:02,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 17:36:02,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-14 17:36:02,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:02,429 INFO L225 Difference]: With dead ends: 143 [2019-01-14 17:36:02,429 INFO L226 Difference]: Without dead ends: 93 [2019-01-14 17:36:02,430 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:36:02,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-14 17:36:02,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2019-01-14 17:36:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 17:36:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-01-14 17:36:02,442 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 10 [2019-01-14 17:36:02,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:02,442 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-01-14 17:36:02,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:36:02,442 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-01-14 17:36:02,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 17:36:02,443 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:02,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:36:02,444 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:02,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:02,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1258866483, now seen corresponding path program 1 times [2019-01-14 17:36:02,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:02,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:02,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:02,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:02,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:02,551 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:36:02,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:02,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 17:36:02,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 17:36:02,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 17:36:02,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:36:02,553 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2019-01-14 17:36:02,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:02,975 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2019-01-14 17:36:02,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 17:36:02,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-14 17:36:02,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:02,979 INFO L225 Difference]: With dead ends: 94 [2019-01-14 17:36:02,979 INFO L226 Difference]: Without dead ends: 92 [2019-01-14 17:36:02,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-01-14 17:36:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-14 17:36:02,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 50. [2019-01-14 17:36:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-14 17:36:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-01-14 17:36:02,999 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 11 [2019-01-14 17:36:02,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:02,999 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-01-14 17:36:02,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 17:36:02,999 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-01-14 17:36:03,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 17:36:03,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:03,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:36:03,001 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:03,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:03,002 INFO L82 PathProgramCache]: Analyzing trace with hash 420636790, now seen corresponding path program 1 times [2019-01-14 17:36:03,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:03,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:03,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:03,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:03,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:03,224 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:36:03,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:03,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 17:36:03,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 17:36:03,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 17:36:03,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:36:03,226 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-01-14 17:36:03,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:03,440 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2019-01-14 17:36:03,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 17:36:03,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-01-14 17:36:03,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:03,442 INFO L225 Difference]: With dead ends: 87 [2019-01-14 17:36:03,442 INFO L226 Difference]: Without dead ends: 85 [2019-01-14 17:36:03,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 17:36:03,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-14 17:36:03,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 48. [2019-01-14 17:36:03,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 17:36:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-01-14 17:36:03,450 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 12 [2019-01-14 17:36:03,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:03,450 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-01-14 17:36:03,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 17:36:03,450 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-01-14 17:36:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 17:36:03,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:03,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:36:03,452 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:03,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:03,452 INFO L82 PathProgramCache]: Analyzing trace with hash -370151221, now seen corresponding path program 1 times [2019-01-14 17:36:03,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:03,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:03,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:03,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:03,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:03,574 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:36:03,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:03,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 17:36:03,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 17:36:03,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 17:36:03,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-14 17:36:03,576 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 8 states. [2019-01-14 17:36:04,061 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 17:36:04,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:04,384 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-01-14 17:36:04,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 17:36:04,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-01-14 17:36:04,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:04,385 INFO L225 Difference]: With dead ends: 89 [2019-01-14 17:36:04,385 INFO L226 Difference]: Without dead ends: 87 [2019-01-14 17:36:04,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-14 17:36:04,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-14 17:36:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 46. [2019-01-14 17:36:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 17:36:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-01-14 17:36:04,395 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 12 [2019-01-14 17:36:04,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:04,395 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-01-14 17:36:04,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 17:36:04,395 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-01-14 17:36:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 17:36:04,396 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:04,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:36:04,397 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:04,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:04,397 INFO L82 PathProgramCache]: Analyzing trace with hash 154842714, now seen corresponding path program 1 times [2019-01-14 17:36:04,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:04,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:04,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:04,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:04,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:04,463 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:36:04,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:04,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 17:36:04,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 17:36:04,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 17:36:04,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:36:04,466 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-01-14 17:36:04,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:04,669 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-01-14 17:36:04,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 17:36:04,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-14 17:36:04,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:04,672 INFO L225 Difference]: With dead ends: 75 [2019-01-14 17:36:04,672 INFO L226 Difference]: Without dead ends: 73 [2019-01-14 17:36:04,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 17:36:04,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-14 17:36:04,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2019-01-14 17:36:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-14 17:36:04,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-01-14 17:36:04,683 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 13 [2019-01-14 17:36:04,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:04,684 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-01-14 17:36:04,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 17:36:04,684 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-01-14 17:36:04,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 17:36:04,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:04,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:36:04,685 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:04,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:04,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1410218132, now seen corresponding path program 1 times [2019-01-14 17:36:04,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:04,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:04,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:04,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:04,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:04,889 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:36:04,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:04,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 17:36:04,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 17:36:04,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 17:36:04,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:36:04,891 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2019-01-14 17:36:05,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:05,062 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2019-01-14 17:36:05,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 17:36:05,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-01-14 17:36:05,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:05,064 INFO L225 Difference]: With dead ends: 85 [2019-01-14 17:36:05,064 INFO L226 Difference]: Without dead ends: 83 [2019-01-14 17:36:05,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-01-14 17:36:05,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-14 17:36:05,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 42. [2019-01-14 17:36:05,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 17:36:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-01-14 17:36:05,073 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2019-01-14 17:36:05,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:05,073 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-01-14 17:36:05,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 17:36:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-01-14 17:36:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 17:36:05,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:05,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:36:05,075 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:05,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:05,075 INFO L82 PathProgramCache]: Analyzing trace with hash 505160957, now seen corresponding path program 1 times [2019-01-14 17:36:05,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:05,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:05,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:05,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:05,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:05,143 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:36:05,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:05,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 17:36:05,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 17:36:05,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 17:36:05,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:36:05,144 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 6 states. [2019-01-14 17:36:05,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:05,335 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-01-14 17:36:05,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 17:36:05,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-14 17:36:05,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:05,337 INFO L225 Difference]: With dead ends: 67 [2019-01-14 17:36:05,337 INFO L226 Difference]: Without dead ends: 65 [2019-01-14 17:36:05,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-14 17:36:05,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-14 17:36:05,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2019-01-14 17:36:05,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 17:36:05,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-01-14 17:36:05,344 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 14 [2019-01-14 17:36:05,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:05,345 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-14 17:36:05,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 17:36:05,345 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-01-14 17:36:05,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 17:36:05,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:05,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:36:05,346 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:05,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:05,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1519875391, now seen corresponding path program 1 times [2019-01-14 17:36:05,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:05,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:05,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:05,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:05,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:05,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 17:36:05,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:05,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 17:36:05,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 17:36:05,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 17:36:05,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:36:05,398 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2019-01-14 17:36:05,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:05,524 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2019-01-14 17:36:05,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 17:36:05,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-01-14 17:36:05,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:05,526 INFO L225 Difference]: With dead ends: 67 [2019-01-14 17:36:05,526 INFO L226 Difference]: Without dead ends: 65 [2019-01-14 17:36:05,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:36:05,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-14 17:36:05,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2019-01-14 17:36:05,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 17:36:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-01-14 17:36:05,534 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2019-01-14 17:36:05,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:05,534 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-01-14 17:36:05,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 17:36:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-01-14 17:36:05,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 17:36:05,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:05,535 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:36:05,536 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:05,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:05,536 INFO L82 PathProgramCache]: Analyzing trace with hash 128507268, now seen corresponding path program 1 times [2019-01-14 17:36:05,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:05,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:05,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:05,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:05,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:05,614 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:36:05,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:05,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 17:36:05,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 17:36:05,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 17:36:05,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 17:36:05,616 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 7 states. [2019-01-14 17:36:05,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:05,826 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2019-01-14 17:36:05,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 17:36:05,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-14 17:36:05,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:05,829 INFO L225 Difference]: With dead ends: 65 [2019-01-14 17:36:05,829 INFO L226 Difference]: Without dead ends: 63 [2019-01-14 17:36:05,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-14 17:36:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-14 17:36:05,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 36. [2019-01-14 17:36:05,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 17:36:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-01-14 17:36:05,836 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2019-01-14 17:36:05,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:05,836 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-01-14 17:36:05,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 17:36:05,837 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-01-14 17:36:05,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 17:36:05,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:05,837 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:36:05,838 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:05,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:05,838 INFO L82 PathProgramCache]: Analyzing trace with hash -311237848, now seen corresponding path program 1 times [2019-01-14 17:36:05,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:05,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:05,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:05,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:05,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:05,960 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:36:05,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:05,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 17:36:05,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 17:36:05,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 17:36:05,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:36:05,963 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2019-01-14 17:36:06,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:06,150 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2019-01-14 17:36:06,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 17:36:06,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-14 17:36:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:06,153 INFO L225 Difference]: With dead ends: 86 [2019-01-14 17:36:06,153 INFO L226 Difference]: Without dead ends: 84 [2019-01-14 17:36:06,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-14 17:36:06,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-14 17:36:06,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 34. [2019-01-14 17:36:06,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 17:36:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-01-14 17:36:06,164 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 17 [2019-01-14 17:36:06,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:06,164 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-01-14 17:36:06,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 17:36:06,164 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-01-14 17:36:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 17:36:06,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:06,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:36:06,168 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:06,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1058434549, now seen corresponding path program 1 times [2019-01-14 17:36:06,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:06,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:06,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:06,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:06,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:06,673 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:36:06,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:06,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 17:36:06,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 17:36:06,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 17:36:06,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-14 17:36:06,675 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 8 states. [2019-01-14 17:36:07,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:07,140 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2019-01-14 17:36:07,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 17:36:07,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-01-14 17:36:07,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:07,142 INFO L225 Difference]: With dead ends: 68 [2019-01-14 17:36:07,142 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 17:36:07,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-01-14 17:36:07,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 17:36:07,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 32. [2019-01-14 17:36:07,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 17:36:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-01-14 17:36:07,148 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2019-01-14 17:36:07,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:07,149 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-01-14 17:36:07,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 17:36:07,149 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-01-14 17:36:07,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 17:36:07,149 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:07,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:36:07,150 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:07,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:07,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1548271503, now seen corresponding path program 1 times [2019-01-14 17:36:07,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:07,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:07,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:07,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:07,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:07,269 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:36:07,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:07,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 17:36:07,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 17:36:07,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 17:36:07,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 17:36:07,271 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 8 states. [2019-01-14 17:36:08,043 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 17:36:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:08,179 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2019-01-14 17:36:08,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 17:36:08,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-01-14 17:36:08,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:08,181 INFO L225 Difference]: With dead ends: 103 [2019-01-14 17:36:08,182 INFO L226 Difference]: Without dead ends: 101 [2019-01-14 17:36:08,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-14 17:36:08,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-14 17:36:08,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 30. [2019-01-14 17:36:08,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 17:36:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-01-14 17:36:08,188 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2019-01-14 17:36:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:08,188 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-01-14 17:36:08,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 17:36:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-01-14 17:36:08,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 17:36:08,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:08,189 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] [2019-01-14 17:36:08,190 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:08,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:08,190 INFO L82 PathProgramCache]: Analyzing trace with hash 751780498, now seen corresponding path program 1 times [2019-01-14 17:36:08,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:08,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:08,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:08,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:08,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:08,381 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:36:08,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:08,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 17:36:08,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 17:36:08,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 17:36:08,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-14 17:36:08,382 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2019-01-14 17:36:08,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:08,828 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2019-01-14 17:36:08,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 17:36:08,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-01-14 17:36:08,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:08,830 INFO L225 Difference]: With dead ends: 66 [2019-01-14 17:36:08,830 INFO L226 Difference]: Without dead ends: 64 [2019-01-14 17:36:08,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-01-14 17:36:08,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-14 17:36:08,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 28. [2019-01-14 17:36:08,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 17:36:08,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-01-14 17:36:08,837 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2019-01-14 17:36:08,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:08,837 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-01-14 17:36:08,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 17:36:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-01-14 17:36:08,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 17:36:08,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:08,838 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:36:08,838 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:08,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:08,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1830363126, now seen corresponding path program 1 times [2019-01-14 17:36:08,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:08,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:08,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:08,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:08,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:08,899 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:36:08,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:08,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 17:36:08,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 17:36:08,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 17:36:08,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 17:36:08,901 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2019-01-14 17:36:09,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:09,298 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2019-01-14 17:36:09,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 17:36:09,299 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-14 17:36:09,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:09,299 INFO L225 Difference]: With dead ends: 82 [2019-01-14 17:36:09,300 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 17:36:09,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-14 17:36:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 17:36:09,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 17:36:09,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 17:36:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 17:36:09,302 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-01-14 17:36:09,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:09,302 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 17:36:09,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 17:36:09,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 17:36:09,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 17:36:09,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 17:36:09,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 17:36:09,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 17:36:09,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 17:36:09,541 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 86 [2019-01-14 17:36:09,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 17:36:09,778 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 72 [2019-01-14 17:36:11,319 WARN L181 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 86 DAG size of output: 21 [2019-01-14 17:36:11,702 WARN L181 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 35 [2019-01-14 17:36:11,705 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-01-14 17:36:11,705 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 120) no Hoare annotation was computed. [2019-01-14 17:36:11,705 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 260) no Hoare annotation was computed. [2019-01-14 17:36:11,706 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2019-01-14 17:36:11,706 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 281) no Hoare annotation was computed. [2019-01-14 17:36:11,706 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2019-01-14 17:36:11,706 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 124) no Hoare annotation was computed. [2019-01-14 17:36:11,707 INFO L444 ceAbstractionStarter]: At program point L259(lines 26 301) the Hoare annotation is: (let ((.cse0 (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0))) (or (and (and (and (<= 0 ULTIMATE.start_main_~main__j~0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__len~0)) .cse0) (<= 0 ULTIMATE.start_main_~main__i~0)) (let ((.cse2 (<= (+ ULTIMATE.start_main_~main__j~0 4) ULTIMATE.start_main_~main__bufsize~0))) (let ((.cse1 (and (let ((.cse3 (<= 1 ULTIMATE.start_main_~main__i~0))) (or (and .cse3 .cse2) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse3))) (<= 1 ULTIMATE.start_main_~main__j~0)))) (or (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~14 0)) .cse1 .cse0) (and .cse1 .cse0 .cse2)))))) [2019-01-14 17:36:11,707 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-14 17:36:11,707 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 17:36:11,707 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 280) no Hoare annotation was computed. [2019-01-14 17:36:11,707 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 17:36:11,708 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2019-01-14 17:36:11,708 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 266) no Hoare annotation was computed. [2019-01-14 17:36:11,708 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-14 17:36:11,708 INFO L448 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-01-14 17:36:11,708 INFO L448 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-01-14 17:36:11,708 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 270) no Hoare annotation was computed. [2019-01-14 17:36:11,708 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-01-14 17:36:11,708 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 272) no Hoare annotation was computed. [2019-01-14 17:36:11,708 INFO L448 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-01-14 17:36:11,709 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2019-01-14 17:36:11,709 INFO L448 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2019-01-14 17:36:11,709 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 276) no Hoare annotation was computed. [2019-01-14 17:36:11,709 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2019-01-14 17:36:11,710 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 118) no Hoare annotation was computed. [2019-01-14 17:36:11,710 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2019-01-14 17:36:11,710 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-01-14 17:36:11,710 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 295) no Hoare annotation was computed. [2019-01-14 17:36:11,710 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-01-14 17:36:11,710 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 122) no Hoare annotation was computed. [2019-01-14 17:36:11,710 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 307) no Hoare annotation was computed. [2019-01-14 17:36:11,710 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 262) no Hoare annotation was computed. [2019-01-14 17:36:11,711 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-14 17:36:11,711 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2019-01-14 17:36:11,711 INFO L448 ceAbstractionStarter]: For program point L40(lines 40 283) no Hoare annotation was computed. [2019-01-14 17:36:11,711 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2019-01-14 17:36:11,711 INFO L444 ceAbstractionStarter]: At program point L288(lines 33 289) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__j~0 5) ULTIMATE.start_main_~main__bufsize~0) (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__len~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0) (<= 0 ULTIMATE.start_main_~main__j~0)) [2019-01-14 17:36:11,711 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-14 17:36:11,711 INFO L448 ceAbstractionStarter]: For program point L222(lines 222 264) no Hoare annotation was computed. [2019-01-14 17:36:11,712 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2019-01-14 17:36:11,712 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2019-01-14 17:36:11,712 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-14 17:36:11,712 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 240) no Hoare annotation was computed. [2019-01-14 17:36:11,712 INFO L451 ceAbstractionStarter]: At program point L305(lines 8 308) the Hoare annotation is: true [2019-01-14 17:36:11,712 INFO L448 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-01-14 17:36:11,712 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 268) no Hoare annotation was computed. [2019-01-14 17:36:11,713 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 289) no Hoare annotation was computed. [2019-01-14 17:36:11,716 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 17:36:11,716 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-01-14 17:36:11,717 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2019-01-14 17:36:11,717 INFO L448 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-01-14 17:36:11,717 INFO L448 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2019-01-14 17:36:11,717 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-01-14 17:36:11,717 INFO L448 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2019-01-14 17:36:11,717 INFO L448 ceAbstractionStarter]: For program point L158(lines 158 274) no Hoare annotation was computed. [2019-01-14 17:36:11,717 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2019-01-14 17:36:11,718 INFO L444 ceAbstractionStarter]: At program point L299(lines 20 307) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0)) [2019-01-14 17:36:11,718 INFO L448 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-01-14 17:36:11,718 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 278) no Hoare annotation was computed. [2019-01-14 17:36:11,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 05:36:11 BoogieIcfgContainer [2019-01-14 17:36:11,736 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 17:36:11,737 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 17:36:11,737 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 17:36:11,737 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 17:36:11,737 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:36:01" (3/4) ... [2019-01-14 17:36:11,743 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 17:36:11,757 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 17:36:11,757 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 17:36:11,845 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 17:36:11,846 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 17:36:11,847 INFO L168 Benchmark]: Toolchain (without parser) took 11725.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.4 MB). Free memory was 951.4 MB in the beginning and 815.2 MB in the end (delta: 136.1 MB). Peak memory consumption was 349.5 MB. Max. memory is 11.5 GB. [2019-01-14 17:36:11,848 INFO L168 Benchmark]: CDTParser took 0.15 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:36:11,848 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.32 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-14 17:36:11,849 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.74 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 17:36:11,849 INFO L168 Benchmark]: Boogie Preprocessor took 148.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -204.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-14 17:36:11,850 INFO L168 Benchmark]: RCFGBuilder took 592.88 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-01-14 17:36:11,852 INFO L168 Benchmark]: TraceAbstraction took 10427.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 823.0 MB in the end (delta: 297.1 MB). Peak memory consumption was 357.4 MB. Max. memory is 11.5 GB. [2019-01-14 17:36:11,852 INFO L168 Benchmark]: Witness Printer took 109.09 ms. Allocated memory is still 1.2 GB. Free memory was 823.0 MB in the beginning and 815.2 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2019-01-14 17:36:11,856 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.15 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 382.32 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.74 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 148.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -204.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 592.88 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10427.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 823.0 MB in the end (delta: 297.1 MB). Peak memory consumption was 357.4 MB. Max. memory is 11.5 GB. * Witness Printer took 109.09 ms. Allocated memory is still 1.2 GB. Free memory was 823.0 MB in the beginning and 815.2 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 160]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((main__j + 5 <= main__bufsize && 0 <= main__i) && main__i + 1 <= main__len) && main__limit + 4 <= main__bufsize) && 0 <= main__j - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= main__i && main__limit + 4 <= main__bufsize - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((0 <= main__j && main__i + 1 <= main__len) && main__limit + 4 <= main__bufsize) && 0 <= main__i) || ((!(__VERIFIER_assert__cond == 0) && ((1 <= main__i && main__j + 4 <= main__bufsize) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__i)) && 1 <= main__j) && main__limit + 4 <= main__bufsize) || (((((1 <= main__i && main__j + 4 <= main__bufsize) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__i)) && 1 <= main__j) && main__limit + 4 <= main__bufsize) && main__j + 4 <= main__bufsize) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 16 error locations. SAFE Result, 10.3s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 703 SDtfs, 1740 SDslu, 714 SDs, 0 SdLazy, 1623 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, 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, 16 MinimizatonAttempts, 536 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 22 NumberOfFragments, 121 HoareAnnotationTreeSize, 4 FomulaSimplifications, 3751018988 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1111887 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 12103 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...