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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label13.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:58:37,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:58:37,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:58:37,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:58:37,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:58:37,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:58:37,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:58:37,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:58:37,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:58:37,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:58:37,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:58:37,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:58:37,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:58:37,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:58:37,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:58:37,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:58:37,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:58:37,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:58:37,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:58:37,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:58:37,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:58:37,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:58:37,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:58:37,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:58:37,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:58:37,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:58:37,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:58:37,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:58:37,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:58:37,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:58:37,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:58:37,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:58:37,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:58:37,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:58:37,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:58:37,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:58:37,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:58:37,215 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:58:37,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:58:37,216 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:58:37,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:58:37,219 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-07 00:58:37,239 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:58:37,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:58:37,242 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:58:37,242 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:58:37,242 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:58:37,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:58:37,242 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:58:37,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:58:37,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:58:37,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:58:37,244 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:58:37,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:58:37,245 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:58:37,245 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:58:37,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:58:37,245 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:58:37,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:58:37,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:58:37,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:58:37,246 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:58:37,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:58:37,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:58:37,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:58:37,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:58:37,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:58:37,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:58:37,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:58:37,248 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:58:37,248 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 00:58:37,527 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:58:37,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:58:37,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:58:37,545 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:58:37,545 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:58:37,546 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label13.c [2019-10-07 00:58:37,609 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40a619967/fdcf1ef1296545eb9e2c94ec0880308e/FLAG930e32da8 [2019-10-07 00:58:38,292 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:58:38,293 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label13.c [2019-10-07 00:58:38,314 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40a619967/fdcf1ef1296545eb9e2c94ec0880308e/FLAG930e32da8 [2019-10-07 00:58:38,438 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40a619967/fdcf1ef1296545eb9e2c94ec0880308e [2019-10-07 00:58:38,449 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:58:38,451 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:58:38,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:58:38,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:58:38,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:58:38,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:58:38" (1/1) ... [2019-10-07 00:58:38,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fe0b11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:38, skipping insertion in model container [2019-10-07 00:58:38,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:58:38" (1/1) ... [2019-10-07 00:58:38,468 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:58:38,551 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:58:39,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:58:39,373 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:58:39,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:58:39,750 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:58:39,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:39 WrapperNode [2019-10-07 00:58:39,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:58:39,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:58:39,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:58:39,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:58:39,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:39" (1/1) ... [2019-10-07 00:58:39,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:39" (1/1) ... [2019-10-07 00:58:39,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:39" (1/1) ... [2019-10-07 00:58:39,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:39" (1/1) ... [2019-10-07 00:58:39,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:39" (1/1) ... [2019-10-07 00:58:39,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:39" (1/1) ... [2019-10-07 00:58:39,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:39" (1/1) ... [2019-10-07 00:58:39,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:58:39,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:58:39,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:58:39,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:58:39,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:39" (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-07 00:58:39,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:58:39,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:58:39,981 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 00:58:39,981 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:58:39,982 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 00:58:39,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:58:39,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:58:39,982 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 00:58:39,982 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:58:39,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:58:39,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:58:43,200 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:58:43,203 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:58:43,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:58:43 BoogieIcfgContainer [2019-10-07 00:58:43,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:58:43,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:58:43,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:58:43,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:58:43,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:58:38" (1/3) ... [2019-10-07 00:58:43,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da3e531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:58:43, skipping insertion in model container [2019-10-07 00:58:43,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:39" (2/3) ... [2019-10-07 00:58:43,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da3e531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:58:43, skipping insertion in model container [2019-10-07 00:58:43,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:58:43" (3/3) ... [2019-10-07 00:58:43,223 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label13.c [2019-10-07 00:58:43,236 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:58:43,245 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:58:43,257 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:58:43,286 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:58:43,286 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:58:43,286 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:58:43,287 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:58:43,287 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:58:43,287 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:58:43,287 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:58:43,287 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:58:43,311 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-10-07 00:58:43,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-07 00:58:43,326 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:43,327 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:58:43,329 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:43,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:43,336 INFO L82 PathProgramCache]: Analyzing trace with hash 136466726, now seen corresponding path program 1 times [2019-10-07 00:58:43,345 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:43,345 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:43,345 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:43,346 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:43,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:44,172 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-07 00:58:44,172 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:44,173 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:44,173 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:58:44,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:58:44,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:58:44,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:44,200 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2019-10-07 00:58:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:45,451 INFO L93 Difference]: Finished difference Result 462 states and 886 transitions. [2019-10-07 00:58:45,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:58:45,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-07 00:58:45,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:45,475 INFO L225 Difference]: With dead ends: 462 [2019-10-07 00:58:45,476 INFO L226 Difference]: Without dead ends: 301 [2019-10-07 00:58:45,482 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:45,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-07 00:58:45,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-10-07 00:58:45,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-07 00:58:45,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 564 transitions. [2019-10-07 00:58:45,575 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 564 transitions. Word has length 149 [2019-10-07 00:58:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:45,581 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 564 transitions. [2019-10-07 00:58:45,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:58:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 564 transitions. [2019-10-07 00:58:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-07 00:58:45,600 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:45,600 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:58:45,601 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:45,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:45,602 INFO L82 PathProgramCache]: Analyzing trace with hash 558836669, now seen corresponding path program 1 times [2019-10-07 00:58:45,602 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:45,602 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:45,602 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:45,603 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:45,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:45,853 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:45,853 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:45,853 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:58:45,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:58:45,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:58:45,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:58:45,857 INFO L87 Difference]: Start difference. First operand 301 states and 564 transitions. Second operand 6 states. [2019-10-07 00:58:47,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:47,396 INFO L93 Difference]: Finished difference Result 929 states and 1794 transitions. [2019-10-07 00:58:47,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:58:47,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2019-10-07 00:58:47,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:47,405 INFO L225 Difference]: With dead ends: 929 [2019-10-07 00:58:47,405 INFO L226 Difference]: Without dead ends: 633 [2019-10-07 00:58:47,408 INFO L606 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-07 00:58:47,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-07 00:58:47,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 603. [2019-10-07 00:58:47,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-07 00:58:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1113 transitions. [2019-10-07 00:58:47,467 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1113 transitions. Word has length 158 [2019-10-07 00:58:47,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:47,467 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1113 transitions. [2019-10-07 00:58:47,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:58:47,467 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1113 transitions. [2019-10-07 00:58:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-07 00:58:47,471 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:47,471 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:58:47,471 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:47,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:47,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1532435182, now seen corresponding path program 1 times [2019-10-07 00:58:47,472 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:47,472 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:47,472 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:47,472 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:47,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:47,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:47,755 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:47,757 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:47,758 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:58:47,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:58:47,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:58:47,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:47,761 INFO L87 Difference]: Start difference. First operand 603 states and 1113 transitions. Second operand 3 states. [2019-10-07 00:58:48,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:48,925 INFO L93 Difference]: Finished difference Result 1793 states and 3375 transitions. [2019-10-07 00:58:48,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:58:48,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-07 00:58:48,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:48,935 INFO L225 Difference]: With dead ends: 1793 [2019-10-07 00:58:48,935 INFO L226 Difference]: Without dead ends: 1195 [2019-10-07 00:58:48,938 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:48,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-10-07 00:58:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1195. [2019-10-07 00:58:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1195 states. [2019-10-07 00:58:48,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 2084 transitions. [2019-10-07 00:58:48,994 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 2084 transitions. Word has length 161 [2019-10-07 00:58:48,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:48,995 INFO L462 AbstractCegarLoop]: Abstraction has 1195 states and 2084 transitions. [2019-10-07 00:58:48,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:58:48,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2084 transitions. [2019-10-07 00:58:49,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-07 00:58:49,002 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:49,003 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:58:49,003 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:49,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:49,004 INFO L82 PathProgramCache]: Analyzing trace with hash -627087197, now seen corresponding path program 1 times [2019-10-07 00:58:49,004 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:49,004 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:49,004 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:49,005 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:49,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:49,308 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:49,309 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:49,309 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:49,309 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:58:49,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:58:49,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:58:49,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:49,311 INFO L87 Difference]: Start difference. First operand 1195 states and 2084 transitions. Second operand 3 states. [2019-10-07 00:58:50,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:50,436 INFO L93 Difference]: Finished difference Result 3569 states and 6418 transitions. [2019-10-07 00:58:50,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:58:50,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-10-07 00:58:50,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:50,456 INFO L225 Difference]: With dead ends: 3569 [2019-10-07 00:58:50,456 INFO L226 Difference]: Without dead ends: 2379 [2019-10-07 00:58:50,461 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:50,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2019-10-07 00:58:50,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2379. [2019-10-07 00:58:50,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2379 states. [2019-10-07 00:58:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 4004 transitions. [2019-10-07 00:58:50,545 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 4004 transitions. Word has length 181 [2019-10-07 00:58:50,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:50,546 INFO L462 AbstractCegarLoop]: Abstraction has 2379 states and 4004 transitions. [2019-10-07 00:58:50,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:58:50,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 4004 transitions. [2019-10-07 00:58:50,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-07 00:58:50,556 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:50,557 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:58:50,557 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:50,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:50,557 INFO L82 PathProgramCache]: Analyzing trace with hash 712250693, now seen corresponding path program 1 times [2019-10-07 00:58:50,558 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:50,558 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:50,558 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:50,558 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:50,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:50,762 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:50,762 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:50,762 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:58:50,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:58:50,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:58:50,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:58:50,764 INFO L87 Difference]: Start difference. First operand 2379 states and 4004 transitions. Second operand 6 states. [2019-10-07 00:58:52,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:52,213 INFO L93 Difference]: Finished difference Result 6993 states and 12761 transitions. [2019-10-07 00:58:52,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:58:52,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2019-10-07 00:58:52,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:52,251 INFO L225 Difference]: With dead ends: 6993 [2019-10-07 00:58:52,251 INFO L226 Difference]: Without dead ends: 4619 [2019-10-07 00:58:52,261 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:58:52,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2019-10-07 00:58:52,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4555. [2019-10-07 00:58:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4555 states. [2019-10-07 00:58:52,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4555 states to 4555 states and 7055 transitions. [2019-10-07 00:58:52,430 INFO L78 Accepts]: Start accepts. Automaton has 4555 states and 7055 transitions. Word has length 186 [2019-10-07 00:58:52,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:52,430 INFO L462 AbstractCegarLoop]: Abstraction has 4555 states and 7055 transitions. [2019-10-07 00:58:52,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:58:52,430 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 7055 transitions. [2019-10-07 00:58:52,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-07 00:58:52,446 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:52,446 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:58:52,446 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:52,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:52,447 INFO L82 PathProgramCache]: Analyzing trace with hash 938378696, now seen corresponding path program 1 times [2019-10-07 00:58:52,447 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:52,447 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:52,447 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:52,448 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:52,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:52,689 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:52,690 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:52,690 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:52,690 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:58:52,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:58:52,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:58:52,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:58:52,692 INFO L87 Difference]: Start difference. First operand 4555 states and 7055 transitions. Second operand 6 states. [2019-10-07 00:58:54,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:54,303 INFO L93 Difference]: Finished difference Result 11122 states and 17797 transitions. [2019-10-07 00:58:54,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:58:54,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2019-10-07 00:58:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:54,362 INFO L225 Difference]: With dead ends: 11122 [2019-10-07 00:58:54,362 INFO L226 Difference]: Without dead ends: 6572 [2019-10-07 00:58:54,380 INFO L606 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-07 00:58:54,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6572 states. [2019-10-07 00:58:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6572 to 6528. [2019-10-07 00:58:54,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6528 states. [2019-10-07 00:58:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6528 states to 6528 states and 9917 transitions. [2019-10-07 00:58:54,633 INFO L78 Accepts]: Start accepts. Automaton has 6528 states and 9917 transitions. Word has length 207 [2019-10-07 00:58:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:54,634 INFO L462 AbstractCegarLoop]: Abstraction has 6528 states and 9917 transitions. [2019-10-07 00:58:54,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:58:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand 6528 states and 9917 transitions. [2019-10-07 00:58:54,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-07 00:58:54,653 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:54,653 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:58:54,654 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:54,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:54,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1573941140, now seen corresponding path program 1 times [2019-10-07 00:58:54,658 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:54,658 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:54,659 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:54,659 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:54,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:58:54,936 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:54,944 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:58:54,945 INFO L95 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-07 00:58:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:55,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-07 00:58:55,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:58:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-07 00:58:55,333 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:58:55,440 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 62 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-07 00:58:55,441 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 00:58:55,441 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-07 00:58:55,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:58:55,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:58:55,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-07 00:58:55,442 INFO L87 Difference]: Start difference. First operand 6528 states and 9917 transitions. Second operand 5 states. [2019-10-07 00:58:57,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:57,226 INFO L93 Difference]: Finished difference Result 18240 states and 29336 transitions. [2019-10-07 00:58:57,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:58:57,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 220 [2019-10-07 00:58:57,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:57,311 INFO L225 Difference]: With dead ends: 18240 [2019-10-07 00:58:57,311 INFO L226 Difference]: Without dead ends: 11717 [2019-10-07 00:58:57,332 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-07 00:58:57,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11717 states. [2019-10-07 00:58:57,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11717 to 11601. [2019-10-07 00:58:57,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11601 states. [2019-10-07 00:58:57,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11601 states to 11601 states and 17968 transitions. [2019-10-07 00:58:57,782 INFO L78 Accepts]: Start accepts. Automaton has 11601 states and 17968 transitions. Word has length 220 [2019-10-07 00:58:57,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:57,782 INFO L462 AbstractCegarLoop]: Abstraction has 11601 states and 17968 transitions. [2019-10-07 00:58:57,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:58:57,783 INFO L276 IsEmpty]: Start isEmpty. Operand 11601 states and 17968 transitions. [2019-10-07 00:58:57,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-07 00:58:57,819 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:57,820 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:58:58,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:58:58,025 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:58,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:58,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1496195916, now seen corresponding path program 1 times [2019-10-07 00:58:58,026 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:58,026 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:58,027 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:58,027 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:58,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:58,439 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 95 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:58,439 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:58,440 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:58:58,440 INFO L95 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-07 00:58:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:58,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-07 00:58:58,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:58:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-07 00:58:58,809 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:58:58,946 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-10-07 00:58:59,200 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-10-07 00:58:59,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:59,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:59,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:59,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:59,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:58:59,343 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:58:59,343 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 00:58:59,344 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-10-07 00:58:59,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:58:59,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:58:59,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-07 00:58:59,345 INFO L87 Difference]: Start difference. First operand 11601 states and 17968 transitions. Second operand 5 states. [2019-10-07 00:59:00,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:00,627 INFO L93 Difference]: Finished difference Result 23255 states and 36222 transitions. [2019-10-07 00:59:00,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:59:00,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 238 [2019-10-07 00:59:00,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:00,698 INFO L225 Difference]: With dead ends: 23255 [2019-10-07 00:59:00,699 INFO L226 Difference]: Without dead ends: 11659 [2019-10-07 00:59:00,739 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-10-07 00:59:00,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11659 states. [2019-10-07 00:59:00,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11659 to 11603. [2019-10-07 00:59:00,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11603 states. [2019-10-07 00:59:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11603 states to 11603 states and 17771 transitions. [2019-10-07 00:59:01,020 INFO L78 Accepts]: Start accepts. Automaton has 11603 states and 17771 transitions. Word has length 238 [2019-10-07 00:59:01,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:01,021 INFO L462 AbstractCegarLoop]: Abstraction has 11603 states and 17771 transitions. [2019-10-07 00:59:01,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:59:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 11603 states and 17771 transitions. [2019-10-07 00:59:01,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-07 00:59:01,058 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:01,058 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:59:01,265 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:01,265 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:01,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:01,266 INFO L82 PathProgramCache]: Analyzing trace with hash 847642229, now seen corresponding path program 1 times [2019-10-07 00:59:01,266 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:01,266 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:01,266 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:01,266 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:01,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:01,775 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:01,775 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:59:01,775 INFO L95 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-07 00:59:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:02,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-07 00:59:02,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:59:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:02,158 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:59:02,475 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 42 [2019-10-07 00:59:02,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:59:02,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:59:02,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:59:02,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:59:02,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:59:02,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:59:02,768 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:02,769 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:59:02,823 INFO L162 IcfgInterpreter]: Started Sifa with 153 locations of interest [2019-10-07 00:59:02,823 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:59:02,838 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:59:02,846 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:59:02,847 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:59:03,365 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2019-10-07 00:59:03,724 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 206 for LOIs [2019-10-07 00:59:03,977 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 298 [2019-10-07 00:59:04,289 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2019-10-07 00:59:04,571 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 310 [2019-10-07 00:59:05,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:05,535 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 00:59:05,546 INFO L168 Benchmark]: Toolchain (without parser) took 27093.08 ms. Allocated memory was 137.4 MB in the beginning and 835.2 MB in the end (delta: 697.8 MB). Free memory was 97.2 MB in the beginning and 685.1 MB in the end (delta: -587.9 MB). Peak memory consumption was 109.9 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:05,548 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 00:59:05,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1299.88 ms. Allocated memory was 137.4 MB in the beginning and 230.7 MB in the end (delta: 93.3 MB). Free memory was 97.0 MB in the beginning and 178.7 MB in the end (delta: -81.7 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:05,558 INFO L168 Benchmark]: Boogie Preprocessor took 171.90 ms. Allocated memory is still 230.7 MB. Free memory was 178.7 MB in the beginning and 167.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:05,559 INFO L168 Benchmark]: RCFGBuilder took 3281.14 ms. Allocated memory was 230.7 MB in the beginning and 347.6 MB in the end (delta: 116.9 MB). Free memory was 167.7 MB in the beginning and 280.4 MB in the end (delta: -112.7 MB). Peak memory consumption was 128.6 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:05,561 INFO L168 Benchmark]: TraceAbstraction took 22335.06 ms. Allocated memory was 347.6 MB in the beginning and 835.2 MB in the end (delta: 487.6 MB). Free memory was 280.4 MB in the beginning and 685.1 MB in the end (delta: -404.7 MB). Peak memory consumption was 82.9 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:05,565 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1299.88 ms. Allocated memory was 137.4 MB in the beginning and 230.7 MB in the end (delta: 93.3 MB). Free memory was 97.0 MB in the beginning and 178.7 MB in the end (delta: -81.7 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 171.90 ms. Allocated memory is still 230.7 MB. Free memory was 178.7 MB in the beginning and 167.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3281.14 ms. Allocated memory was 230.7 MB in the beginning and 347.6 MB in the end (delta: 116.9 MB). Free memory was 167.7 MB in the beginning and 280.4 MB in the end (delta: -112.7 MB). Peak memory consumption was 128.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22335.06 ms. Allocated memory was 347.6 MB in the beginning and 835.2 MB in the end (delta: 487.6 MB). Free memory was 280.4 MB in the beginning and 685.1 MB in the end (delta: -404.7 MB). Peak memory consumption was 82.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true;: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...