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_label12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:55:56,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:55:56,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:55:56,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:55:56,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:55:56,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:55:56,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:55:56,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:55:56,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:55:56,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:55:56,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:55:56,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:55:56,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:55:56,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:55:56,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:55:56,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:55:56,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:55:56,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:55:56,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:55:56,914 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:55:56,917 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:55:56,918 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:55:56,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:55:56,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:55:56,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:55:56,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:55:56,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:55:56,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:55:56,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:55:56,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:55:56,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:55:56,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:55:56,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:55:56,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:55:56,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:55:56,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:55:56,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:55:56,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:55:56,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:55:56,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:55:56,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:55:56,947 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:55:56,967 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:55:56,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:55:56,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:55:56,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:55:56,970 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:55:56,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:55:56,970 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:55:56,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:55:56,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:55:56,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:55:56,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:55:56,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:55:56,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:55:56,973 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:55:56,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:55:56,973 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:55:56,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:55:56,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:55:56,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:55:56,974 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:55:56,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:55:56,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:55:56,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:55:56,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:55:56,975 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:55:56,975 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:55:56,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:55:56,976 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:55:56,976 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:55:57,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:55:57,281 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:55:57,287 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:55:57,288 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:55:57,289 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:55:57,290 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label12.c [2019-10-14 23:55:57,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b7a9ffb/01a7758e8c2146ee9c294474ca4cca67/FLAG4dedc5b8d [2019-10-14 23:55:57,892 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:55:57,896 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label12.c [2019-10-14 23:55:57,916 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b7a9ffb/01a7758e8c2146ee9c294474ca4cca67/FLAG4dedc5b8d [2019-10-14 23:55:58,197 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b7a9ffb/01a7758e8c2146ee9c294474ca4cca67 [2019-10-14 23:55:58,208 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:55:58,210 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:55:58,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:55:58,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:55:58,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:55:58,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:55:58" (1/1) ... [2019-10-14 23:55:58,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fbd8e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:58, skipping insertion in model container [2019-10-14 23:55:58,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:55:58" (1/1) ... [2019-10-14 23:55:58,226 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:55:58,280 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:55:58,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:55:58,803 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:55:58,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:55:58,970 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:55:58,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:58 WrapperNode [2019-10-14 23:55:58,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:55:58,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:55:58,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:55:58,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:55:58,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:58" (1/1) ... [2019-10-14 23:55:58,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:58" (1/1) ... [2019-10-14 23:55:59,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:58" (1/1) ... [2019-10-14 23:55:59,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:58" (1/1) ... [2019-10-14 23:55:59,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:58" (1/1) ... [2019-10-14 23:55:59,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:58" (1/1) ... [2019-10-14 23:55:59,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:58" (1/1) ... [2019-10-14 23:55:59,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:55:59,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:55:59,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:55:59,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:55:59,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:58" (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:55:59,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:55:59,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:55:59,141 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-14 23:55:59,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:55:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-14 23:55:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:55:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:55:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:55:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:55:59,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:55:59,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:56:00,278 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:56:00,279 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:56:00,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:56:00 BoogieIcfgContainer [2019-10-14 23:56:00,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:56:00,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:56:00,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:56:00,285 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:56:00,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:55:58" (1/3) ... [2019-10-14 23:56:00,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dcc4e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:56:00, skipping insertion in model container [2019-10-14 23:56:00,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:58" (2/3) ... [2019-10-14 23:56:00,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dcc4e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:56:00, skipping insertion in model container [2019-10-14 23:56:00,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:56:00" (3/3) ... [2019-10-14 23:56:00,289 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label12.c [2019-10-14 23:56:00,299 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:56:00,307 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:56:00,319 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:56:00,347 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:56:00,347 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:56:00,347 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:56:00,348 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:56:00,349 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:56:00,349 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:56:00,349 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:56:00,349 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:56:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-14 23:56:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-14 23:56:00,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:00,412 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:56:00,414 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:00,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:00,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1251139866, now seen corresponding path program 1 times [2019-10-14 23:56:00,430 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:00,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541741715] [2019-10-14 23:56:00,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:00,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:00,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:00,981 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:56:00,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541741715] [2019-10-14 23:56:00,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:56:00,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:56:00,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407749996] [2019-10-14 23:56:00,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:56:00,990 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:01,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:56:01,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:56:01,007 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-14 23:56:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:01,905 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2019-10-14 23:56:01,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:56:01,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-10-14 23:56:01,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:01,937 INFO L225 Difference]: With dead ends: 618 [2019-10-14 23:56:01,938 INFO L226 Difference]: Without dead ends: 320 [2019-10-14 23:56:01,951 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:56:01,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-14 23:56:02,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-14 23:56:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-14 23:56:02,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-14 23:56:02,050 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 124 [2019-10-14 23:56:02,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:02,051 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-14 23:56:02,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:56:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-14 23:56:02,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-14 23:56:02,056 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:02,056 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:56:02,056 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:02,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:02,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1267937665, now seen corresponding path program 1 times [2019-10-14 23:56:02,057 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:02,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452649638] [2019-10-14 23:56:02,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:02,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:02,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:02,395 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:56:02,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452649638] [2019-10-14 23:56:02,396 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:56:02,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:56:02,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681451426] [2019-10-14 23:56:02,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:56:02,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:02,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:56:02,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:56:02,400 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-14 23:56:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:03,017 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2019-10-14 23:56:03,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:56:03,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-10-14 23:56:03,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:03,024 INFO L225 Difference]: With dead ends: 721 [2019-10-14 23:56:03,025 INFO L226 Difference]: Without dead ends: 320 [2019-10-14 23:56:03,026 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:56:03,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-14 23:56:03,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-14 23:56:03,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-14 23:56:03,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-14 23:56:03,046 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 132 [2019-10-14 23:56:03,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:03,047 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-14 23:56:03,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:56:03,047 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-14 23:56:03,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-14 23:56:03,054 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:03,055 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:56:03,055 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:03,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:03,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1536784181, now seen corresponding path program 1 times [2019-10-14 23:56:03,056 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:03,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870288688] [2019-10-14 23:56:03,056 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:03,056 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:03,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:03,431 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:56:03,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870288688] [2019-10-14 23:56:03,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:56:03,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:56:03,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069541383] [2019-10-14 23:56:03,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:56:03,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:03,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:56:03,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:56:03,439 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-14 23:56:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:04,120 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2019-10-14 23:56:04,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:56:04,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-14 23:56:04,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:04,128 INFO L225 Difference]: With dead ends: 717 [2019-10-14 23:56:04,128 INFO L226 Difference]: Without dead ends: 320 [2019-10-14 23:56:04,129 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:56:04,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-14 23:56:04,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-14 23:56:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-14 23:56:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-14 23:56:04,156 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 138 [2019-10-14 23:56:04,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:04,157 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-14 23:56:04,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:56:04,157 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-14 23:56:04,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-14 23:56:04,159 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:04,159 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:56:04,160 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:04,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:04,160 INFO L82 PathProgramCache]: Analyzing trace with hash -564169218, now seen corresponding path program 1 times [2019-10-14 23:56:04,160 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:04,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092273708] [2019-10-14 23:56:04,161 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:04,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:04,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:04,266 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:56:04,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092273708] [2019-10-14 23:56:04,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:56:04,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:56:04,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626682290] [2019-10-14 23:56:04,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:56:04,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:04,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:56:04,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:56:04,270 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-14 23:56:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:05,103 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2019-10-14 23:56:05,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:56:05,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-10-14 23:56:05,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:05,108 INFO L225 Difference]: With dead ends: 951 [2019-10-14 23:56:05,108 INFO L226 Difference]: Without dead ends: 637 [2019-10-14 23:56:05,110 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:56:05,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-14 23:56:05,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-14 23:56:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-14 23:56:05,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 871 transitions. [2019-10-14 23:56:05,137 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 871 transitions. Word has length 146 [2019-10-14 23:56:05,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:05,137 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 871 transitions. [2019-10-14 23:56:05,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:56:05,137 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 871 transitions. [2019-10-14 23:56:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-14 23:56:05,140 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:05,141 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:56:05,141 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:05,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:05,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1274835258, now seen corresponding path program 1 times [2019-10-14 23:56:05,142 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:05,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673369027] [2019-10-14 23:56:05,142 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:05,142 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:05,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:05,372 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:56:05,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673369027] [2019-10-14 23:56:05,373 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:56:05,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:56:05,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376134803] [2019-10-14 23:56:05,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:56:05,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:05,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:56:05,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:56:05,375 INFO L87 Difference]: Start difference. First operand 626 states and 871 transitions. Second operand 5 states. [2019-10-14 23:56:06,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:06,029 INFO L93 Difference]: Finished difference Result 1330 states and 1903 transitions. [2019-10-14 23:56:06,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:56:06,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-14 23:56:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:06,034 INFO L225 Difference]: With dead ends: 1330 [2019-10-14 23:56:06,034 INFO L226 Difference]: Without dead ends: 626 [2019-10-14 23:56:06,036 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:56:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-14 23:56:06,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-14 23:56:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-14 23:56:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 859 transitions. [2019-10-14 23:56:06,058 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 859 transitions. Word has length 148 [2019-10-14 23:56:06,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:06,058 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 859 transitions. [2019-10-14 23:56:06,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:56:06,059 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 859 transitions. [2019-10-14 23:56:06,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-14 23:56:06,062 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:06,062 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:56:06,063 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:06,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:06,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1427723146, now seen corresponding path program 1 times [2019-10-14 23:56:06,064 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:06,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308744057] [2019-10-14 23:56:06,064 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:06,064 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:06,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:06,302 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:56:06,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308744057] [2019-10-14 23:56:06,304 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:56:06,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:56:06,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897866260] [2019-10-14 23:56:06,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:56:06,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:06,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:56:06,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:56:06,307 INFO L87 Difference]: Start difference. First operand 626 states and 859 transitions. Second operand 5 states. [2019-10-14 23:56:06,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:06,911 INFO L93 Difference]: Finished difference Result 1332 states and 1878 transitions. [2019-10-14 23:56:06,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:56:06,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-14 23:56:06,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:06,916 INFO L225 Difference]: With dead ends: 1332 [2019-10-14 23:56:06,916 INFO L226 Difference]: Without dead ends: 626 [2019-10-14 23:56:06,919 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:56:06,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-14 23:56:06,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-14 23:56:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-14 23:56:06,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 843 transitions. [2019-10-14 23:56:06,938 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 843 transitions. Word has length 150 [2019-10-14 23:56:06,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:06,939 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 843 transitions. [2019-10-14 23:56:06,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:56:06,939 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 843 transitions. [2019-10-14 23:56:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-14 23:56:06,942 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:06,942 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:56:06,943 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:06,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:06,943 INFO L82 PathProgramCache]: Analyzing trace with hash 392356590, now seen corresponding path program 1 times [2019-10-14 23:56:06,943 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:06,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653884760] [2019-10-14 23:56:06,944 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:06,944 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:06,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:07,018 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:56:07,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653884760] [2019-10-14 23:56:07,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:56:07,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:56:07,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614056711] [2019-10-14 23:56:07,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:56:07,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:07,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:56:07,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:56:07,020 INFO L87 Difference]: Start difference. First operand 626 states and 843 transitions. Second operand 6 states. [2019-10-14 23:56:07,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:07,721 INFO L93 Difference]: Finished difference Result 1858 states and 2601 transitions. [2019-10-14 23:56:07,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:56:07,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2019-10-14 23:56:07,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:07,731 INFO L225 Difference]: With dead ends: 1858 [2019-10-14 23:56:07,731 INFO L226 Difference]: Without dead ends: 1238 [2019-10-14 23:56:07,734 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:56:07,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-14 23:56:07,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-14 23:56:07,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-14 23:56:07,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1637 transitions. [2019-10-14 23:56:07,772 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1637 transitions. Word has length 154 [2019-10-14 23:56:07,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:07,772 INFO L462 AbstractCegarLoop]: Abstraction has 1218 states and 1637 transitions. [2019-10-14 23:56:07,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:56:07,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1637 transitions. [2019-10-14 23:56:07,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-14 23:56:07,777 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:07,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:07,778 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:07,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:07,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1102274855, now seen corresponding path program 1 times [2019-10-14 23:56:07,778 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:07,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93912595] [2019-10-14 23:56:07,779 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:07,779 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:07,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:07,908 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:56:07,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93912595] [2019-10-14 23:56:07,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892981354] [2019-10-14 23:56:07,909 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:56:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:08,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:56:08,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:56:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:56:08,163 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:56:08,271 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:56:08,272 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:56:08,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2019-10-14 23:56:08,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412568679] [2019-10-14 23:56:08,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:56:08,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:08,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:56:08,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:56:08,274 INFO L87 Difference]: Start difference. First operand 1218 states and 1637 transitions. Second operand 4 states. [2019-10-14 23:56:09,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:09,037 INFO L93 Difference]: Finished difference Result 2870 states and 3886 transitions. [2019-10-14 23:56:09,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:56:09,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-10-14 23:56:09,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:09,046 INFO L225 Difference]: With dead ends: 2870 [2019-10-14 23:56:09,047 INFO L226 Difference]: Without dead ends: 1658 [2019-10-14 23:56:09,050 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:56:09,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2019-10-14 23:56:09,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1657. [2019-10-14 23:56:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1657 states. [2019-10-14 23:56:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2100 transitions. [2019-10-14 23:56:09,097 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2100 transitions. Word has length 159 [2019-10-14 23:56:09,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:09,097 INFO L462 AbstractCegarLoop]: Abstraction has 1657 states and 2100 transitions. [2019-10-14 23:56:09,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:56:09,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2100 transitions. [2019-10-14 23:56:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-14 23:56:09,104 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:09,104 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:56:09,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:56:09,310 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:09,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:09,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1223928608, now seen corresponding path program 1 times [2019-10-14 23:56:09,311 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:09,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271581424] [2019-10-14 23:56:09,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:09,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:09,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:09,436 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:56:09,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271581424] [2019-10-14 23:56:09,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297710996] [2019-10-14 23:56:09,437 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:56:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:09,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:56:09,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:56:09,732 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:56:09,732 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:56:09,844 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:56:09,845 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:56:09,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-14 23:56:09,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047071851] [2019-10-14 23:56:09,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:56:09,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:09,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:56:09,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:56:09,848 INFO L87 Difference]: Start difference. First operand 1657 states and 2100 transitions. Second operand 3 states. [2019-10-14 23:56:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:10,447 INFO L93 Difference]: Finished difference Result 3889 states and 4958 transitions. [2019-10-14 23:56:10,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:56:10,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-10-14 23:56:10,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:10,463 INFO L225 Difference]: With dead ends: 3889 [2019-10-14 23:56:10,464 INFO L226 Difference]: Without dead ends: 2238 [2019-10-14 23:56:10,468 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 380 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:56:10,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2019-10-14 23:56:10,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 1806. [2019-10-14 23:56:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1806 states. [2019-10-14 23:56:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2284 transitions. [2019-10-14 23:56:10,536 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2284 transitions. Word has length 191 [2019-10-14 23:56:10,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:10,539 INFO L462 AbstractCegarLoop]: Abstraction has 1806 states and 2284 transitions. [2019-10-14 23:56:10,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:56:10,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2284 transitions. [2019-10-14 23:56:10,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-10-14 23:56:10,548 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:10,548 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:56:10,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:56:10,752 INFO L410 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:10,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:10,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2027928456, now seen corresponding path program 1 times [2019-10-14 23:56:10,753 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:10,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769537579] [2019-10-14 23:56:10,754 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:10,754 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:10,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 151 proven. 52 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-14 23:56:10,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769537579] [2019-10-14 23:56:10,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157245552] [2019-10-14 23:56:10,977 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:56:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:11,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:56:11,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:56:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 202 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:56:11,203 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:56:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 202 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:56:11,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1209643183] [2019-10-14 23:56:11,352 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 272 [2019-10-14 23:56:11,420 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-14 23:56:11,421 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)