java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label47_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 01:29:59,108 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 01:29:59,111 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 01:29:59,125 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 01:29:59,126 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 01:29:59,127 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 01:29:59,128 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 01:29:59,130 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 01:29:59,131 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 01:29:59,132 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 01:29:59,133 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 01:29:59,134 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 01:29:59,134 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 01:29:59,135 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 01:29:59,137 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 01:29:59,137 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 01:29:59,138 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 01:29:59,140 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 01:29:59,142 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 01:29:59,144 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 01:29:59,145 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 01:29:59,146 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 01:29:59,149 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 01:29:59,149 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 01:29:59,149 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 01:29:59,150 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 01:29:59,151 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 01:29:59,152 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 01:29:59,153 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 01:29:59,154 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 01:29:59,154 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 01:29:59,155 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 01:29:59,155 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 01:29:59,156 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 01:29:59,157 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 01:29:59,158 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 01:29:59,158 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-24 01:29:59,173 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 01:29:59,174 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 01:29:59,175 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 01:29:59,175 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-24 01:29:59,175 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-24 01:29:59,176 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-24 01:29:59,176 INFO L133 SettingsManager]: * Use SBE=true [2018-07-24 01:29:59,176 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 01:29:59,176 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 01:29:59,176 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 01:29:59,177 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 01:29:59,177 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 01:29:59,177 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 01:29:59,177 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 01:29:59,177 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 01:29:59,178 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 01:29:59,178 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 01:29:59,178 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 01:29:59,178 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 01:29:59,179 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 01:29:59,179 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 01:29:59,179 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 01:29:59,179 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 01:29:59,179 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-24 01:29:59,180 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 01:29:59,180 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 01:29:59,180 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 01:29:59,180 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 01:29:59,223 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 01:29:59,236 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 01:29:59,240 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 01:29:59,242 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 01:29:59,243 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 01:29:59,244 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label47_true-unreach-call.c [2018-07-24 01:29:59,586 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6edc63e96/57d620e5f7384606b231f5248c541d62/FLAG0b55154f4 [2018-07-24 01:29:59,981 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 01:29:59,983 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label47_true-unreach-call.c [2018-07-24 01:30:00,012 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6edc63e96/57d620e5f7384606b231f5248c541d62/FLAG0b55154f4 [2018-07-24 01:30:00,035 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6edc63e96/57d620e5f7384606b231f5248c541d62 [2018-07-24 01:30:00,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 01:30:00,052 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 01:30:00,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 01:30:00,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 01:30:00,063 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 01:30:00,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:30:00" (1/1) ... [2018-07-24 01:30:00,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd04cac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:00, skipping insertion in model container [2018-07-24 01:30:00,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:30:00" (1/1) ... [2018-07-24 01:30:00,315 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 01:30:00,816 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:30:00,835 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 01:30:01,117 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:30:01,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:01 WrapperNode [2018-07-24 01:30:01,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 01:30:01,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 01:30:01,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 01:30:01,180 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 01:30:01,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:01" (1/1) ... [2018-07-24 01:30:01,223 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:01" (1/1) ... [2018-07-24 01:30:01,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 01:30:01,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 01:30:01,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 01:30:01,325 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 01:30:01,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:01" (1/1) ... [2018-07-24 01:30:01,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:01" (1/1) ... [2018-07-24 01:30:01,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:01" (1/1) ... [2018-07-24 01:30:01,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:01" (1/1) ... [2018-07-24 01:30:01,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:01" (1/1) ... [2018-07-24 01:30:01,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:01" (1/1) ... [2018-07-24 01:30:01,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:01" (1/1) ... [2018-07-24 01:30:01,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 01:30:01,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 01:30:01,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 01:30:01,724 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 01:30:01,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:01" (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 [2018-07-24 01:30:01,797 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-24 01:30:01,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 01:30:01,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 01:30:07,165 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 01:30:07,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:30:07 BoogieIcfgContainer [2018-07-24 01:30:07,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 01:30:07,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 01:30:07,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 01:30:07,171 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 01:30:07,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 01:30:00" (1/3) ... [2018-07-24 01:30:07,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581a517b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:30:07, skipping insertion in model container [2018-07-24 01:30:07,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:01" (2/3) ... [2018-07-24 01:30:07,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581a517b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:30:07, skipping insertion in model container [2018-07-24 01:30:07,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:30:07" (3/3) ... [2018-07-24 01:30:07,175 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label47_true-unreach-call.c [2018-07-24 01:30:07,186 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 01:30:07,196 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 01:30:07,256 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 01:30:07,257 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 01:30:07,259 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 01:30:07,260 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 01:30:07,260 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 01:30:07,260 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 01:30:07,260 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 01:30:07,261 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 01:30:07,261 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 01:30:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-07-24 01:30:07,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-24 01:30:07,324 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:07,326 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:07,329 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:07,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1022585908, now seen corresponding path program 1 times [2018-07-24 01:30:07,338 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:07,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:07,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:07,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:07,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:30:08,349 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:08,349 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:30:08,355 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:30:08,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:30:08,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:08,377 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-07-24 01:30:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:11,791 INFO L93 Difference]: Finished difference Result 1079 states and 1933 transitions. [2018-07-24 01:30:11,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:30:11,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2018-07-24 01:30:11,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:11,818 INFO L225 Difference]: With dead ends: 1079 [2018-07-24 01:30:11,819 INFO L226 Difference]: Without dead ends: 769 [2018-07-24 01:30:11,824 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:11,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-07-24 01:30:11,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 513. [2018-07-24 01:30:11,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-07-24 01:30:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 851 transitions. [2018-07-24 01:30:11,928 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 851 transitions. Word has length 198 [2018-07-24 01:30:11,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:11,930 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 851 transitions. [2018-07-24 01:30:11,930 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:30:11,930 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 851 transitions. [2018-07-24 01:30:11,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-07-24 01:30:11,938 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:11,939 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:11,939 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:11,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1365528693, now seen corresponding path program 1 times [2018-07-24 01:30:11,940 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:11,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:11,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:11,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:11,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:12,109 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:30:12,110 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:12,110 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:30:12,118 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:12,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:12,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:12,119 INFO L87 Difference]: Start difference. First operand 513 states and 851 transitions. Second operand 3 states. [2018-07-24 01:30:14,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:14,238 INFO L93 Difference]: Finished difference Result 1449 states and 2462 transitions. [2018-07-24 01:30:14,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:14,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2018-07-24 01:30:14,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:14,245 INFO L225 Difference]: With dead ends: 1449 [2018-07-24 01:30:14,246 INFO L226 Difference]: Without dead ends: 938 [2018-07-24 01:30:14,250 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:14,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-07-24 01:30:14,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 923. [2018-07-24 01:30:14,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-07-24 01:30:14,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-07-24 01:30:14,295 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 207 [2018-07-24 01:30:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:14,295 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-07-24 01:30:14,296 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:14,296 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-07-24 01:30:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-24 01:30:14,301 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:14,301 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:14,303 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:14,304 INFO L82 PathProgramCache]: Analyzing trace with hash -8302093, now seen corresponding path program 1 times [2018-07-24 01:30:14,304 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:14,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:14,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:14,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:14,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:14,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:30:14,618 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:14,618 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:30:14,618 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:30:14,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:30:14,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:14,619 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 4 states. [2018-07-24 01:30:18,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:18,244 INFO L93 Difference]: Finished difference Result 3532 states and 5873 transitions. [2018-07-24 01:30:18,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:30:18,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2018-07-24 01:30:18,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:18,263 INFO L225 Difference]: With dead ends: 3532 [2018-07-24 01:30:18,263 INFO L226 Difference]: Without dead ends: 2611 [2018-07-24 01:30:18,267 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:18,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2018-07-24 01:30:18,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 1751. [2018-07-24 01:30:18,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-07-24 01:30:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2699 transitions. [2018-07-24 01:30:18,331 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2699 transitions. Word has length 208 [2018-07-24 01:30:18,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:18,332 INFO L471 AbstractCegarLoop]: Abstraction has 1751 states and 2699 transitions. [2018-07-24 01:30:18,332 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:30:18,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2699 transitions. [2018-07-24 01:30:18,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-07-24 01:30:18,339 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:18,339 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:18,339 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:18,340 INFO L82 PathProgramCache]: Analyzing trace with hash 732245926, now seen corresponding path program 1 times [2018-07-24 01:30:18,340 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:18,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:18,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:18,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:18,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:18,558 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:30:18,559 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:18,559 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:30:18,560 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:18,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:18,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:18,561 INFO L87 Difference]: Start difference. First operand 1751 states and 2699 transitions. Second operand 3 states. [2018-07-24 01:30:20,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:20,482 INFO L93 Difference]: Finished difference Result 4329 states and 6639 transitions. [2018-07-24 01:30:20,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:20,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2018-07-24 01:30:20,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:20,498 INFO L225 Difference]: With dead ends: 4329 [2018-07-24 01:30:20,499 INFO L226 Difference]: Without dead ends: 2580 [2018-07-24 01:30:20,502 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:20,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2018-07-24 01:30:20,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2579. [2018-07-24 01:30:20,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2579 states. [2018-07-24 01:30:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 3884 transitions. [2018-07-24 01:30:20,553 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 3884 transitions. Word has length 209 [2018-07-24 01:30:20,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:20,554 INFO L471 AbstractCegarLoop]: Abstraction has 2579 states and 3884 transitions. [2018-07-24 01:30:20,554 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:20,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 3884 transitions. [2018-07-24 01:30:20,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-07-24 01:30:20,561 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:20,561 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:20,562 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:20,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1335916449, now seen corresponding path program 1 times [2018-07-24 01:30:20,562 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:20,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:20,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:20,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:20,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:20,823 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-07-24 01:30:20,823 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:20,823 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:30:20,824 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:20,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:20,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:20,825 INFO L87 Difference]: Start difference. First operand 2579 states and 3884 transitions. Second operand 3 states. [2018-07-24 01:30:22,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:22,796 INFO L93 Difference]: Finished difference Result 5157 states and 7768 transitions. [2018-07-24 01:30:22,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:22,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2018-07-24 01:30:22,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:22,810 INFO L225 Difference]: With dead ends: 5157 [2018-07-24 01:30:22,810 INFO L226 Difference]: Without dead ends: 2580 [2018-07-24 01:30:22,814 INFO L573 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 [2018-07-24 01:30:22,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2018-07-24 01:30:22,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2579. [2018-07-24 01:30:22,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2579 states. [2018-07-24 01:30:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 3532 transitions. [2018-07-24 01:30:22,861 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 3532 transitions. Word has length 215 [2018-07-24 01:30:22,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:22,862 INFO L471 AbstractCegarLoop]: Abstraction has 2579 states and 3532 transitions. [2018-07-24 01:30:22,862 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 3532 transitions. [2018-07-24 01:30:22,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-07-24 01:30:22,869 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:22,870 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:22,870 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:22,870 INFO L82 PathProgramCache]: Analyzing trace with hash -875158662, now seen corresponding path program 1 times [2018-07-24 01:30:22,870 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:22,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:22,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:22,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:22,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:23,324 WARN L169 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-07-24 01:30:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-24 01:30:23,428 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:30:23,428 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 01:30:23,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:23,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:30:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-07-24 01:30:23,768 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 01:30:23,768 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-07-24 01:30:23,769 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 01:30:23,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 01:30:23,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:30:23,771 INFO L87 Difference]: Start difference. First operand 2579 states and 3532 transitions. Second operand 5 states. [2018-07-24 01:30:29,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:29,959 INFO L93 Difference]: Finished difference Result 16214 states and 22245 transitions. [2018-07-24 01:30:29,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 01:30:29,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2018-07-24 01:30:29,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:30,006 INFO L225 Difference]: With dead ends: 16214 [2018-07-24 01:30:30,006 INFO L226 Difference]: Without dead ends: 13637 [2018-07-24 01:30:30,014 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-07-24 01:30:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13637 states. [2018-07-24 01:30:30,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13637 to 11593. [2018-07-24 01:30:30,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11593 states. [2018-07-24 01:30:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11593 states to 11593 states and 13992 transitions. [2018-07-24 01:30:30,268 INFO L78 Accepts]: Start accepts. Automaton has 11593 states and 13992 transitions. Word has length 217 [2018-07-24 01:30:30,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:30,268 INFO L471 AbstractCegarLoop]: Abstraction has 11593 states and 13992 transitions. [2018-07-24 01:30:30,268 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 01:30:30,269 INFO L276 IsEmpty]: Start isEmpty. Operand 11593 states and 13992 transitions. [2018-07-24 01:30:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-07-24 01:30:30,289 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:30,290 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:30,290 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:30,290 INFO L82 PathProgramCache]: Analyzing trace with hash 309411674, now seen corresponding path program 1 times [2018-07-24 01:30:30,290 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:30,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:30,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:30,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:30,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:30,508 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-07-24 01:30:30,508 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:30,509 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:30:30,509 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:30,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:30,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:30,510 INFO L87 Difference]: Start difference. First operand 11593 states and 13992 transitions. Second operand 3 states. [2018-07-24 01:30:32,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:32,154 INFO L93 Difference]: Finished difference Result 23154 states and 27951 transitions. [2018-07-24 01:30:32,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:32,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2018-07-24 01:30:32,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:32,193 INFO L225 Difference]: With dead ends: 23154 [2018-07-24 01:30:32,193 INFO L226 Difference]: Without dead ends: 11563 [2018-07-24 01:30:32,205 INFO L573 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 [2018-07-24 01:30:32,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11563 states. [2018-07-24 01:30:32,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11563 to 11560. [2018-07-24 01:30:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11560 states. [2018-07-24 01:30:32,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11560 states to 11560 states and 13363 transitions. [2018-07-24 01:30:32,384 INFO L78 Accepts]: Start accepts. Automaton has 11560 states and 13363 transitions. Word has length 246 [2018-07-24 01:30:32,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:32,385 INFO L471 AbstractCegarLoop]: Abstraction has 11560 states and 13363 transitions. [2018-07-24 01:30:32,385 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 11560 states and 13363 transitions. [2018-07-24 01:30:32,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-07-24 01:30:32,411 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:32,411 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:32,411 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:32,412 INFO L82 PathProgramCache]: Analyzing trace with hash -155094448, now seen corresponding path program 1 times [2018-07-24 01:30:32,412 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:32,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:32,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:32,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:32,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:32,595 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-24 01:30:32,595 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:32,595 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:30:32,596 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:30:32,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:30:32,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:32,596 INFO L87 Difference]: Start difference. First operand 11560 states and 13363 transitions. Second operand 4 states. [2018-07-24 01:30:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:35,325 INFO L93 Difference]: Finished difference Result 46152 states and 53338 transitions. [2018-07-24 01:30:35,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:30:35,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 257 [2018-07-24 01:30:35,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:35,389 INFO L225 Difference]: With dead ends: 46152 [2018-07-24 01:30:35,389 INFO L226 Difference]: Without dead ends: 34594 [2018-07-24 01:30:35,406 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:35,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34594 states. [2018-07-24 01:30:35,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34594 to 34590. [2018-07-24 01:30:35,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34590 states. [2018-07-24 01:30:35,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34590 states to 34590 states and 39767 transitions. [2018-07-24 01:30:35,918 INFO L78 Accepts]: Start accepts. Automaton has 34590 states and 39767 transitions. Word has length 257 [2018-07-24 01:30:35,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:35,918 INFO L471 AbstractCegarLoop]: Abstraction has 34590 states and 39767 transitions. [2018-07-24 01:30:35,918 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:30:35,919 INFO L276 IsEmpty]: Start isEmpty. Operand 34590 states and 39767 transitions. [2018-07-24 01:30:35,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-07-24 01:30:35,937 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:35,938 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:35,938 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:35,938 INFO L82 PathProgramCache]: Analyzing trace with hash -230806498, now seen corresponding path program 1 times [2018-07-24 01:30:35,938 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:35,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:35,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:35,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:35,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:36,427 WARN L169 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-07-24 01:30:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:30:36,480 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:36,481 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:30:36,481 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:30:36,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:30:36,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:36,482 INFO L87 Difference]: Start difference. First operand 34590 states and 39767 transitions. Second operand 4 states. [2018-07-24 01:30:38,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:38,775 INFO L93 Difference]: Finished difference Result 84204 states and 96384 transitions. [2018-07-24 01:30:38,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:30:38,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2018-07-24 01:30:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:38,880 INFO L225 Difference]: With dead ends: 84204 [2018-07-24 01:30:38,880 INFO L226 Difference]: Without dead ends: 49616 [2018-07-24 01:30:38,924 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:38,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49616 states. [2018-07-24 01:30:39,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49616 to 39718. [2018-07-24 01:30:39,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39718 states. [2018-07-24 01:30:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39718 states to 39718 states and 45221 transitions. [2018-07-24 01:30:39,794 INFO L78 Accepts]: Start accepts. Automaton has 39718 states and 45221 transitions. Word has length 262 [2018-07-24 01:30:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:39,794 INFO L471 AbstractCegarLoop]: Abstraction has 39718 states and 45221 transitions. [2018-07-24 01:30:39,795 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:30:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 39718 states and 45221 transitions. [2018-07-24 01:30:39,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-07-24 01:30:39,818 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:39,818 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:39,818 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:39,819 INFO L82 PathProgramCache]: Analyzing trace with hash -939264822, now seen corresponding path program 1 times [2018-07-24 01:30:39,819 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:39,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:39,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:39,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:39,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:30:40,092 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:40,092 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:30:40,092 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:30:40,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:30:40,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:40,093 INFO L87 Difference]: Start difference. First operand 39718 states and 45221 transitions. Second operand 4 states. [2018-07-24 01:30:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:42,249 INFO L93 Difference]: Finished difference Result 86844 states and 99036 transitions. [2018-07-24 01:30:42,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:30:42,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2018-07-24 01:30:42,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:42,307 INFO L225 Difference]: With dead ends: 86844 [2018-07-24 01:30:42,307 INFO L226 Difference]: Without dead ends: 47128 [2018-07-24 01:30:42,342 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:42,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47128 states. [2018-07-24 01:30:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47128 to 42780. [2018-07-24 01:30:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42780 states. [2018-07-24 01:30:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42780 states to 42780 states and 48508 transitions. [2018-07-24 01:30:42,826 INFO L78 Accepts]: Start accepts. Automaton has 42780 states and 48508 transitions. Word has length 270 [2018-07-24 01:30:42,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:42,827 INFO L471 AbstractCegarLoop]: Abstraction has 42780 states and 48508 transitions. [2018-07-24 01:30:42,827 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:30:42,827 INFO L276 IsEmpty]: Start isEmpty. Operand 42780 states and 48508 transitions. [2018-07-24 01:30:42,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-07-24 01:30:42,848 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:42,848 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:42,848 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:42,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1927481521, now seen corresponding path program 1 times [2018-07-24 01:30:42,849 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:42,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:42,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:42,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:42,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:30:43,538 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:43,538 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 01:30:43,539 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 01:30:43,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 01:30:43,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-07-24 01:30:43,539 INFO L87 Difference]: Start difference. First operand 42780 states and 48508 transitions. Second operand 6 states. [2018-07-24 01:30:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:47,656 INFO L93 Difference]: Finished difference Result 182332 states and 205114 transitions. [2018-07-24 01:30:47,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-24 01:30:47,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 279 [2018-07-24 01:30:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:47,823 INFO L225 Difference]: With dead ends: 182332 [2018-07-24 01:30:47,823 INFO L226 Difference]: Without dead ends: 139554 [2018-07-24 01:30:47,874 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-07-24 01:30:47,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139554 states. [2018-07-24 01:30:49,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139554 to 137904. [2018-07-24 01:30:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137904 states. [2018-07-24 01:30:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137904 states to 137904 states and 152242 transitions. [2018-07-24 01:30:49,778 INFO L78 Accepts]: Start accepts. Automaton has 137904 states and 152242 transitions. Word has length 279 [2018-07-24 01:30:49,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:49,778 INFO L471 AbstractCegarLoop]: Abstraction has 137904 states and 152242 transitions. [2018-07-24 01:30:49,778 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 01:30:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 137904 states and 152242 transitions. [2018-07-24 01:30:49,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-07-24 01:30:49,815 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:49,815 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:49,815 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:49,816 INFO L82 PathProgramCache]: Analyzing trace with hash 942005520, now seen corresponding path program 1 times [2018-07-24 01:30:49,816 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:49,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:49,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:49,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:49,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:50,061 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-07-24 01:30:50,061 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:50,061 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:30:50,062 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:50,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:50,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:50,063 INFO L87 Difference]: Start difference. First operand 137904 states and 152242 transitions. Second operand 3 states. [2018-07-24 01:30:52,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:52,750 INFO L93 Difference]: Finished difference Result 366258 states and 403017 transitions. [2018-07-24 01:30:52,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:52,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 346 [2018-07-24 01:30:52,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:53,011 INFO L225 Difference]: With dead ends: 366258 [2018-07-24 01:30:53,011 INFO L226 Difference]: Without dead ends: 228356 [2018-07-24 01:30:53,105 INFO L573 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 [2018-07-24 01:30:53,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228356 states. [2018-07-24 01:30:56,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228356 to 228249. [2018-07-24 01:30:56,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228249 states. [2018-07-24 01:30:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228249 states to 228249 states and 248794 transitions. [2018-07-24 01:30:56,577 INFO L78 Accepts]: Start accepts. Automaton has 228249 states and 248794 transitions. Word has length 346 [2018-07-24 01:30:56,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:56,578 INFO L471 AbstractCegarLoop]: Abstraction has 228249 states and 248794 transitions. [2018-07-24 01:30:56,578 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand 228249 states and 248794 transitions. [2018-07-24 01:30:56,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-07-24 01:30:56,620 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:56,620 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:56,621 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:56,621 INFO L82 PathProgramCache]: Analyzing trace with hash 537598670, now seen corresponding path program 1 times [2018-07-24 01:30:56,621 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:56,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:56,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:56,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:56,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:58,424 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-07-24 01:30:58,425 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:58,425 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:30:58,426 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:30:58,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:30:58,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:58,426 INFO L87 Difference]: Start difference. First operand 228249 states and 248794 transitions. Second operand 4 states. [2018-07-24 01:31:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:31:02,927 INFO L93 Difference]: Finished difference Result 478061 states and 524470 transitions. [2018-07-24 01:31:02,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:31:02,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 358 [2018-07-24 01:31:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:31:03,231 INFO L225 Difference]: With dead ends: 478061 [2018-07-24 01:31:03,231 INFO L226 Difference]: Without dead ends: 249814 [2018-07-24 01:31:03,356 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:31:03,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249814 states. [2018-07-24 01:31:07,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249814 to 237964. [2018-07-24 01:31:07,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237964 states. [2018-07-24 01:31:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237964 states to 237964 states and 258704 transitions. [2018-07-24 01:31:15,278 INFO L78 Accepts]: Start accepts. Automaton has 237964 states and 258704 transitions. Word has length 358 [2018-07-24 01:31:15,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:31:15,279 INFO L471 AbstractCegarLoop]: Abstraction has 237964 states and 258704 transitions. [2018-07-24 01:31:15,279 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:31:15,279 INFO L276 IsEmpty]: Start isEmpty. Operand 237964 states and 258704 transitions. [2018-07-24 01:31:15,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-07-24 01:31:15,324 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:31:15,324 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:31:15,324 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:31:15,325 INFO L82 PathProgramCache]: Analyzing trace with hash -335858310, now seen corresponding path program 1 times [2018-07-24 01:31:15,325 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:31:15,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:31:15,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:15,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:31:15,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:31:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-07-24 01:31:15,673 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:31:15,673 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:31:15,674 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:31:15,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:31:15,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:31:15,675 INFO L87 Difference]: Start difference. First operand 237964 states and 258704 transitions. Second operand 3 states. [2018-07-24 01:31:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:31:18,161 INFO L93 Difference]: Finished difference Result 628911 states and 683238 transitions. [2018-07-24 01:31:18,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:31:18,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 383 [2018-07-24 01:31:18,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:31:18,599 INFO L225 Difference]: With dead ends: 628911 [2018-07-24 01:31:18,599 INFO L226 Difference]: Without dead ends: 390949 [2018-07-24 01:31:18,740 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:31:18,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390949 states. [2018-07-24 01:31:25,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390949 to 390935. [2018-07-24 01:31:25,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390935 states. [2018-07-24 01:31:25,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390935 states to 390935 states and 424420 transitions. [2018-07-24 01:31:25,554 INFO L78 Accepts]: Start accepts. Automaton has 390935 states and 424420 transitions. Word has length 383 [2018-07-24 01:31:25,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:31:25,554 INFO L471 AbstractCegarLoop]: Abstraction has 390935 states and 424420 transitions. [2018-07-24 01:31:25,554 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:31:25,554 INFO L276 IsEmpty]: Start isEmpty. Operand 390935 states and 424420 transitions. [2018-07-24 01:31:25,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-07-24 01:31:25,594 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:31:25,594 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:31:25,594 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:31:25,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1383924347, now seen corresponding path program 1 times [2018-07-24 01:31:25,595 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:31:25,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:31:25,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:25,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:31:25,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:31:25,868 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-07-24 01:31:25,868 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:31:25,868 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:31:25,869 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:31:25,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:31:25,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:31:25,869 INFO L87 Difference]: Start difference. First operand 390935 states and 424420 transitions. Second operand 3 states. [2018-07-24 01:31:30,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:31:30,127 INFO L93 Difference]: Finished difference Result 781856 states and 848826 transitions. [2018-07-24 01:31:30,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:31:30,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 390 [2018-07-24 01:31:30,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:31:30,619 INFO L225 Difference]: With dead ends: 781856 [2018-07-24 01:31:30,619 INFO L226 Difference]: Without dead ends: 390923 [2018-07-24 01:31:30,780 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:31:31,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390923 states. [2018-07-24 01:31:37,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390923 to 390923. [2018-07-24 01:31:37,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390923 states. [2018-07-24 01:31:38,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390923 states to 390923 states and 424396 transitions. [2018-07-24 01:31:38,861 INFO L78 Accepts]: Start accepts. Automaton has 390923 states and 424396 transitions. Word has length 390 [2018-07-24 01:31:38,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:31:38,861 INFO L471 AbstractCegarLoop]: Abstraction has 390923 states and 424396 transitions. [2018-07-24 01:31:38,861 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:31:38,861 INFO L276 IsEmpty]: Start isEmpty. Operand 390923 states and 424396 transitions. [2018-07-24 01:31:38,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-07-24 01:31:38,915 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:31:38,915 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:31:38,915 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:31:38,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1020088977, now seen corresponding path program 1 times [2018-07-24 01:31:38,915 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:31:38,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:31:38,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:38,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:31:38,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:31:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-07-24 01:31:39,280 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:31:39,280 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:31:39,281 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:31:39,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:31:39,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:31:39,282 INFO L87 Difference]: Start difference. First operand 390923 states and 424396 transitions. Second operand 4 states. [2018-07-24 01:31:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:31:49,600 INFO L93 Difference]: Finished difference Result 811822 states and 881308 transitions. [2018-07-24 01:31:49,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:31:49,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 406 [2018-07-24 01:31:49,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:31:50,350 INFO L225 Difference]: With dead ends: 811822 [2018-07-24 01:31:50,350 INFO L226 Difference]: Without dead ends: 420901 [2018-07-24 01:31:50,632 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:31:51,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420901 states. [2018-07-24 01:31:57,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420901 to 415383. [2018-07-24 01:31:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415383 states. [2018-07-24 01:31:57,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415383 states to 415383 states and 448361 transitions. [2018-07-24 01:31:57,994 INFO L78 Accepts]: Start accepts. Automaton has 415383 states and 448361 transitions. Word has length 406 [2018-07-24 01:31:57,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:31:57,994 INFO L471 AbstractCegarLoop]: Abstraction has 415383 states and 448361 transitions. [2018-07-24 01:31:57,994 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:31:57,994 INFO L276 IsEmpty]: Start isEmpty. Operand 415383 states and 448361 transitions. [2018-07-24 01:31:58,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-07-24 01:31:58,038 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:31:58,038 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:31:58,038 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:31:58,039 INFO L82 PathProgramCache]: Analyzing trace with hash 763210218, now seen corresponding path program 1 times [2018-07-24 01:31:58,039 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:31:58,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:31:58,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:58,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:31:58,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:31:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-07-24 01:31:58,319 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:31:58,319 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:31:58,320 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:31:58,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:31:58,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:31:58,320 INFO L87 Difference]: Start difference. First operand 415383 states and 448361 transitions. Second operand 3 states. [2018-07-24 01:32:03,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:32:03,524 INFO L93 Difference]: Finished difference Result 795388 states and 859468 transitions. [2018-07-24 01:32:03,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:32:03,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2018-07-24 01:32:03,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:32:03,988 INFO L225 Difference]: With dead ends: 795388 [2018-07-24 01:32:03,989 INFO L226 Difference]: Without dead ends: 380007 [2018-07-24 01:32:04,167 INFO L573 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 [2018-07-24 01:32:04,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380007 states. [2018-07-24 01:32:10,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380007 to 379954. [2018-07-24 01:32:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379954 states. [2018-07-24 01:32:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379954 states to 379954 states and 405899 transitions. [2018-07-24 01:32:11,615 INFO L78 Accepts]: Start accepts. Automaton has 379954 states and 405899 transitions. Word has length 418 [2018-07-24 01:32:11,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:32:11,615 INFO L471 AbstractCegarLoop]: Abstraction has 379954 states and 405899 transitions. [2018-07-24 01:32:11,616 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:32:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 379954 states and 405899 transitions. [2018-07-24 01:32:11,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-07-24 01:32:11,675 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:32:11,675 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:32:11,676 INFO L414 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:32:11,676 INFO L82 PathProgramCache]: Analyzing trace with hash -348255370, now seen corresponding path program 1 times [2018-07-24 01:32:11,676 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:32:11,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:32:11,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:32:11,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:32:11,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:32:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:32:12,069 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-07-24 01:32:12,070 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:32:12,070 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:32:12,070 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:32:12,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:32:12,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:32:12,071 INFO L87 Difference]: Start difference. First operand 379954 states and 405899 transitions. Second operand 4 states. [2018-07-24 01:32:20,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:32:20,480 INFO L93 Difference]: Finished difference Result 674514 states and 718874 transitions. [2018-07-24 01:32:20,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:32:20,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 436 [2018-07-24 01:32:20,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:32:20,877 INFO L225 Difference]: With dead ends: 674514 [2018-07-24 01:32:20,877 INFO L226 Difference]: Without dead ends: 294562 [2018-07-24 01:32:21,031 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:32:21,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294562 states. [2018-07-24 01:32:25,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294562 to 292522. [2018-07-24 01:32:25,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292522 states. [2018-07-24 01:32:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292522 states to 292522 states and 309940 transitions. [2018-07-24 01:32:25,700 INFO L78 Accepts]: Start accepts. Automaton has 292522 states and 309940 transitions. Word has length 436 [2018-07-24 01:32:25,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:32:25,701 INFO L471 AbstractCegarLoop]: Abstraction has 292522 states and 309940 transitions. [2018-07-24 01:32:25,701 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:32:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 292522 states and 309940 transitions. [2018-07-24 01:32:25,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-07-24 01:32:25,745 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:32:25,745 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:32:25,746 INFO L414 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:32:25,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1455984900, now seen corresponding path program 1 times [2018-07-24 01:32:25,746 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:32:25,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:32:25,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:32:25,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:32:25,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:32:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:32:26,077 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-07-24 01:32:26,077 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:32:26,078 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:32:26,078 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:32:26,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:32:26,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:32:26,079 INFO L87 Difference]: Start difference. First operand 292522 states and 309940 transitions. Second operand 3 states. [2018-07-24 01:32:30,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:32:30,114 INFO L93 Difference]: Finished difference Result 579517 states and 613943 transitions. [2018-07-24 01:32:30,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:32:30,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 446 [2018-07-24 01:32:30,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:32:30,455 INFO L225 Difference]: With dead ends: 579517 [2018-07-24 01:32:30,455 INFO L226 Difference]: Without dead ends: 286997 [2018-07-24 01:32:30,576 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:32:30,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286997 states. [2018-07-24 01:32:34,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286997 to 276987. [2018-07-24 01:32:34,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276987 states. [2018-07-24 01:32:36,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276987 states to 276987 states and 290952 transitions. [2018-07-24 01:32:36,063 INFO L78 Accepts]: Start accepts. Automaton has 276987 states and 290952 transitions. Word has length 446 [2018-07-24 01:32:36,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:32:36,063 INFO L471 AbstractCegarLoop]: Abstraction has 276987 states and 290952 transitions. [2018-07-24 01:32:36,063 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:32:36,063 INFO L276 IsEmpty]: Start isEmpty. Operand 276987 states and 290952 transitions. [2018-07-24 01:32:36,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2018-07-24 01:32:36,114 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:32:36,115 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:32:36,115 INFO L414 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:32:36,115 INFO L82 PathProgramCache]: Analyzing trace with hash 730904459, now seen corresponding path program 1 times [2018-07-24 01:32:36,115 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:32:36,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:32:36,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:32:36,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:32:36,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:32:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:32:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-07-24 01:32:36,435 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:32:36,435 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:32:36,436 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:32:36,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:32:36,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:32:36,436 INFO L87 Difference]: Start difference. First operand 276987 states and 290952 transitions. Second operand 3 states. [2018-07-24 01:32:39,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:32:39,106 INFO L93 Difference]: Finished difference Result 487059 states and 513074 transitions. [2018-07-24 01:32:39,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:32:39,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 456 [2018-07-24 01:32:39,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:32:39,377 INFO L225 Difference]: With dead ends: 487059 [2018-07-24 01:32:39,377 INFO L226 Difference]: Without dead ends: 210074 [2018-07-24 01:32:39,517 INFO L573 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 [2018-07-24 01:32:39,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210074 states. [2018-07-24 01:32:44,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210074 to 210002. [2018-07-24 01:32:44,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210002 states. [2018-07-24 01:32:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210002 states to 210002 states and 220581 transitions. [2018-07-24 01:32:44,243 INFO L78 Accepts]: Start accepts. Automaton has 210002 states and 220581 transitions. Word has length 456 [2018-07-24 01:32:44,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:32:44,243 INFO L471 AbstractCegarLoop]: Abstraction has 210002 states and 220581 transitions. [2018-07-24 01:32:44,243 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:32:44,243 INFO L276 IsEmpty]: Start isEmpty. Operand 210002 states and 220581 transitions. [2018-07-24 01:32:44,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2018-07-24 01:32:44,291 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:32:44,291 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:32:44,292 INFO L414 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:32:44,292 INFO L82 PathProgramCache]: Analyzing trace with hash -947397569, now seen corresponding path program 1 times [2018-07-24 01:32:44,292 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:32:44,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:32:44,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:32:44,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:32:44,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:32:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:32:44,765 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-07-24 01:32:44,765 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:32:44,765 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:32:44,766 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 01:32:44,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 01:32:44,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:32:44,766 INFO L87 Difference]: Start difference. First operand 210002 states and 220581 transitions. Second operand 5 states. [2018-07-24 01:32:48,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:32:48,769 INFO L93 Difference]: Finished difference Result 547901 states and 574681 transitions. [2018-07-24 01:32:48,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:32:48,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 458 [2018-07-24 01:32:48,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:32:49,130 INFO L225 Difference]: With dead ends: 547901 [2018-07-24 01:32:49,131 INFO L226 Difference]: Without dead ends: 337901 [2018-07-24 01:32:49,243 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:32:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337901 states. [2018-07-24 01:32:53,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337901 to 302667. [2018-07-24 01:32:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302667 states. [2018-07-24 01:32:53,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302667 states to 302667 states and 317859 transitions. [2018-07-24 01:32:53,717 INFO L78 Accepts]: Start accepts. Automaton has 302667 states and 317859 transitions. Word has length 458 [2018-07-24 01:32:53,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:32:53,717 INFO L471 AbstractCegarLoop]: Abstraction has 302667 states and 317859 transitions. [2018-07-24 01:32:53,717 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 01:32:53,717 INFO L276 IsEmpty]: Start isEmpty. Operand 302667 states and 317859 transitions. [2018-07-24 01:32:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-07-24 01:32:53,746 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:32:53,746 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:32:53,746 INFO L414 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:32:53,746 INFO L82 PathProgramCache]: Analyzing trace with hash 264322023, now seen corresponding path program 1 times [2018-07-24 01:32:53,747 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:32:53,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:32:53,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:32:53,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:32:53,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:32:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:32:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 380 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-07-24 01:32:58,542 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:32:58,542 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:32:58,543 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:32:58,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:32:58,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:32:58,543 INFO L87 Difference]: Start difference. First operand 302667 states and 317859 transitions. Second operand 4 states. [2018-07-24 01:33:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:33:03,548 INFO L93 Difference]: Finished difference Result 776070 states and 815940 transitions. [2018-07-24 01:33:03,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:33:03,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 467 [2018-07-24 01:33:03,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:33:04,118 INFO L225 Difference]: With dead ends: 776070 [2018-07-24 01:33:04,118 INFO L226 Difference]: Without dead ends: 473405 [2018-07-24 01:33:04,248 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:33:04,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473405 states. [2018-07-24 01:33:10,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473405 to 433495. [2018-07-24 01:33:10,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433495 states. [2018-07-24 01:33:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433495 states to 433495 states and 455989 transitions. [2018-07-24 01:33:10,988 INFO L78 Accepts]: Start accepts. Automaton has 433495 states and 455989 transitions. Word has length 467 [2018-07-24 01:33:10,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:33:10,988 INFO L471 AbstractCegarLoop]: Abstraction has 433495 states and 455989 transitions. [2018-07-24 01:33:10,988 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:33:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 433495 states and 455989 transitions. [2018-07-24 01:33:11,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-07-24 01:33:11,017 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:33:11,017 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:33:11,018 INFO L414 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:33:11,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1451314138, now seen corresponding path program 1 times [2018-07-24 01:33:11,018 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:33:11,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:33:11,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:33:11,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:33:11,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:33:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:33:13,938 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 296 proven. 209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:33:13,939 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:33:13,939 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 01:33:13,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:33:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:33:14,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:33:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-07-24 01:33:14,531 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 01:33:14,531 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [16] total 19 [2018-07-24 01:33:14,532 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-24 01:33:14,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-24 01:33:14,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-07-24 01:33:14,533 INFO L87 Difference]: Start difference. First operand 433495 states and 455989 transitions. Second operand 19 states. [2018-07-24 01:33:14,980 WARN L169 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 32 [2018-07-24 01:33:15,809 WARN L169 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 23 [2018-07-24 01:33:19,935 WARN L169 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2018-07-24 01:33:25,172 WARN L169 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 Received shutdown request... [2018-07-24 01:33:25,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-24 01:33:25,309 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-24 01:33:25,315 WARN L202 ceAbstractionStarter]: Timeout [2018-07-24 01:33:25,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 01:33:25 BoogieIcfgContainer [2018-07-24 01:33:25,316 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 01:33:25,316 INFO L168 Benchmark]: Toolchain (without parser) took 205266.47 ms. Allocated memory was 1.5 GB in the beginning and 5.7 GB in the end (delta: 4.1 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-07-24 01:33:25,317 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 01:33:25,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1124.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-07-24 01:33:25,318 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-24 01:33:25,319 INFO L168 Benchmark]: Boogie Preprocessor took 399.20 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 820.0 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -962.6 MB). Peak memory consumption was 60.8 MB. Max. memory is 7.1 GB. [2018-07-24 01:33:25,320 INFO L168 Benchmark]: RCFGBuilder took 5442.71 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 284.8 MB). Peak memory consumption was 284.8 MB. Max. memory is 7.1 GB. [2018-07-24 01:33:25,321 INFO L168 Benchmark]: TraceAbstraction took 198148.31 ms. Allocated memory was 2.4 GB in the beginning and 5.7 GB in the end (delta: 3.3 GB). Free memory was 2.0 GB in the beginning and 3.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-07-24 01:33:25,325 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1124.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 143.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 399.20 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 820.0 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -962.6 MB). Peak memory consumption was 60.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5442.71 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 284.8 MB). Peak memory consumption was 284.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 198148.31 ms. Allocated memory was 2.4 GB in the beginning and 5.7 GB in the end (delta: 3.3 GB). Free memory was 2.0 GB in the beginning and 3.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1626]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1626). Cancelled while BasicCegarLoop was constructing difference of abstraction (433495states) and interpolant automaton (currently 30 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (6976 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 198.0s OverallTime, 23 OverallIterations, 7 TraceHistogramMax, 103.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6225 SDtfs, 17795 SDslu, 3215 SDs, 0 SdLazy, 24892 SolverSat, 4885 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 827 GetRequests, 739 SyntacticMatches, 5 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 10.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=433495occurred in iteration=22, 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: 75.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 123888 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 8289 NumberOfCodeBlocks, 8289 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 8264 ConstructedInterpolants, 0 QuantifiedInterpolants, 9337888 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1168 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 25 InterpolantComputations, 23 PerfectInterpolantSequences, 5471/5684 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem03_label47_true-unreach-call.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_01-33-25-339.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem03_label47_true-unreach-call.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_01-33-25-339.csv Completed graceful shutdown