java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem12_label34.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 18:57:13,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 18:57:13,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 18:57:13,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 18:57:13,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 18:57:13,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 18:57:13,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 18:57:13,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 18:57:13,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 18:57:13,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 18:57:13,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 18:57:13,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 18:57:13,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 18:57:13,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 18:57:13,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 18:57:13,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 18:57:13,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 18:57:13,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 18:57:13,370 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 18:57:13,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 18:57:13,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 18:57:13,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 18:57:13,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 18:57:13,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 18:57:13,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 18:57:13,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 18:57:13,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 18:57:13,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 18:57:13,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 18:57:13,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 18:57:13,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 18:57:13,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 18:57:13,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 18:57:13,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 18:57:13,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 18:57:13,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 18:57:13,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 18:57:13,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 18:57:13,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 18:57:13,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 18:57:13,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 18:57:13,400 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 18:57:13,427 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 18:57:13,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 18:57:13,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 18:57:13,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 18:57:13,429 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 18:57:13,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 18:57:13,430 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 18:57:13,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 18:57:13,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 18:57:13,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 18:57:13,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 18:57:13,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 18:57:13,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 18:57:13,431 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 18:57:13,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 18:57:13,432 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 18:57:13,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 18:57:13,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 18:57:13,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 18:57:13,432 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 18:57:13,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 18:57:13,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 18:57:13,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 18:57:13,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 18:57:13,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 18:57:13,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 18:57:13,434 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 18:57:13,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 18:57:13,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 18:57:13,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 18:57:13,476 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 18:57:13,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 18:57:13,481 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 18:57:13,481 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 18:57:13,482 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label34.c [2019-09-07 18:57:13,546 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ff9e2994/900cd5db4ff04be691dd3717146f8d32/FLAG96e2cd7f9 [2019-09-07 18:57:14,309 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 18:57:14,310 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label34.c [2019-09-07 18:57:14,348 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ff9e2994/900cd5db4ff04be691dd3717146f8d32/FLAG96e2cd7f9 [2019-09-07 18:57:14,865 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ff9e2994/900cd5db4ff04be691dd3717146f8d32 [2019-09-07 18:57:14,877 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 18:57:14,879 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 18:57:14,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 18:57:14,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 18:57:14,883 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 18:57:14,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:57:14" (1/1) ... [2019-09-07 18:57:14,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a8cf5fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:57:14, skipping insertion in model container [2019-09-07 18:57:14,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:57:14" (1/1) ... [2019-09-07 18:57:14,896 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 18:57:15,065 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 18:57:16,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:57:16,600 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 18:57:17,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:57:17,259 INFO L192 MainTranslator]: Completed translation [2019-09-07 18:57:17,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:57:17 WrapperNode [2019-09-07 18:57:17,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 18:57:17,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 18:57:17,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 18:57:17,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 18:57:17,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:57:17" (1/1) ... [2019-09-07 18:57:17,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:57:17" (1/1) ... [2019-09-07 18:57:17,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:57:17" (1/1) ... [2019-09-07 18:57:17,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:57:17" (1/1) ... [2019-09-07 18:57:17,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:57:17" (1/1) ... [2019-09-07 18:57:17,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:57:17" (1/1) ... [2019-09-07 18:57:17,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:57:17" (1/1) ... [2019-09-07 18:57:17,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 18:57:17,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 18:57:17,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 18:57:17,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 18:57:17,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:57:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 18:57:17,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 18:57:17,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 18:57:17,635 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 18:57:17,635 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 18:57:17,635 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 18:57:17,636 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 18:57:17,636 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 18:57:17,636 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 18:57:17,636 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 18:57:17,637 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 18:57:17,637 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 18:57:17,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 18:57:17,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 18:57:17,638 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 18:57:17,639 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 18:57:17,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 18:57:17,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 18:57:22,669 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 18:57:22,670 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 18:57:22,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:57:22 BoogieIcfgContainer [2019-09-07 18:57:22,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 18:57:22,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 18:57:22,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 18:57:22,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 18:57:22,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 06:57:14" (1/3) ... [2019-09-07 18:57:22,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104eee07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:57:22, skipping insertion in model container [2019-09-07 18:57:22,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:57:17" (2/3) ... [2019-09-07 18:57:22,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104eee07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:57:22, skipping insertion in model container [2019-09-07 18:57:22,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:57:22" (3/3) ... [2019-09-07 18:57:22,693 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem12_label34.c [2019-09-07 18:57:22,707 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 18:57:22,720 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 18:57:22,737 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 18:57:22,795 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 18:57:22,796 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 18:57:22,796 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 18:57:22,796 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 18:57:22,796 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 18:57:22,797 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 18:57:22,797 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 18:57:22,797 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 18:57:22,797 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 18:57:22,839 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states. [2019-09-07 18:57:22,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 18:57:22,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:57:22,847 INFO L399 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] [2019-09-07 18:57:22,849 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:57:22,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:57:22,856 INFO L82 PathProgramCache]: Analyzing trace with hash 522040021, now seen corresponding path program 1 times [2019-09-07 18:57:22,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:57:22,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:57:22,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:57:22,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:57:22,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:57:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:57:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:57:23,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:57:23,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:57:23,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:57:23,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:57:23,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:57:23,242 INFO L87 Difference]: Start difference. First operand 839 states. Second operand 4 states. [2019-09-07 18:57:32,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:57:32,326 INFO L93 Difference]: Finished difference Result 3230 states and 6251 transitions. [2019-09-07 18:57:32,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:57:32,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-09-07 18:57:32,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:57:32,360 INFO L225 Difference]: With dead ends: 3230 [2019-09-07 18:57:32,361 INFO L226 Difference]: Without dead ends: 2309 [2019-09-07 18:57:32,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:57:32,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2019-09-07 18:57:32,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2309. [2019-09-07 18:57:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2309 states. [2019-09-07 18:57:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 3821 transitions. [2019-09-07 18:57:32,554 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 3821 transitions. Word has length 22 [2019-09-07 18:57:32,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:57:32,555 INFO L475 AbstractCegarLoop]: Abstraction has 2309 states and 3821 transitions. [2019-09-07 18:57:32,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:57:32,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3821 transitions. [2019-09-07 18:57:32,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-07 18:57:32,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:57:32,562 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 18:57:32,562 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:57:32,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:57:32,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1075541555, now seen corresponding path program 1 times [2019-09-07 18:57:32,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:57:32,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:57:32,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:57:32,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:57:32,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:57:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:57:32,878 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:57:32,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:57:32,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 18:57:32,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:57:32,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:57:32,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:57:32,882 INFO L87 Difference]: Start difference. First operand 2309 states and 3821 transitions. Second operand 6 states. [2019-09-07 18:57:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:57:39,591 INFO L93 Difference]: Finished difference Result 7045 states and 11809 transitions. [2019-09-07 18:57:39,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:57:39,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-09-07 18:57:39,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:57:39,629 INFO L225 Difference]: With dead ends: 7045 [2019-09-07 18:57:39,629 INFO L226 Difference]: Without dead ends: 4742 [2019-09-07 18:57:39,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:57:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4742 states. [2019-09-07 18:57:39,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4742 to 4697. [2019-09-07 18:57:39,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4697 states. [2019-09-07 18:57:39,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4697 states to 4697 states and 7461 transitions. [2019-09-07 18:57:39,782 INFO L78 Accepts]: Start accepts. Automaton has 4697 states and 7461 transitions. Word has length 121 [2019-09-07 18:57:39,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:57:39,783 INFO L475 AbstractCegarLoop]: Abstraction has 4697 states and 7461 transitions. [2019-09-07 18:57:39,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:57:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 4697 states and 7461 transitions. [2019-09-07 18:57:39,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-07 18:57:39,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:57:39,789 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 18:57:39,790 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:57:39,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:57:39,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1846881353, now seen corresponding path program 1 times [2019-09-07 18:57:39,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:57:39,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:57:39,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:57:39,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:57:39,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:57:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:57:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:57:40,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:57:40,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:57:40,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:57:40,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:57:40,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:57:40,044 INFO L87 Difference]: Start difference. First operand 4697 states and 7461 transitions. Second operand 4 states. [2019-09-07 18:57:47,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:57:47,406 INFO L93 Difference]: Finished difference Result 18736 states and 30965 transitions. [2019-09-07 18:57:47,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:57:47,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-09-07 18:57:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:57:47,481 INFO L225 Difference]: With dead ends: 18736 [2019-09-07 18:57:47,484 INFO L226 Difference]: Without dead ends: 14045 [2019-09-07 18:57:47,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:57:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14045 states. [2019-09-07 18:57:47,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14045 to 14045. [2019-09-07 18:57:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14045 states. [2019-09-07 18:57:47,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14045 states to 14045 states and 22265 transitions. [2019-09-07 18:57:47,869 INFO L78 Accepts]: Start accepts. Automaton has 14045 states and 22265 transitions. Word has length 171 [2019-09-07 18:57:47,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:57:47,870 INFO L475 AbstractCegarLoop]: Abstraction has 14045 states and 22265 transitions. [2019-09-07 18:57:47,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:57:47,871 INFO L276 IsEmpty]: Start isEmpty. Operand 14045 states and 22265 transitions. [2019-09-07 18:57:47,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-07 18:57:47,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:57:47,882 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:57:47,882 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:57:47,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:57:47,883 INFO L82 PathProgramCache]: Analyzing trace with hash -683919979, now seen corresponding path program 1 times [2019-09-07 18:57:47,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:57:47,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:57:47,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:57:47,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:57:47,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:57:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:57:48,092 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-07 18:57:48,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:57:48,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:57:48,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:57:48,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:57:48,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:57:48,095 INFO L87 Difference]: Start difference. First operand 14045 states and 22265 transitions. Second operand 4 states. [2019-09-07 18:57:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:57:56,456 INFO L93 Difference]: Finished difference Result 55176 states and 92902 transitions. [2019-09-07 18:57:56,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:57:56,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288 [2019-09-07 18:57:56,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:57:56,660 INFO L225 Difference]: With dead ends: 55176 [2019-09-07 18:57:56,661 INFO L226 Difference]: Without dead ends: 41137 [2019-09-07 18:57:56,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:57:56,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41137 states. [2019-09-07 18:57:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41137 to 41137. [2019-09-07 18:57:58,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41137 states. [2019-09-07 18:57:58,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41137 states to 41137 states and 62836 transitions. [2019-09-07 18:57:58,981 INFO L78 Accepts]: Start accepts. Automaton has 41137 states and 62836 transitions. Word has length 288 [2019-09-07 18:57:58,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:57:58,982 INFO L475 AbstractCegarLoop]: Abstraction has 41137 states and 62836 transitions. [2019-09-07 18:57:58,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:57:58,982 INFO L276 IsEmpty]: Start isEmpty. Operand 41137 states and 62836 transitions. [2019-09-07 18:57:59,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-07 18:57:59,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:57:59,004 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:57:59,005 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:57:59,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:57:59,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1672067616, now seen corresponding path program 1 times [2019-09-07 18:57:59,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:57:59,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:57:59,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:57:59,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:57:59,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:57:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:57:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:57:59,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:57:59,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 18:57:59,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 18:57:59,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 18:57:59,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 18:57:59,340 INFO L87 Difference]: Start difference. First operand 41137 states and 62836 transitions. Second operand 5 states. [2019-09-07 18:58:07,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:58:07,952 INFO L93 Difference]: Finished difference Result 119534 states and 194638 transitions. [2019-09-07 18:58:07,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:58:07,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 290 [2019-09-07 18:58:07,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:58:08,294 INFO L225 Difference]: With dead ends: 119534 [2019-09-07 18:58:08,295 INFO L226 Difference]: Without dead ends: 78403 [2019-09-07 18:58:08,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 18:58:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78403 states. [2019-09-07 18:58:10,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78403 to 74409. [2019-09-07 18:58:10,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74409 states. [2019-09-07 18:58:10,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74409 states to 74409 states and 112685 transitions. [2019-09-07 18:58:10,344 INFO L78 Accepts]: Start accepts. Automaton has 74409 states and 112685 transitions. Word has length 290 [2019-09-07 18:58:10,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:58:10,345 INFO L475 AbstractCegarLoop]: Abstraction has 74409 states and 112685 transitions. [2019-09-07 18:58:10,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 18:58:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand 74409 states and 112685 transitions. [2019-09-07 18:58:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-07 18:58:10,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:58:10,385 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:58:10,385 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:58:10,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:58:10,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1894233047, now seen corresponding path program 1 times [2019-09-07 18:58:10,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:58:10,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:58:10,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:58:10,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:58:10,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:58:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:58:10,705 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 30 proven. 98 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 18:58:10,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:58:10,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:58:10,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:58:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:58:10,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 18:58:10,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:58:11,129 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 18:58:11,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:58:11,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 18:58:11,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:58:11,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:58:11,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:58:11,137 INFO L87 Difference]: Start difference. First operand 74409 states and 112685 transitions. Second operand 9 states. [2019-09-07 18:58:22,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:58:22,395 INFO L93 Difference]: Finished difference Result 183006 states and 287727 transitions. [2019-09-07 18:58:22,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 18:58:22,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 392 [2019-09-07 18:58:22,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:58:22,970 INFO L225 Difference]: With dead ends: 183006 [2019-09-07 18:58:22,970 INFO L226 Difference]: Without dead ends: 108603 [2019-09-07 18:58:25,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 397 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 18:58:25,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108603 states. [2019-09-07 18:58:29,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108603 to 102282. [2019-09-07 18:58:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102282 states. [2019-09-07 18:58:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102282 states to 102282 states and 147580 transitions. [2019-09-07 18:58:29,311 INFO L78 Accepts]: Start accepts. Automaton has 102282 states and 147580 transitions. Word has length 392 [2019-09-07 18:58:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:58:29,321 INFO L475 AbstractCegarLoop]: Abstraction has 102282 states and 147580 transitions. [2019-09-07 18:58:29,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:58:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 102282 states and 147580 transitions. [2019-09-07 18:58:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-07 18:58:29,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:58:29,361 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:58:29,361 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:58:29,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:58:29,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1722421333, now seen corresponding path program 1 times [2019-09-07 18:58:29,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:58:29,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:58:29,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:58:29,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:58:29,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:58:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:58:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 30 proven. 104 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 18:58:29,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:58:29,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:58:29,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:58:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:58:29,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 18:58:29,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:58:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 18:58:30,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:58:30,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 18:58:30,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:58:30,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:58:30,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:58:30,224 INFO L87 Difference]: Start difference. First operand 102282 states and 147580 transitions. Second operand 9 states. [2019-09-07 18:58:39,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:58:39,561 INFO L93 Difference]: Finished difference Result 207381 states and 314452 transitions. [2019-09-07 18:58:39,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 18:58:39,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 398 [2019-09-07 18:58:39,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:58:40,073 INFO L225 Difference]: With dead ends: 207381 [2019-09-07 18:58:40,073 INFO L226 Difference]: Without dead ends: 105105 [2019-09-07 18:58:40,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-09-07 18:58:40,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105105 states. [2019-09-07 18:58:42,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105105 to 103834. [2019-09-07 18:58:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103834 states. [2019-09-07 18:58:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103834 states to 103834 states and 147144 transitions. [2019-09-07 18:58:46,767 INFO L78 Accepts]: Start accepts. Automaton has 103834 states and 147144 transitions. Word has length 398 [2019-09-07 18:58:46,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:58:46,767 INFO L475 AbstractCegarLoop]: Abstraction has 103834 states and 147144 transitions. [2019-09-07 18:58:46,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:58:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand 103834 states and 147144 transitions. [2019-09-07 18:58:46,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-07 18:58:46,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:58:46,836 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:58:46,837 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:58:46,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:58:46,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1530468991, now seen corresponding path program 1 times [2019-09-07 18:58:46,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:58:46,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:58:46,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:58:46,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:58:46,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:58:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:58:47,296 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 122 proven. 102 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-07 18:58:47,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:58:47,297 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:58:47,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:58:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:58:47,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:58:47,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:58:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 279 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 18:58:47,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:58:47,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 18:58:47,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:58:47,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:58:47,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:58:47,603 INFO L87 Difference]: Start difference. First operand 103834 states and 147144 transitions. Second operand 9 states. [2019-09-07 18:59:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:59:01,911 INFO L93 Difference]: Finished difference Result 245902 states and 392613 transitions. [2019-09-07 18:59:01,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 18:59:01,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 467 [2019-09-07 18:59:01,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:59:02,625 INFO L225 Difference]: With dead ends: 245902 [2019-09-07 18:59:02,625 INFO L226 Difference]: Without dead ends: 131617 [2019-09-07 18:59:02,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-09-07 18:59:02,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131617 states. [2019-09-07 18:59:05,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131617 to 118612. [2019-09-07 18:59:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118612 states. [2019-09-07 18:59:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118612 states to 118612 states and 162726 transitions. [2019-09-07 18:59:05,712 INFO L78 Accepts]: Start accepts. Automaton has 118612 states and 162726 transitions. Word has length 467 [2019-09-07 18:59:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:59:05,713 INFO L475 AbstractCegarLoop]: Abstraction has 118612 states and 162726 transitions. [2019-09-07 18:59:05,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:59:05,713 INFO L276 IsEmpty]: Start isEmpty. Operand 118612 states and 162726 transitions. [2019-09-07 18:59:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2019-09-07 18:59:05,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:59:05,746 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:59:05,746 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:59:05,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:59:05,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1930415849, now seen corresponding path program 1 times [2019-09-07 18:59:05,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:59:05,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:59:05,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:59:05,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:59:05,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:59:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:59:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 30 proven. 194 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 18:59:06,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:59:06,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:59:06,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:59:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:59:06,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 18:59:06,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:59:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 18:59:07,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:59:07,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 18:59:07,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:59:07,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:59:07,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:59:07,201 INFO L87 Difference]: Start difference. First operand 118612 states and 162726 transitions. Second operand 9 states. [2019-09-07 18:59:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:59:19,102 INFO L93 Difference]: Finished difference Result 268443 states and 383397 transitions. [2019-09-07 18:59:19,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 18:59:19,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 488 [2019-09-07 18:59:19,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:59:19,673 INFO L225 Difference]: With dead ends: 268443 [2019-09-07 18:59:19,673 INFO L226 Difference]: Without dead ends: 149837 [2019-09-07 18:59:19,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 496 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-09-07 18:59:19,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149837 states. [2019-09-07 18:59:22,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149837 to 131907. [2019-09-07 18:59:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131907 states. [2019-09-07 18:59:22,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131907 states to 131907 states and 168140 transitions. [2019-09-07 18:59:22,412 INFO L78 Accepts]: Start accepts. Automaton has 131907 states and 168140 transitions. Word has length 488 [2019-09-07 18:59:22,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:59:22,413 INFO L475 AbstractCegarLoop]: Abstraction has 131907 states and 168140 transitions. [2019-09-07 18:59:22,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:59:22,413 INFO L276 IsEmpty]: Start isEmpty. Operand 131907 states and 168140 transitions. [2019-09-07 18:59:22,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2019-09-07 18:59:22,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:59:22,433 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:59:22,433 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:59:22,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:59:22,434 INFO L82 PathProgramCache]: Analyzing trace with hash 260555817, now seen corresponding path program 1 times [2019-09-07 18:59:22,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:59:22,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:59:22,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:59:22,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:59:22,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:59:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:59:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 143 proven. 135 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-09-07 18:59:23,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:59:23,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:59:23,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:59:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:59:23,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:59:23,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:59:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2019-09-07 18:59:23,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:59:23,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-07 18:59:23,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 18:59:23,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 18:59:23,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-07 18:59:23,815 INFO L87 Difference]: Start difference. First operand 131907 states and 168140 transitions. Second operand 12 states. [2019-09-07 18:59:26,512 WARN L188 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-09-07 18:59:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:59:45,387 INFO L93 Difference]: Finished difference Result 268996 states and 347174 transitions. [2019-09-07 18:59:45,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 18:59:45,388 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 545 [2019-09-07 18:59:45,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:59:45,792 INFO L225 Difference]: With dead ends: 268996 [2019-09-07 18:59:45,792 INFO L226 Difference]: Without dead ends: 137093 [2019-09-07 18:59:46,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 569 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 18:59:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137093 states. [2019-09-07 18:59:47,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137093 to 124286. [2019-09-07 18:59:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124286 states. [2019-09-07 18:59:48,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124286 states to 124286 states and 146618 transitions. [2019-09-07 18:59:48,187 INFO L78 Accepts]: Start accepts. Automaton has 124286 states and 146618 transitions. Word has length 545 [2019-09-07 18:59:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:59:48,189 INFO L475 AbstractCegarLoop]: Abstraction has 124286 states and 146618 transitions. [2019-09-07 18:59:48,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 18:59:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 124286 states and 146618 transitions. [2019-09-07 18:59:48,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2019-09-07 18:59:48,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:59:48,306 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:59:48,306 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:59:48,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:59:48,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1538823634, now seen corresponding path program 1 times [2019-09-07 18:59:48,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:59:48,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:59:48,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:59:48,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:59:48,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:59:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:59:50,583 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 195 proven. 177 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-09-07 18:59:50,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:59:50,583 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:59:50,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:59:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:59:50,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 18:59:50,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:59:50,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:59:53,095 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-09-07 18:59:53,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:59:53,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-09-07 18:59:53,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 18:59:53,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 18:59:53,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-07 18:59:53,104 INFO L87 Difference]: Start difference. First operand 124286 states and 146618 transitions. Second operand 11 states. [2019-09-07 18:59:57,670 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-07 18:59:58,686 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-09-07 18:59:59,703 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-07 19:00:00,626 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-07 19:00:06,717 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-07 19:00:10,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:00:10,585 INFO L93 Difference]: Finished difference Result 255157 states and 301528 transitions. [2019-09-07 19:00:10,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 19:00:10,586 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 810 [2019-09-07 19:00:10,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:00:10,866 INFO L225 Difference]: With dead ends: 255157 [2019-09-07 19:00:10,866 INFO L226 Difference]: Without dead ends: 130871 [2019-09-07 19:00:11,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 874 GetRequests, 834 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=347, Invalid=1375, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 19:00:11,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130871 states. [2019-09-07 19:00:12,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130871 to 130709. [2019-09-07 19:00:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130709 states. [2019-09-07 19:00:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130709 states to 130709 states and 153592 transitions. [2019-09-07 19:00:13,104 INFO L78 Accepts]: Start accepts. Automaton has 130709 states and 153592 transitions. Word has length 810 [2019-09-07 19:00:13,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:00:13,104 INFO L475 AbstractCegarLoop]: Abstraction has 130709 states and 153592 transitions. [2019-09-07 19:00:13,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 19:00:13,105 INFO L276 IsEmpty]: Start isEmpty. Operand 130709 states and 153592 transitions. [2019-09-07 19:00:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 933 [2019-09-07 19:00:13,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:00:13,248 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:00:13,248 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:00:13,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:00:13,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1769842737, now seen corresponding path program 1 times [2019-09-07 19:00:13,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:00:13,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:00:13,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:00:13,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:00:13,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:00:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:00:16,027 INFO L134 CoverageAnalysis]: Checked inductivity of 898 backedges. 341 proven. 410 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-07 19:00:16,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:00:16,027 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:00:16,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:00:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:00:16,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 19:00:16,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:00:16,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,630 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 20 [2019-09-07 19:00:16,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:00:16,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:01:56,626 WARN L188 SmtUtils]: Spent 1.63 m on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-09-07 19:01:58,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 19:01:58,960 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-09-07 19:01:59,126 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-07 19:02:05,434 WARN L188 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 95 DAG size of output: 41 [2019-09-07 19:02:05,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:02:05,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:02:05,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:02:05,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:02:05,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:02:05,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:02:05,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:02:05,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:02:05,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:02:05,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:02:05,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:02:05,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:02:05,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:02:05,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:02:05,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:02:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 898 backedges. 876 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 19:02:08,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:02:08,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-09-07 19:02:08,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 19:02:08,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 19:02:08,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=282, Unknown=2, NotChecked=0, Total=342 [2019-09-07 19:02:08,366 INFO L87 Difference]: Start difference. First operand 130709 states and 153592 transitions. Second operand 19 states. [2019-09-07 19:02:10,581 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-07 19:02:11,614 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-07 19:02:13,828 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-07 19:04:26,693 WARN L188 SmtUtils]: Spent 2.18 m on a formula simplification. DAG size of input: 119 DAG size of output: 90 [2019-09-07 19:04:28,930 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-07 19:10:11,306 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59