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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label51.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:57:48,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:57:48,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:57:48,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:57:48,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:57:48,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:57:48,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:57:48,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:57:48,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:57:48,871 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:57:48,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:57:48,873 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:57:48,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:57:48,875 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:57:48,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:57:48,879 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:57:48,881 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:57:48,883 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:57:48,884 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:57:48,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:57:48,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:57:48,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:57:48,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:57:48,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:57:48,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:57:48,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:57:48,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:57:48,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:57:48,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:57:48,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:57:48,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:57:48,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:57:48,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:57:48,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:57:48,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:57:48,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:57:48,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:57:48,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:57:48,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:57:48,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:57:48,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:57:48,910 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-10-14 23:57:48,924 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:57:48,924 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:57:48,925 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:57:48,925 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:57:48,925 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:57:48,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:57:48,926 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:57:48,926 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:57:48,926 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:57:48,926 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:57:48,926 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:57:48,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:57:48,927 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:57:48,927 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:57:48,927 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:57:48,927 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:57:48,928 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:57:48,928 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:57:48,928 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:57:48,928 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:57:48,928 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:57:48,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:57:48,929 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:57:48,929 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:57:48,929 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:57:48,929 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:57:48,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:57:48,930 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:57:48,930 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-14 23:57:49,227 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:57:49,240 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:57:49,244 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:57:49,245 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:57:49,245 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:57:49,246 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label51.c [2019-10-14 23:57:49,323 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f0fad3ec/68fb70d057e44fafacd9b3b9f200e2a3/FLAGa1929f4e6 [2019-10-14 23:57:49,866 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:57:49,866 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label51.c [2019-10-14 23:57:49,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f0fad3ec/68fb70d057e44fafacd9b3b9f200e2a3/FLAGa1929f4e6 [2019-10-14 23:57:50,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f0fad3ec/68fb70d057e44fafacd9b3b9f200e2a3 [2019-10-14 23:57:50,158 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:57:50,160 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:57:50,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:57:50,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:57:50,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:57:50,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:57:50" (1/1) ... [2019-10-14 23:57:50,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5a7a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:50, skipping insertion in model container [2019-10-14 23:57:50,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:57:50" (1/1) ... [2019-10-14 23:57:50,175 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:57:50,226 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:57:50,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:57:50,788 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:57:50,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:57:50,973 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:57:50,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:50 WrapperNode [2019-10-14 23:57:50,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:57:50,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:57:50,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:57:50,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:57:50,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:50" (1/1) ... [2019-10-14 23:57:50,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:50" (1/1) ... [2019-10-14 23:57:51,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:50" (1/1) ... [2019-10-14 23:57:51,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:50" (1/1) ... [2019-10-14 23:57:51,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:50" (1/1) ... [2019-10-14 23:57:51,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:50" (1/1) ... [2019-10-14 23:57:51,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:50" (1/1) ... [2019-10-14 23:57:51,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:57:51,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:57:51,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:57:51,099 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:57:51,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:50" (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-10-14 23:57:51,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:57:51,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:57:51,164 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-14 23:57:51,164 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:57:51,164 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-14 23:57:51,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:57:51,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:57:51,165 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:57:51,165 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:57:51,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:57:51,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:57:52,298 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:57:52,298 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:57:52,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:57:52 BoogieIcfgContainer [2019-10-14 23:57:52,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:57:52,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:57:52,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:57:52,305 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:57:52,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:57:50" (1/3) ... [2019-10-14 23:57:52,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10778e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:57:52, skipping insertion in model container [2019-10-14 23:57:52,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:50" (2/3) ... [2019-10-14 23:57:52,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10778e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:57:52, skipping insertion in model container [2019-10-14 23:57:52,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:57:52" (3/3) ... [2019-10-14 23:57:52,308 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label51.c [2019-10-14 23:57:52,318 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:57:52,326 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:57:52,338 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:57:52,366 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:57:52,366 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:57:52,366 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:57:52,367 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:57:52,367 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:57:52,367 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:57:52,367 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:57:52,368 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:57:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-14 23:57:52,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-14 23:57:52,405 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:52,406 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:57:52,408 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:52,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:52,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1960329542, now seen corresponding path program 1 times [2019-10-14 23:57:52,423 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:52,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031634119] [2019-10-14 23:57:52,424 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:52,424 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:52,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:57:52,929 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031634119] [2019-10-14 23:57:52,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:57:52,930 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:57:52,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324358908] [2019-10-14 23:57:52,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:57:52,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:57:52,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:57:52,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:57:52,955 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-14 23:57:53,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:57:53,808 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2019-10-14 23:57:53,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:57:53,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-10-14 23:57:53,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:57:53,839 INFO L225 Difference]: With dead ends: 618 [2019-10-14 23:57:53,839 INFO L226 Difference]: Without dead ends: 320 [2019-10-14 23:57:53,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:57:53,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-14 23:57:53,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-14 23:57:53,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-14 23:57:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-14 23:57:53,930 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 116 [2019-10-14 23:57:53,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:57:53,931 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-14 23:57:53,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:57:53,931 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-14 23:57:53,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-14 23:57:53,935 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:53,936 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 23:57:53,936 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:53,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:53,937 INFO L82 PathProgramCache]: Analyzing trace with hash -994304287, now seen corresponding path program 1 times [2019-10-14 23:57:53,937 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:53,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871346130] [2019-10-14 23:57:53,939 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:53,939 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:53,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:57:54,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871346130] [2019-10-14 23:57:54,249 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:57:54,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:57:54,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786776138] [2019-10-14 23:57:54,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:57:54,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:57:54,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:57:54,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:57:54,252 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-14 23:57:54,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:57:54,887 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2019-10-14 23:57:54,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:57:54,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-10-14 23:57:54,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:57:54,892 INFO L225 Difference]: With dead ends: 721 [2019-10-14 23:57:54,892 INFO L226 Difference]: Without dead ends: 320 [2019-10-14 23:57:54,894 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:57:54,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-14 23:57:54,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-14 23:57:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-14 23:57:54,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-14 23:57:54,924 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 124 [2019-10-14 23:57:54,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:57:54,925 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-14 23:57:54,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:57:54,925 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-14 23:57:54,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-14 23:57:54,927 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:54,928 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 23:57:54,928 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:54,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:54,928 INFO L82 PathProgramCache]: Analyzing trace with hash 418207893, now seen corresponding path program 1 times [2019-10-14 23:57:54,929 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:54,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153685457] [2019-10-14 23:57:54,929 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:54,929 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:54,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:57:55,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153685457] [2019-10-14 23:57:55,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:57:55,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:57:55,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127623813] [2019-10-14 23:57:55,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:57:55,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:57:55,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:57:55,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:57:55,307 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-14 23:57:56,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:57:56,028 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2019-10-14 23:57:56,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:57:56,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-14 23:57:56,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:57:56,036 INFO L225 Difference]: With dead ends: 717 [2019-10-14 23:57:56,036 INFO L226 Difference]: Without dead ends: 320 [2019-10-14 23:57:56,038 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:57:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-14 23:57:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-14 23:57:56,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-14 23:57:56,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-14 23:57:56,057 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 130 [2019-10-14 23:57:56,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:57:56,057 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-14 23:57:56,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:57:56,058 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-14 23:57:56,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-14 23:57:56,083 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:56,083 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 23:57:56,083 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:56,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:56,084 INFO L82 PathProgramCache]: Analyzing trace with hash 431960158, now seen corresponding path program 1 times [2019-10-14 23:57:56,084 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:56,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537693622] [2019-10-14 23:57:56,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:56,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:56,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:56,195 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:57:56,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537693622] [2019-10-14 23:57:56,197 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:57:56,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:57:56,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988822720] [2019-10-14 23:57:56,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:57:56,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:57:56,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:57:56,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:57:56,201 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-14 23:57:57,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:57:57,015 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2019-10-14 23:57:57,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:57:57,015 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2019-10-14 23:57:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:57:57,019 INFO L225 Difference]: With dead ends: 951 [2019-10-14 23:57:57,020 INFO L226 Difference]: Without dead ends: 637 [2019-10-14 23:57:57,021 INFO L600 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-10-14 23:57:57,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-14 23:57:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-14 23:57:57,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-14 23:57:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 870 transitions. [2019-10-14 23:57:57,052 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 870 transitions. Word has length 138 [2019-10-14 23:57:57,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:57:57,052 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 870 transitions. [2019-10-14 23:57:57,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:57:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 870 transitions. [2019-10-14 23:57:57,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-14 23:57:57,056 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:57,056 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 23:57:57,056 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:57,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:57,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1228482458, now seen corresponding path program 1 times [2019-10-14 23:57:57,057 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:57,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158198817] [2019-10-14 23:57:57,057 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:57,057 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:57,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:57:57,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158198817] [2019-10-14 23:57:57,280 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:57:57,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:57:57,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853445685] [2019-10-14 23:57:57,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:57:57,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:57:57,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:57:57,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:57:57,282 INFO L87 Difference]: Start difference. First operand 626 states and 870 transitions. Second operand 5 states. [2019-10-14 23:57:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:57:57,969 INFO L93 Difference]: Finished difference Result 1330 states and 1901 transitions. [2019-10-14 23:57:57,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:57:57,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2019-10-14 23:57:57,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:57:57,975 INFO L225 Difference]: With dead ends: 1330 [2019-10-14 23:57:57,975 INFO L226 Difference]: Without dead ends: 626 [2019-10-14 23:57:57,977 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:57:57,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-14 23:57:58,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-14 23:57:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-14 23:57:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 858 transitions. [2019-10-14 23:57:58,008 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 858 transitions. Word has length 140 [2019-10-14 23:57:58,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:57:58,008 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 858 transitions. [2019-10-14 23:57:58,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:57:58,009 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 858 transitions. [2019-10-14 23:57:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-14 23:57:58,011 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:58,012 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 23:57:58,012 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:58,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:58,012 INFO L82 PathProgramCache]: Analyzing trace with hash 725638870, now seen corresponding path program 1 times [2019-10-14 23:57:58,013 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:58,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642249730] [2019-10-14 23:57:58,013 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:58,013 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:58,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:58,258 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:57:58,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642249730] [2019-10-14 23:57:58,258 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:57:58,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:57:58,259 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000828376] [2019-10-14 23:57:58,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:57:58,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:57:58,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:57:58,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:57:58,260 INFO L87 Difference]: Start difference. First operand 626 states and 858 transitions. Second operand 5 states. [2019-10-14 23:57:58,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:57:58,869 INFO L93 Difference]: Finished difference Result 1332 states and 1876 transitions. [2019-10-14 23:57:58,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:57:58,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-10-14 23:57:58,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:57:58,873 INFO L225 Difference]: With dead ends: 1332 [2019-10-14 23:57:58,874 INFO L226 Difference]: Without dead ends: 626 [2019-10-14 23:57:58,876 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:57:58,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-14 23:57:58,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-14 23:57:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-14 23:57:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 842 transitions. [2019-10-14 23:57:58,906 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 842 transitions. Word has length 142 [2019-10-14 23:57:58,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:57:58,906 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 842 transitions. [2019-10-14 23:57:58,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:57:58,907 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 842 transitions. [2019-10-14 23:57:58,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-14 23:57:58,910 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:58,917 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 23:57:58,917 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:58,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:58,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1581871794, now seen corresponding path program 1 times [2019-10-14 23:57:58,918 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:58,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231853293] [2019-10-14 23:57:58,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:58,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:58,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:57:58,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231853293] [2019-10-14 23:57:58,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:57:58,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:57:58,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291890155] [2019-10-14 23:57:58,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:57:58,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:57:58,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:57:58,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:57:58,998 INFO L87 Difference]: Start difference. First operand 626 states and 842 transitions. Second operand 6 states. [2019-10-14 23:57:59,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:57:59,707 INFO L93 Difference]: Finished difference Result 1858 states and 2598 transitions. [2019-10-14 23:57:59,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:57:59,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-10-14 23:57:59,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:57:59,718 INFO L225 Difference]: With dead ends: 1858 [2019-10-14 23:57:59,718 INFO L226 Difference]: Without dead ends: 1238 [2019-10-14 23:57:59,720 INFO L600 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-10-14 23:57:59,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-14 23:57:59,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-14 23:57:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-14 23:57:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1635 transitions. [2019-10-14 23:57:59,759 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1635 transitions. Word has length 146 [2019-10-14 23:57:59,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:57:59,760 INFO L462 AbstractCegarLoop]: Abstraction has 1218 states and 1635 transitions. [2019-10-14 23:57:59,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:57:59,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1635 transitions. [2019-10-14 23:57:59,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-14 23:57:59,765 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:59,765 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 23:57:59,766 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:59,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:59,766 INFO L82 PathProgramCache]: Analyzing trace with hash 93497294, now seen corresponding path program 1 times [2019-10-14 23:57:59,766 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:59,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575349304] [2019-10-14 23:57:59,767 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:59,767 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:59,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:57:59,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575349304] [2019-10-14 23:57:59,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546280935] [2019-10-14 23:57:59,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:57:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:59,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:58:00,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:58:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-14 23:58:00,133 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:58:00,270 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-14 23:58:00,270 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:58:00,271 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-14 23:58:00,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946065496] [2019-10-14 23:58:00,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:58:00,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:58:00,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:58:00,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:58:00,273 INFO L87 Difference]: Start difference. First operand 1218 states and 1635 transitions. Second operand 3 states. [2019-10-14 23:58:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:58:00,761 INFO L93 Difference]: Finished difference Result 3012 states and 4063 transitions. [2019-10-14 23:58:00,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:58:00,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-14 23:58:00,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:58:00,767 INFO L225 Difference]: With dead ends: 3012 [2019-10-14 23:58:00,767 INFO L226 Difference]: Without dead ends: 1060 [2019-10-14 23:58:00,771 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 358 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:58:00,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-10-14 23:58:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2019-10-14 23:58:00,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-10-14 23:58:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1379 transitions. [2019-10-14 23:58:00,803 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1379 transitions. Word has length 180 [2019-10-14 23:58:00,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:58:00,804 INFO L462 AbstractCegarLoop]: Abstraction has 1060 states and 1379 transitions. [2019-10-14 23:58:00,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:58:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1379 transitions. [2019-10-14 23:58:00,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-14 23:58:00,808 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:58:00,808 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 23:58:01,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:58:01,013 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:58:01,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:58:01,014 INFO L82 PathProgramCache]: Analyzing trace with hash 665036672, now seen corresponding path program 1 times [2019-10-14 23:58:01,014 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:58:01,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603849182] [2019-10-14 23:58:01,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:58:01,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:58:01,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:58:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:58:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:58:01,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603849182] [2019-10-14 23:58:01,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014543934] [2019-10-14 23:58:01,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:58:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:58:01,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:58:01,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:58:01,302 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:58:01,302 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:58:01,470 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:58:01,470 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:58:01,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-14 23:58:01,471 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767156664] [2019-10-14 23:58:01,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:58:01,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:58:01,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:58:01,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:58:01,480 INFO L87 Difference]: Start difference. First operand 1060 states and 1379 transitions. Second operand 3 states. [2019-10-14 23:58:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:58:02,103 INFO L93 Difference]: Finished difference Result 2554 states and 3341 transitions. [2019-10-14 23:58:02,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:58:02,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-10-14 23:58:02,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:58:02,115 INFO L225 Difference]: With dead ends: 2554 [2019-10-14 23:58:02,116 INFO L226 Difference]: Without dead ends: 1500 [2019-10-14 23:58:02,119 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 364 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:58:02,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2019-10-14 23:58:02,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1355. [2019-10-14 23:58:02,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states. [2019-10-14 23:58:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1712 transitions. [2019-10-14 23:58:02,163 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1712 transitions. Word has length 183 [2019-10-14 23:58:02,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:58:02,163 INFO L462 AbstractCegarLoop]: Abstraction has 1355 states and 1712 transitions. [2019-10-14 23:58:02,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:58:02,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1712 transitions. [2019-10-14 23:58:02,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-14 23:58:02,170 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:58:02,170 INFO L380 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-14 23:58:02,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:58:02,375 INFO L410 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:58:02,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:58:02,375 INFO L82 PathProgramCache]: Analyzing trace with hash 243078476, now seen corresponding path program 1 times [2019-10-14 23:58:02,375 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:58:02,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193874042] [2019-10-14 23:58:02,378 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:58:02,378 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:58:02,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:58:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:58:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 139 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:58:02,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193874042] [2019-10-14 23:58:02,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128307531] [2019-10-14 23:58:02,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:58:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:58:02,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:58:02,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:58:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 153 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:58:02,819 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:58:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 153 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:58:02,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1780714976] [2019-10-14 23:58:02,922 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 232 [2019-10-14 23:58:02,970 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-14 23:58:02,970 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)