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/Problem19_label45.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 23:22:52,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 23:22:52,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 23:22:52,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 23:22:52,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 23:22:52,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 23:22:52,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 23:22:52,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 23:22:52,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 23:22:52,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 23:22:52,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 23:22:52,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 23:22:52,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 23:22:52,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 23:22:52,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 23:22:52,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 23:22:52,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 23:22:52,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 23:22:52,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 23:22:52,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 23:22:52,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 23:22:52,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 23:22:52,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 23:22:52,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 23:22:52,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 23:22:52,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 23:22:52,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 23:22:52,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 23:22:52,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 23:22:52,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 23:22:52,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 23:22:52,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 23:22:52,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 23:22:52,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 23:22:52,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 23:22:52,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 23:22:52,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 23:22:52,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 23:22:52,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 23:22:52,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 23:22:52,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 23:22:52,240 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 23:22:52,257 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 23:22:52,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 23:22:52,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 23:22:52,260 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 23:22:52,260 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 23:22:52,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 23:22:52,260 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 23:22:52,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 23:22:52,261 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 23:22:52,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 23:22:52,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 23:22:52,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 23:22:52,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 23:22:52,261 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 23:22:52,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 23:22:52,262 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 23:22:52,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 23:22:52,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 23:22:52,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 23:22:52,264 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 23:22:52,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 23:22:52,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 23:22:52,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 23:22:52,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 23:22:52,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 23:22:52,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 23:22:52,265 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 23:22:52,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 23:22:52,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 23:22:52,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 23:22:52,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 23:22:52,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 23:22:52,321 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 23:22:52,321 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 23:22:52,325 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem19_label45.c [2019-09-07 23:22:52,398 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db8f78fd6/3b6625c5b3e64c08b0b2a8e74e6a2b44/FLAG23919d6b3 [2019-09-07 23:22:53,340 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 23:22:53,341 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem19_label45.c [2019-09-07 23:22:53,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db8f78fd6/3b6625c5b3e64c08b0b2a8e74e6a2b44/FLAG23919d6b3 [2019-09-07 23:22:53,685 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db8f78fd6/3b6625c5b3e64c08b0b2a8e74e6a2b44 [2019-09-07 23:22:53,694 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 23:22:53,696 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 23:22:53,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 23:22:53,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 23:22:53,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 23:22:53,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:22:53" (1/1) ... [2019-09-07 23:22:53,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0c3697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:22:53, skipping insertion in model container [2019-09-07 23:22:53,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:22:53" (1/1) ... [2019-09-07 23:22:53,713 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 23:22:53,963 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 23:22:56,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 23:22:56,103 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 23:22:57,353 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 23:22:57,400 INFO L192 MainTranslator]: Completed translation [2019-09-07 23:22:57,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:22:57 WrapperNode [2019-09-07 23:22:57,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 23:22:57,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 23:22:57,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 23:22:57,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 23:22:57,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:22:57" (1/1) ... [2019-09-07 23:22:57,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:22:57" (1/1) ... [2019-09-07 23:22:57,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:22:57" (1/1) ... [2019-09-07 23:22:57,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:22:57" (1/1) ... [2019-09-07 23:22:57,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:22:57" (1/1) ... [2019-09-07 23:22:57,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:22:57" (1/1) ... [2019-09-07 23:22:57,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:22:57" (1/1) ... [2019-09-07 23:22:57,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 23:22:57,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 23:22:57,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 23:22:57,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 23:22:57,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:22:57" (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 23:22:57,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 23:22:57,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 23:22:57,971 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 23:22:57,971 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 23:22:57,971 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 23:22:57,971 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 23:22:57,971 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output5 [2019-09-07 23:22:57,972 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output6 [2019-09-07 23:22:57,972 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 23:22:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 23:22:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 23:22:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 23:22:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 23:22:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output5 [2019-09-07 23:22:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output6 [2019-09-07 23:22:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 23:22:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 23:22:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 23:22:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 23:22:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 23:22:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 23:23:09,339 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 23:23:09,339 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 23:23:09,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:23:09 BoogieIcfgContainer [2019-09-07 23:23:09,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 23:23:09,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 23:23:09,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 23:23:09,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 23:23:09,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:22:53" (1/3) ... [2019-09-07 23:23:09,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea3ef61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:23:09, skipping insertion in model container [2019-09-07 23:23:09,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:22:57" (2/3) ... [2019-09-07 23:23:09,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea3ef61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:23:09, skipping insertion in model container [2019-09-07 23:23:09,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:23:09" (3/3) ... [2019-09-07 23:23:09,350 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem19_label45.c [2019-09-07 23:23:09,364 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 23:23:09,376 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 23:23:09,398 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 23:23:09,456 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 23:23:09,456 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 23:23:09,457 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 23:23:09,457 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 23:23:09,457 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 23:23:09,457 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 23:23:09,458 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 23:23:09,458 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 23:23:09,458 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 23:23:09,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states. [2019-09-07 23:23:09,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 23:23:09,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:23:09,523 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, 1, 1, 1, 1, 1, 1, 1, 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 23:23:09,525 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:23:09,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:23:09,534 INFO L82 PathProgramCache]: Analyzing trace with hash -522385732, now seen corresponding path program 1 times [2019-09-07 23:23:09,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:23:09,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:23:09,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:23:09,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:23:09,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:23:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:23:09,970 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 23:23:09,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:23:09,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 23:23:09,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 23:23:09,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 23:23:09,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 23:23:09,995 INFO L87 Difference]: Start difference. First operand 1777 states. Second operand 4 states. [2019-09-07 23:23:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:23:26,779 INFO L93 Difference]: Finished difference Result 6461 states and 12328 transitions. [2019-09-07 23:23:26,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 23:23:26,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-09-07 23:23:26,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:23:26,829 INFO L225 Difference]: With dead ends: 6461 [2019-09-07 23:23:26,829 INFO L226 Difference]: Without dead ends: 4602 [2019-09-07 23:23:26,849 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 23:23:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4602 states. [2019-09-07 23:23:27,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 3138. [2019-09-07 23:23:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2019-09-07 23:23:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 4994 transitions. [2019-09-07 23:23:27,055 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 4994 transitions. Word has length 53 [2019-09-07 23:23:27,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:23:27,056 INFO L475 AbstractCegarLoop]: Abstraction has 3138 states and 4994 transitions. [2019-09-07 23:23:27,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 23:23:27,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 4994 transitions. [2019-09-07 23:23:27,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-07 23:23:27,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:23:27,063 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:23:27,063 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:23:27,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:23:27,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1091060912, now seen corresponding path program 1 times [2019-09-07 23:23:27,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:23:27,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:23:27,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:23:27,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:23:27,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:23:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:23:27,242 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:23:27,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:23:27,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 23:23:27,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 23:23:27,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 23:23:27,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 23:23:27,249 INFO L87 Difference]: Start difference. First operand 3138 states and 4994 transitions. Second operand 6 states. [2019-09-07 23:23:41,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:23:41,323 INFO L93 Difference]: Finished difference Result 9253 states and 14826 transitions. [2019-09-07 23:23:41,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 23:23:41,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-09-07 23:23:41,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:23:41,357 INFO L225 Difference]: With dead ends: 9253 [2019-09-07 23:23:41,357 INFO L226 Difference]: Without dead ends: 6121 [2019-09-07 23:23:41,367 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 23:23:41,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6121 states. [2019-09-07 23:23:41,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6121 to 6066. [2019-09-07 23:23:41,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6066 states. [2019-09-07 23:23:41,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6066 states to 6066 states and 9393 transitions. [2019-09-07 23:23:41,526 INFO L78 Accepts]: Start accepts. Automaton has 6066 states and 9393 transitions. Word has length 124 [2019-09-07 23:23:41,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:23:41,527 INFO L475 AbstractCegarLoop]: Abstraction has 6066 states and 9393 transitions. [2019-09-07 23:23:41,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 23:23:41,527 INFO L276 IsEmpty]: Start isEmpty. Operand 6066 states and 9393 transitions. [2019-09-07 23:23:41,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-07 23:23:41,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:23:41,531 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:23:41,531 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:23:41,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:23:41,531 INFO L82 PathProgramCache]: Analyzing trace with hash -169073255, now seen corresponding path program 1 times [2019-09-07 23:23:41,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:23:41,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:23:41,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:23:41,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:23:41,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:23:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:23:41,751 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:23:41,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:23:41,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 23:23:41,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 23:23:41,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 23:23:41,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 23:23:41,755 INFO L87 Difference]: Start difference. First operand 6066 states and 9393 transitions. Second operand 6 states. [2019-09-07 23:23:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:23:58,370 INFO L93 Difference]: Finished difference Result 18223 states and 28855 transitions. [2019-09-07 23:23:58,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 23:23:58,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-09-07 23:23:58,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:23:58,443 INFO L225 Difference]: With dead ends: 18223 [2019-09-07 23:23:58,444 INFO L226 Difference]: Without dead ends: 12163 [2019-09-07 23:23:58,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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 23:23:58,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12163 states. [2019-09-07 23:23:58,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12163 to 12000. [2019-09-07 23:23:58,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12000 states. [2019-09-07 23:23:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12000 states to 12000 states and 18689 transitions. [2019-09-07 23:23:58,786 INFO L78 Accepts]: Start accepts. Automaton has 12000 states and 18689 transitions. Word has length 126 [2019-09-07 23:23:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:23:58,788 INFO L475 AbstractCegarLoop]: Abstraction has 12000 states and 18689 transitions. [2019-09-07 23:23:58,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 23:23:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 12000 states and 18689 transitions. [2019-09-07 23:23:58,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-07 23:23:58,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:23:58,801 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:23:58,801 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:23:58,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:23:58,802 INFO L82 PathProgramCache]: Analyzing trace with hash -56922798, now seen corresponding path program 1 times [2019-09-07 23:23:58,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:23:58,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:23:58,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:23:58,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:23:58,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:23:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:23:58,989 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:23:58,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:23:58,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 23:23:58,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 23:23:58,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 23:23:58,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 23:23:58,992 INFO L87 Difference]: Start difference. First operand 12000 states and 18689 transitions. Second operand 6 states. [2019-09-07 23:24:14,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:24:14,366 INFO L93 Difference]: Finished difference Result 36534 states and 58694 transitions. [2019-09-07 23:24:14,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 23:24:14,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-07 23:24:14,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:24:14,460 INFO L225 Difference]: With dead ends: 36534 [2019-09-07 23:24:14,460 INFO L226 Difference]: Without dead ends: 24540 [2019-09-07 23:24:14,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 23:24:14,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24540 states. [2019-09-07 23:24:15,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24540 to 24252. [2019-09-07 23:24:15,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24252 states. [2019-09-07 23:24:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24252 states to 24252 states and 37269 transitions. [2019-09-07 23:24:15,134 INFO L78 Accepts]: Start accepts. Automaton has 24252 states and 37269 transitions. Word has length 134 [2019-09-07 23:24:15,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:24:15,136 INFO L475 AbstractCegarLoop]: Abstraction has 24252 states and 37269 transitions. [2019-09-07 23:24:15,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 23:24:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 24252 states and 37269 transitions. [2019-09-07 23:24:15,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-07 23:24:15,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:24:15,139 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:24:15,139 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:24:15,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:24:15,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1898798504, now seen corresponding path program 1 times [2019-09-07 23:24:15,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:24:15,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:24:15,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:24:15,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:24:15,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:24:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:24:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:24:15,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:24:15,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 23:24:15,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 23:24:15,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 23:24:15,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 23:24:15,402 INFO L87 Difference]: Start difference. First operand 24252 states and 37269 transitions. Second operand 5 states. [2019-09-07 23:24:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:24:32,716 INFO L93 Difference]: Finished difference Result 72212 states and 115447 transitions. [2019-09-07 23:24:32,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 23:24:32,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-09-07 23:24:32,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:24:32,875 INFO L225 Difference]: With dead ends: 72212 [2019-09-07 23:24:32,876 INFO L226 Difference]: Without dead ends: 47966 [2019-09-07 23:24:32,937 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 23:24:32,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47966 states. [2019-09-07 23:24:34,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47966 to 44272. [2019-09-07 23:24:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44272 states. [2019-09-07 23:24:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44272 states to 44272 states and 62763 transitions. [2019-09-07 23:24:34,143 INFO L78 Accepts]: Start accepts. Automaton has 44272 states and 62763 transitions. Word has length 154 [2019-09-07 23:24:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:24:34,144 INFO L475 AbstractCegarLoop]: Abstraction has 44272 states and 62763 transitions. [2019-09-07 23:24:34,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 23:24:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 44272 states and 62763 transitions. [2019-09-07 23:24:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-07 23:24:34,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:24:34,150 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:24:34,150 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:24:34,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:24:34,151 INFO L82 PathProgramCache]: Analyzing trace with hash 364800299, now seen corresponding path program 1 times [2019-09-07 23:24:34,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:24:34,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:24:34,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:24:34,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:24:34,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:24:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:24:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:24:34,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:24:34,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 23:24:34,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 23:24:34,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 23:24:34,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 23:24:34,426 INFO L87 Difference]: Start difference. First operand 44272 states and 62763 transitions. Second operand 6 states. [2019-09-07 23:24:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:24:50,167 INFO L93 Difference]: Finished difference Result 109696 states and 161354 transitions. [2019-09-07 23:24:50,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 23:24:50,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2019-09-07 23:24:50,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:24:50,402 INFO L225 Difference]: With dead ends: 109696 [2019-09-07 23:24:50,404 INFO L226 Difference]: Without dead ends: 65430 [2019-09-07 23:24:50,494 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 23:24:50,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65430 states. [2019-09-07 23:24:53,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65430 to 64982. [2019-09-07 23:24:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64982 states. [2019-09-07 23:24:53,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64982 states to 64982 states and 89754 transitions. [2019-09-07 23:24:53,594 INFO L78 Accepts]: Start accepts. Automaton has 64982 states and 89754 transitions. Word has length 217 [2019-09-07 23:24:53,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:24:53,596 INFO L475 AbstractCegarLoop]: Abstraction has 64982 states and 89754 transitions. [2019-09-07 23:24:53,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 23:24:53,596 INFO L276 IsEmpty]: Start isEmpty. Operand 64982 states and 89754 transitions. [2019-09-07 23:24:53,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2019-09-07 23:24:53,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:24:53,609 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:24:53,610 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:24:53,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:24:53,615 INFO L82 PathProgramCache]: Analyzing trace with hash 720955582, now seen corresponding path program 1 times [2019-09-07 23:24:53,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:24:53,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:24:53,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:24:53,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:24:53,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:24:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:24:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:24:54,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:24:54,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 23:24:54,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 23:24:54,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 23:24:54,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 23:24:54,123 INFO L87 Difference]: Start difference. First operand 64982 states and 89754 transitions. Second operand 4 states. [2019-09-07 23:25:15,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:25:15,218 INFO L93 Difference]: Finished difference Result 191652 states and 277258 transitions. [2019-09-07 23:25:15,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 23:25:15,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 539 [2019-09-07 23:25:15,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:25:15,586 INFO L225 Difference]: With dead ends: 191652 [2019-09-07 23:25:15,586 INFO L226 Difference]: Without dead ends: 126676 [2019-09-07 23:25:15,687 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 23:25:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126676 states. [2019-09-07 23:25:17,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126676 to 125058. [2019-09-07 23:25:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125058 states. [2019-09-07 23:25:17,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125058 states to 125058 states and 173288 transitions. [2019-09-07 23:25:17,901 INFO L78 Accepts]: Start accepts. Automaton has 125058 states and 173288 transitions. Word has length 539 [2019-09-07 23:25:17,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:25:17,902 INFO L475 AbstractCegarLoop]: Abstraction has 125058 states and 173288 transitions. [2019-09-07 23:25:17,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 23:25:17,902 INFO L276 IsEmpty]: Start isEmpty. Operand 125058 states and 173288 transitions. [2019-09-07 23:25:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2019-09-07 23:25:17,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:25:17,924 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:25:17,924 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:25:17,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:25:17,925 INFO L82 PathProgramCache]: Analyzing trace with hash 2057696050, now seen corresponding path program 1 times [2019-09-07 23:25:17,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:25:17,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:25:17,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:25:17,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:25:17,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:25:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:25:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:25:18,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:25:18,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 23:25:18,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 23:25:18,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 23:25:18,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 23:25:18,480 INFO L87 Difference]: Start difference. First operand 125058 states and 173288 transitions. Second operand 4 states. [2019-09-07 23:25:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:25:36,891 INFO L93 Difference]: Finished difference Result 292677 states and 409860 transitions. [2019-09-07 23:25:36,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 23:25:36,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 646 [2019-09-07 23:25:36,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:25:37,263 INFO L225 Difference]: With dead ends: 292677 [2019-09-07 23:25:37,263 INFO L226 Difference]: Without dead ends: 167625 [2019-09-07 23:25:37,432 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 23:25:37,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167625 states. [2019-09-07 23:25:43,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167625 to 157836. [2019-09-07 23:25:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157836 states. [2019-09-07 23:25:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157836 states to 157836 states and 204499 transitions. [2019-09-07 23:25:43,458 INFO L78 Accepts]: Start accepts. Automaton has 157836 states and 204499 transitions. Word has length 646 [2019-09-07 23:25:43,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:25:43,459 INFO L475 AbstractCegarLoop]: Abstraction has 157836 states and 204499 transitions. [2019-09-07 23:25:43,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 23:25:43,459 INFO L276 IsEmpty]: Start isEmpty. Operand 157836 states and 204499 transitions. [2019-09-07 23:25:43,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 950 [2019-09-07 23:25:43,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:25:43,494 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:25:43,494 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:25:43,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:25:43,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1315200860, now seen corresponding path program 1 times [2019-09-07 23:25:43,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:25:43,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:25:43,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:25:43,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:25:43,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:25:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:25:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 278 proven. 132 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-09-07 23:25:45,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:25:45,309 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 23:25:45,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:25:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:25:45,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 23:25:45,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:25:46,751 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 491 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-07 23:25:46,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:25:46,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 23:25:46,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 23:25:46,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 23:25:46,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 23:25:46,769 INFO L87 Difference]: Start difference. First operand 157836 states and 204499 transitions. Second operand 9 states. [2019-09-07 23:26:22,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:26:22,977 INFO L93 Difference]: Finished difference Result 388635 states and 525059 transitions. [2019-09-07 23:26:22,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 23:26:22,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 949 [2019-09-07 23:26:22,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:26:24,811 INFO L225 Difference]: With dead ends: 388635 [2019-09-07 23:26:24,812 INFO L226 Difference]: Without dead ends: 225249 [2019-09-07 23:26:25,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 953 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-09-07 23:26:25,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225249 states. [2019-09-07 23:26:33,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225249 to 213704. [2019-09-07 23:26:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213704 states. [2019-09-07 23:26:33,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213704 states to 213704 states and 281345 transitions. [2019-09-07 23:26:33,869 INFO L78 Accepts]: Start accepts. Automaton has 213704 states and 281345 transitions. Word has length 949 [2019-09-07 23:26:33,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:26:33,871 INFO L475 AbstractCegarLoop]: Abstraction has 213704 states and 281345 transitions. [2019-09-07 23:26:33,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 23:26:33,871 INFO L276 IsEmpty]: Start isEmpty. Operand 213704 states and 281345 transitions. [2019-09-07 23:26:33,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 967 [2019-09-07 23:26:33,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:26:33,907 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:26:33,907 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:26:33,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:26:33,908 INFO L82 PathProgramCache]: Analyzing trace with hash -2013653896, now seen corresponding path program 1 times [2019-09-07 23:26:33,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:26:33,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:26:33,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:26:33,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:26:33,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:26:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:26:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 459 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 23:26:35,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:26:35,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:26:35,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:26:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:26:35,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 23:26:35,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:26:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 459 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 23:26:39,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:26:39,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 23:26:39,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 23:26:39,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 23:26:39,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 23:26:39,176 INFO L87 Difference]: Start difference. First operand 213704 states and 281345 transitions. Second operand 9 states. [2019-09-07 23:27:12,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:27:12,989 INFO L93 Difference]: Finished difference Result 526775 states and 800576 transitions. [2019-09-07 23:27:12,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 23:27:12,990 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 966 [2019-09-07 23:27:12,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:27:14,267 INFO L225 Difference]: With dead ends: 526775 [2019-09-07 23:27:14,267 INFO L226 Difference]: Without dead ends: 297359 [2019-09-07 23:27:14,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 999 GetRequests, 978 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2019-09-07 23:27:14,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297359 states. [2019-09-07 23:27:26,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297359 to 290097. [2019-09-07 23:27:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290097 states. [2019-09-07 23:27:27,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290097 states to 290097 states and 406407 transitions. [2019-09-07 23:27:27,686 INFO L78 Accepts]: Start accepts. Automaton has 290097 states and 406407 transitions. Word has length 966 [2019-09-07 23:27:27,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:27:27,688 INFO L475 AbstractCegarLoop]: Abstraction has 290097 states and 406407 transitions. [2019-09-07 23:27:27,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 23:27:27,688 INFO L276 IsEmpty]: Start isEmpty. Operand 290097 states and 406407 transitions. [2019-09-07 23:27:27,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1000 [2019-09-07 23:27:27,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:27:27,728 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:27:27,729 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:27:27,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:27:27,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1598795176, now seen corresponding path program 1 times [2019-09-07 23:27:27,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:27:27,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:27:27,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:27:27,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:27:27,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:27:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:27:30,265 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 238 proven. 98 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2019-09-07 23:27:30,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:27:30,266 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:27:30,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:27:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:27:30,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 23:27:30,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:27:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 538 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-07 23:27:35,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:27:35,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 23:27:35,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 23:27:35,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 23:27:35,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 23:27:35,656 INFO L87 Difference]: Start difference. First operand 290097 states and 406407 transitions. Second operand 9 states. [2019-09-07 23:28:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:28:12,967 INFO L93 Difference]: Finished difference Result 654608 states and 1091456 transitions. [2019-09-07 23:28:12,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 23:28:12,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 999 [2019-09-07 23:28:12,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:28:14,818 INFO L225 Difference]: With dead ends: 654608 [2019-09-07 23:28:14,818 INFO L226 Difference]: Without dead ends: 362883 [2019-09-07 23:28:16,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1030 GetRequests, 1010 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-07 23:28:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362883 states. [2019-09-07 23:28:30,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362883 to 360406. [2019-09-07 23:28:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360406 states. [2019-09-07 23:28:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360406 states to 360406 states and 558790 transitions. [2019-09-07 23:28:40,375 INFO L78 Accepts]: Start accepts. Automaton has 360406 states and 558790 transitions. Word has length 999 [2019-09-07 23:28:40,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:28:40,376 INFO L475 AbstractCegarLoop]: Abstraction has 360406 states and 558790 transitions. [2019-09-07 23:28:40,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 23:28:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand 360406 states and 558790 transitions. [2019-09-07 23:28:40,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1184 [2019-09-07 23:28:40,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:28:40,426 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 23:28:40,426 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:28:40,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:28:40,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1006136630, now seen corresponding path program 1 times [2019-09-07 23:28:40,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:28:40,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:28:40,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:28:40,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:28:40,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:28:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:28:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 521 proven. 164 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-09-07 23:28:43,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:28:43,558 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:28:43,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:28:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:28:43,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 1508 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 23:28:43,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:28:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 1097 proven. 2 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-09-07 23:28:44,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:28:44,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 23:28:44,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 23:28:44,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 23:28:44,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 23:28:44,771 INFO L87 Difference]: Start difference. First operand 360406 states and 558790 transitions. Second operand 9 states. [2019-09-07 23:29:39,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:29:39,377 INFO L93 Difference]: Finished difference Result 872055 states and 1696781 transitions. [2019-09-07 23:29:39,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 23:29:39,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1183 [2019-09-07 23:29:39,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:29:42,987 INFO L225 Difference]: With dead ends: 872055 [2019-09-07 23:29:42,987 INFO L226 Difference]: Without dead ends: 511490 [2019-09-07 23:29:43,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1206 GetRequests, 1190 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 23:29:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511490 states. [2019-09-07 23:30:15,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511490 to 506223. [2019-09-07 23:30:15,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506223 states. [2019-09-07 23:30:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506223 states to 506223 states and 1000198 transitions. [2019-09-07 23:30:32,926 INFO L78 Accepts]: Start accepts. Automaton has 506223 states and 1000198 transitions. Word has length 1183 [2019-09-07 23:30:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:30:32,927 INFO L475 AbstractCegarLoop]: Abstraction has 506223 states and 1000198 transitions. [2019-09-07 23:30:32,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 23:30:32,927 INFO L276 IsEmpty]: Start isEmpty. Operand 506223 states and 1000198 transitions. [2019-09-07 23:30:32,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1247 [2019-09-07 23:30:32,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:30:32,985 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 23:30:32,985 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:30:32,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:30:32,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2147083073, now seen corresponding path program 1 times [2019-09-07 23:30:32,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:30:32,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:30:32,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:30:32,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:30:32,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:30:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:30:36,996 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 557 proven. 49 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-09-07 23:30:36,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:30:36,997 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 23:30:37,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:30:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:30:37,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 1576 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-07 23:30:37,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:30:37,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 23:30:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-09-07 23:30:39,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 23:30:39,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2019-09-07 23:30:39,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 23:30:39,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 23:30:39,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-09-07 23:30:39,804 INFO L87 Difference]: Start difference. First operand 506223 states and 1000198 transitions. Second operand 18 states. [2019-09-07 23:31:17,138 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-09-07 23:32:47,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:32:47,537 INFO L93 Difference]: Finished difference Result 958370 states and 1613330 transitions. [2019-09-07 23:32:47,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-09-07 23:32:47,538 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1246 [2019-09-07 23:32:47,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:32:48,810 INFO L225 Difference]: With dead ends: 958370 [2019-09-07 23:32:48,810 INFO L226 Difference]: Without dead ends: 453542 [2019-09-07 23:32:51,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1532 GetRequests, 1359 SyntacticMatches, 2 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11669 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=3277, Invalid=26479, Unknown=0, NotChecked=0, Total=29756 [2019-09-07 23:32:51,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453542 states. [2019-09-07 23:32:58,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453542 to 437406. [2019-09-07 23:32:58,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437406 states. [2019-09-07 23:33:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437406 states to 437406 states and 518933 transitions. [2019-09-07 23:33:00,709 INFO L78 Accepts]: Start accepts. Automaton has 437406 states and 518933 transitions. Word has length 1246 [2019-09-07 23:33:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:33:00,709 INFO L475 AbstractCegarLoop]: Abstraction has 437406 states and 518933 transitions. [2019-09-07 23:33:00,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 23:33:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 437406 states and 518933 transitions. [2019-09-07 23:33:00,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1471 [2019-09-07 23:33:00,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:33:00,773 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 23:33:00,773 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:33:00,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:33:00,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1291310790, now seen corresponding path program 1 times [2019-09-07 23:33:00,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:33:00,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:33:00,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:00,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:00,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:33:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1979 backedges. 645 proven. 226 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2019-09-07 23:33:06,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:33:06,716 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 23:33:06,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:33:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:33:08,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 1864 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 23:33:08,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:33:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1979 backedges. 1497 proven. 2 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-07 23:33:16,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:33:16,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2019-09-07 23:33:16,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 23:33:16,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 23:33:16,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-07 23:33:16,608 INFO L87 Difference]: Start difference. First operand 437406 states and 518933 transitions. Second operand 16 states.