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/Problem16_label35.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:32:16,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:32:16,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:32:16,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:32:16,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:32:16,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:32:16,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:32:16,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:32:16,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:32:16,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:32:16,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:32:16,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:32:16,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:32:16,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:32:16,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:32:16,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:32:16,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:32:16,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:32:16,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:32:16,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:32:16,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:32:16,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:32:16,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:32:16,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:32:16,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:32:16,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:32:16,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:32:16,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:32:16,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:32:16,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:32:16,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:32:16,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:32:16,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:32:16,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:32:16,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:32:16,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:32:16,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:32:16,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:32:16,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:32:16,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:32:16,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:32:16,424 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 03:32:16,449 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:32:16,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:32:16,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:32:16,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:32:16,452 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:32:16,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:32:16,453 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:32:16,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:32:16,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:32:16,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:32:16,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:32:16,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:32:16,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:32:16,455 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:32:16,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:32:16,455 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:32:16,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:32:16,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:32:16,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:32:16,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:32:16,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:32:16,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:32:16,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:32:16,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:32:16,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:32:16,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:32:16,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:32:16,458 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:32:16,458 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 03:32:16,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:32:16,744 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:32:16,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:32:16,749 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:32:16,750 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:32:16,750 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label35.c [2019-10-07 03:32:16,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/284c1b132/900584525b0d4d1793bfe0cb52e7f711/FLAG8fc00e667 [2019-10-07 03:32:17,423 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:32:17,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label35.c [2019-10-07 03:32:17,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/284c1b132/900584525b0d4d1793bfe0cb52e7f711/FLAG8fc00e667 [2019-10-07 03:32:17,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/284c1b132/900584525b0d4d1793bfe0cb52e7f711 [2019-10-07 03:32:17,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:32:17,655 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:32:17,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:32:17,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:32:17,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:32:17,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:32:17" (1/1) ... [2019-10-07 03:32:17,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51fe3b84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:32:17, skipping insertion in model container [2019-10-07 03:32:17,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:32:17" (1/1) ... [2019-10-07 03:32:17,671 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:32:17,753 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:32:18,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:32:18,657 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:32:19,081 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:32:19,103 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:32:19,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:32:19 WrapperNode [2019-10-07 03:32:19,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:32:19,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:32:19,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:32:19,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:32:19,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:32:19" (1/1) ... [2019-10-07 03:32:19,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:32:19" (1/1) ... [2019-10-07 03:32:19,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:32:19" (1/1) ... [2019-10-07 03:32:19,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:32:19" (1/1) ... [2019-10-07 03:32:19,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:32:19" (1/1) ... [2019-10-07 03:32:19,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:32:19" (1/1) ... [2019-10-07 03:32:19,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:32:19" (1/1) ... [2019-10-07 03:32:19,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:32:19,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:32:19,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:32:19,286 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:32:19,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:32:19" (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 03:32:19,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:32:19,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:32:19,345 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 03:32:19,345 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-07 03:32:19,346 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:32:19,346 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 03:32:19,346 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-07 03:32:19,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:32:19,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:32:19,347 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:32:19,347 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:32:19,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:32:19,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:32:30,793 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:32:30,794 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 03:32:30,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:32:30 BoogieIcfgContainer [2019-10-07 03:32:30,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:32:30,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:32:30,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:32:30,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:32:30,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:32:17" (1/3) ... [2019-10-07 03:32:30,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4686fce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:32:30, skipping insertion in model container [2019-10-07 03:32:30,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:32:19" (2/3) ... [2019-10-07 03:32:30,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4686fce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:32:30, skipping insertion in model container [2019-10-07 03:32:30,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:32:30" (3/3) ... [2019-10-07 03:32:30,804 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label35.c [2019-10-07 03:32:30,814 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:32:30,822 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 03:32:30,833 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 03:32:30,861 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:32:30,862 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:32:30,862 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:32:30,862 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:32:30,862 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:32:30,862 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:32:30,863 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:32:30,863 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:32:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states. [2019-10-07 03:32:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 03:32:30,892 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:32:30,893 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:32:30,895 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:32:30,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:32:30,900 INFO L82 PathProgramCache]: Analyzing trace with hash 863563327, now seen corresponding path program 1 times [2019-10-07 03:32:30,906 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:32:30,907 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:30,907 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:30,907 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:30,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:32:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:32:31,139 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 03:32:31,139 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:31,140 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:32:31,140 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:32:31,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:32:31,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:32:31,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:32:31,162 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 4 states. [2019-10-07 03:32:33,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:32:33,651 INFO L93 Difference]: Finished difference Result 953 states and 1852 transitions. [2019-10-07 03:32:33,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:32:33,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 03:32:33,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:32:33,685 INFO L225 Difference]: With dead ends: 953 [2019-10-07 03:32:33,687 INFO L226 Difference]: Without dead ends: 702 [2019-10-07 03:32:33,701 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:32:33,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-10-07 03:32:33,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 463. [2019-10-07 03:32:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-10-07 03:32:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 876 transitions. [2019-10-07 03:32:33,856 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 876 transitions. Word has length 11 [2019-10-07 03:32:33,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:32:33,856 INFO L462 AbstractCegarLoop]: Abstraction has 463 states and 876 transitions. [2019-10-07 03:32:33,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:32:33,857 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 876 transitions. [2019-10-07 03:32:33,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 03:32:33,859 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:32:33,859 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:32:33,860 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:32:33,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:32:33,861 INFO L82 PathProgramCache]: Analyzing trace with hash 163966973, now seen corresponding path program 1 times [2019-10-07 03:32:33,862 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:32:33,862 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:33,862 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:33,862 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:33,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:32:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:32:34,018 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-07 03:32:34,019 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:34,019 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:32:34,019 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:32:34,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:32:34,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:32:34,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:32:34,021 INFO L87 Difference]: Start difference. First operand 463 states and 876 transitions. Second operand 5 states. [2019-10-07 03:32:38,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:32:38,147 INFO L93 Difference]: Finished difference Result 1395 states and 2674 transitions. [2019-10-07 03:32:38,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:32:38,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-07 03:32:38,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:32:38,156 INFO L225 Difference]: With dead ends: 1395 [2019-10-07 03:32:38,156 INFO L226 Difference]: Without dead ends: 937 [2019-10-07 03:32:38,158 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-07 03:32:38,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-10-07 03:32:38,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 918. [2019-10-07 03:32:38,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2019-10-07 03:32:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1637 transitions. [2019-10-07 03:32:38,232 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1637 transitions. Word has length 21 [2019-10-07 03:32:38,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:32:38,232 INFO L462 AbstractCegarLoop]: Abstraction has 918 states and 1637 transitions. [2019-10-07 03:32:38,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:32:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1637 transitions. [2019-10-07 03:32:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 03:32:38,234 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:32:38,234 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:32:38,235 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:32:38,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:32:38,235 INFO L82 PathProgramCache]: Analyzing trace with hash 532151662, now seen corresponding path program 1 times [2019-10-07 03:32:38,235 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:32:38,236 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:38,236 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:38,237 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:38,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:32:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:32:38,390 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-07 03:32:38,391 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:38,391 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:32:38,391 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:32:38,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:32:38,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:32:38,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:32:38,393 INFO L87 Difference]: Start difference. First operand 918 states and 1637 transitions. Second operand 6 states. [2019-10-07 03:32:40,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:32:40,449 INFO L93 Difference]: Finished difference Result 2531 states and 4571 transitions. [2019-10-07 03:32:40,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:32:40,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-07 03:32:40,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:32:40,463 INFO L225 Difference]: With dead ends: 2531 [2019-10-07 03:32:40,463 INFO L226 Difference]: Without dead ends: 1618 [2019-10-07 03:32:40,466 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 03:32:40,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2019-10-07 03:32:40,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1594. [2019-10-07 03:32:40,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1594 states. [2019-10-07 03:32:40,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2779 transitions. [2019-10-07 03:32:40,547 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2779 transitions. Word has length 24 [2019-10-07 03:32:40,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:32:40,548 INFO L462 AbstractCegarLoop]: Abstraction has 1594 states and 2779 transitions. [2019-10-07 03:32:40,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:32:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2779 transitions. [2019-10-07 03:32:40,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-07 03:32:40,549 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:32:40,549 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:32:40,550 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:32:40,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:32:40,550 INFO L82 PathProgramCache]: Analyzing trace with hash 336021045, now seen corresponding path program 1 times [2019-10-07 03:32:40,550 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:32:40,551 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:40,551 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:40,552 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:40,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:32:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:32:40,645 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-07 03:32:40,646 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:40,646 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:32:40,648 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:32:40,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:32:40,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:32:40,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:32:40,649 INFO L87 Difference]: Start difference. First operand 1594 states and 2779 transitions. Second operand 6 states. [2019-10-07 03:32:42,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:32:42,664 INFO L93 Difference]: Finished difference Result 3661 states and 6383 transitions. [2019-10-07 03:32:42,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:32:42,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-07 03:32:42,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:32:42,678 INFO L225 Difference]: With dead ends: 3661 [2019-10-07 03:32:42,678 INFO L226 Difference]: Without dead ends: 2072 [2019-10-07 03:32:42,682 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 03:32:42,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-10-07 03:32:42,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1974. [2019-10-07 03:32:42,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1974 states. [2019-10-07 03:32:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 3150 transitions. [2019-10-07 03:32:42,756 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 3150 transitions. Word has length 25 [2019-10-07 03:32:42,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:32:42,756 INFO L462 AbstractCegarLoop]: Abstraction has 1974 states and 3150 transitions. [2019-10-07 03:32:42,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:32:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 3150 transitions. [2019-10-07 03:32:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 03:32:42,758 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:32:42,758 INFO L385 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] [2019-10-07 03:32:42,758 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:32:42,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:32:42,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1761284058, now seen corresponding path program 1 times [2019-10-07 03:32:42,759 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:32:42,759 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:42,759 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:42,759 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:42,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:32:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:32:42,835 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-07 03:32:42,835 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:42,836 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:32:42,836 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:32:42,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:32:42,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:32:42,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:32:42,837 INFO L87 Difference]: Start difference. First operand 1974 states and 3150 transitions. Second operand 6 states. [2019-10-07 03:32:44,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:32:44,808 INFO L93 Difference]: Finished difference Result 5108 states and 8377 transitions. [2019-10-07 03:32:44,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 03:32:44,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-10-07 03:32:44,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:32:44,830 INFO L225 Difference]: With dead ends: 5108 [2019-10-07 03:32:44,830 INFO L226 Difference]: Without dead ends: 3139 [2019-10-07 03:32:44,836 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-07 03:32:44,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2019-10-07 03:32:44,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 3067. [2019-10-07 03:32:44,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3067 states. [2019-10-07 03:32:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4847 transitions. [2019-10-07 03:32:44,943 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4847 transitions. Word has length 28 [2019-10-07 03:32:44,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:32:44,944 INFO L462 AbstractCegarLoop]: Abstraction has 3067 states and 4847 transitions. [2019-10-07 03:32:44,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:32:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4847 transitions. [2019-10-07 03:32:44,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-07 03:32:44,946 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:32:44,947 INFO L385 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] [2019-10-07 03:32:44,947 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:32:44,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:32:44,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1572697494, now seen corresponding path program 1 times [2019-10-07 03:32:44,948 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:32:44,948 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:44,948 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:44,948 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:44,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:32:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:32:45,054 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-07 03:32:45,055 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:45,055 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:32:45,056 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:32:45,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:32:45,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:32:45,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:32:45,057 INFO L87 Difference]: Start difference. First operand 3067 states and 4847 transitions. Second operand 6 states. [2019-10-07 03:32:49,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:32:49,133 INFO L93 Difference]: Finished difference Result 8110 states and 13134 transitions. [2019-10-07 03:32:49,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:32:49,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-10-07 03:32:49,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:32:49,158 INFO L225 Difference]: With dead ends: 8110 [2019-10-07 03:32:49,159 INFO L226 Difference]: Without dead ends: 5048 [2019-10-07 03:32:49,168 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 03:32:49,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5048 states. [2019-10-07 03:32:49,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5048 to 4116. [2019-10-07 03:32:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4116 states. [2019-10-07 03:32:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 6098 transitions. [2019-10-07 03:32:49,292 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 6098 transitions. Word has length 36 [2019-10-07 03:32:49,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:32:49,293 INFO L462 AbstractCegarLoop]: Abstraction has 4116 states and 6098 transitions. [2019-10-07 03:32:49,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:32:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 6098 transitions. [2019-10-07 03:32:49,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-07 03:32:49,301 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:32:49,305 INFO L385 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] [2019-10-07 03:32:49,305 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:32:49,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:32:49,305 INFO L82 PathProgramCache]: Analyzing trace with hash -103647695, now seen corresponding path program 1 times [2019-10-07 03:32:49,306 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:32:49,306 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:49,306 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:49,306 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:49,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:32:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:32:49,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 03:32:49,384 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:49,384 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:32:49,384 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 03:32:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:32:49,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 03:32:49,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:32:49,542 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-07 03:32:49,542 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:32:49,574 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-07 03:32:49,574 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 03:32:49,575 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-07 03:32:49,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:32:49,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:32:49,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:32:49,576 INFO L87 Difference]: Start difference. First operand 4116 states and 6098 transitions. Second operand 4 states. [2019-10-07 03:32:51,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:32:51,978 INFO L93 Difference]: Finished difference Result 11921 states and 17880 transitions. [2019-10-07 03:32:51,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:32:51,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-10-07 03:32:51,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:32:52,018 INFO L225 Difference]: With dead ends: 11921 [2019-10-07 03:32:52,019 INFO L226 Difference]: Without dead ends: 7810 [2019-10-07 03:32:52,032 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:32:52,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7810 states. [2019-10-07 03:32:52,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7810 to 6661. [2019-10-07 03:32:52,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6661 states. [2019-10-07 03:32:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 9624 transitions. [2019-10-07 03:32:52,236 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 9624 transitions. Word has length 43 [2019-10-07 03:32:52,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:32:52,237 INFO L462 AbstractCegarLoop]: Abstraction has 6661 states and 9624 transitions. [2019-10-07 03:32:52,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:32:52,237 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 9624 transitions. [2019-10-07 03:32:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-07 03:32:52,242 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:32:52,243 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:32:52,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:32:52,455 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:32:52,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:32:52,455 INFO L82 PathProgramCache]: Analyzing trace with hash -369746813, now seen corresponding path program 1 times [2019-10-07 03:32:52,456 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:32:52,456 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:52,456 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:52,456 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:52,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:32:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:32:52,702 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-07 03:32:52,702 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:52,702 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:32:52,703 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 03:32:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:32:52,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 03:32:52,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:32:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-07 03:32:52,938 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:32:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-07 03:32:52,991 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 03:32:52,992 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-07 03:32:52,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:32:52,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:32:52,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:32:52,995 INFO L87 Difference]: Start difference. First operand 6661 states and 9624 transitions. Second operand 4 states. [2019-10-07 03:32:54,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:32:54,645 INFO L93 Difference]: Finished difference Result 14897 states and 21154 transitions. [2019-10-07 03:32:54,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:32:54,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-10-07 03:32:54,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:32:54,690 INFO L225 Difference]: With dead ends: 14897 [2019-10-07 03:32:54,690 INFO L226 Difference]: Without dead ends: 8241 [2019-10-07 03:32:54,709 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:32:54,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8241 states. [2019-10-07 03:32:54,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8241 to 6677. [2019-10-07 03:32:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6677 states. [2019-10-07 03:32:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6677 states to 6677 states and 9519 transitions. [2019-10-07 03:32:54,887 INFO L78 Accepts]: Start accepts. Automaton has 6677 states and 9519 transitions. Word has length 155 [2019-10-07 03:32:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:32:54,888 INFO L462 AbstractCegarLoop]: Abstraction has 6677 states and 9519 transitions. [2019-10-07 03:32:54,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:32:54,888 INFO L276 IsEmpty]: Start isEmpty. Operand 6677 states and 9519 transitions. [2019-10-07 03:32:54,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-10-07 03:32:54,898 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:32:54,899 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:32:55,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:32:55,105 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:32:55,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:32:55,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1061876882, now seen corresponding path program 1 times [2019-10-07 03:32:55,106 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:32:55,106 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:55,106 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:55,106 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:55,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:32:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:32:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 37 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 03:32:55,865 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:55,865 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:32:55,865 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 03:32:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:32:56,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 03:32:56,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:32:56,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:32:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 03:32:56,160 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:32:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 37 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 03:32:56,317 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 03:32:56,318 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2019-10-07 03:32:56,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:32:56,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:32:56,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-07 03:32:56,323 INFO L87 Difference]: Start difference. First operand 6677 states and 9519 transitions. Second operand 5 states. [2019-10-07 03:33:01,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:33:01,036 INFO L93 Difference]: Finished difference Result 16147 states and 23045 transitions. [2019-10-07 03:33:01,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 03:33:01,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 285 [2019-10-07 03:33:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:33:01,077 INFO L225 Difference]: With dead ends: 16147 [2019-10-07 03:33:01,077 INFO L226 Difference]: Without dead ends: 9475 [2019-10-07 03:33:01,097 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 567 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-10-07 03:33:01,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9475 states. [2019-10-07 03:33:01,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9475 to 9056. [2019-10-07 03:33:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9056 states. [2019-10-07 03:33:01,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9056 states to 9056 states and 12670 transitions. [2019-10-07 03:33:01,370 INFO L78 Accepts]: Start accepts. Automaton has 9056 states and 12670 transitions. Word has length 285 [2019-10-07 03:33:01,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:33:01,371 INFO L462 AbstractCegarLoop]: Abstraction has 9056 states and 12670 transitions. [2019-10-07 03:33:01,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:33:01,371 INFO L276 IsEmpty]: Start isEmpty. Operand 9056 states and 12670 transitions. [2019-10-07 03:33:01,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-10-07 03:33:01,395 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:33:01,395 INFO L385 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-07 03:33:01,600 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:33:01,601 INFO L410 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:33:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:33:01,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1452769196, now seen corresponding path program 1 times [2019-10-07 03:33:01,602 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:33:01,603 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:33:01,603 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:33:01,603 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:33:01,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:33:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:33:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 117 proven. 37 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-10-07 03:33:02,151 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:33:02,151 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:33:02,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:33:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:33:02,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 1143 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 03:33:02,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:33:02,503 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 329 proven. 2 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-07 03:33:02,504 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:33:02,667 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 117 proven. 37 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-10-07 03:33:02,667 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:33:02,718 INFO L162 IcfgInterpreter]: Started Sifa with 197 locations of interest [2019-10-07 03:33:02,718 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:33:02,724 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:33:02,733 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:33:02,733 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:33:02,977 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 57 for LOIs [2019-10-07 03:33:03,298 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 35 [2019-10-07 03:33:03,478 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 35 [2019-10-07 03:33:03,627 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 26 [2019-10-07 03:33:03,683 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 26 [2019-10-07 03:33:04,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:33:04,008 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.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:178) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:169) 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 03:33:04,016 INFO L168 Benchmark]: Toolchain (without parser) took 46359.60 ms. Allocated memory was 137.9 MB in the beginning and 785.4 MB in the end (delta: 647.5 MB). Free memory was 98.3 MB in the beginning and 399.0 MB in the end (delta: -300.7 MB). Peak memory consumption was 346.8 MB. Max. memory is 7.1 GB. [2019-10-07 03:33:04,017 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 03:33:04,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1449.08 ms. Allocated memory was 137.9 MB in the beginning and 203.9 MB in the end (delta: 66.1 MB). Free memory was 98.1 MB in the beginning and 126.3 MB in the end (delta: -28.3 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. [2019-10-07 03:33:04,019 INFO L168 Benchmark]: Boogie Preprocessor took 179.75 ms. Allocated memory is still 203.9 MB. Free memory was 126.3 MB in the beginning and 115.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-10-07 03:33:04,020 INFO L168 Benchmark]: RCFGBuilder took 11510.98 ms. Allocated memory was 203.9 MB in the beginning and 300.9 MB in the end (delta: 97.0 MB). Free memory was 115.4 MB in the beginning and 101.9 MB in the end (delta: 13.5 MB). Peak memory consumption was 141.4 MB. Max. memory is 7.1 GB. [2019-10-07 03:33:04,021 INFO L168 Benchmark]: TraceAbstraction took 33215.55 ms. Allocated memory was 300.9 MB in the beginning and 785.4 MB in the end (delta: 484.4 MB). Free memory was 101.9 MB in the beginning and 399.0 MB in the end (delta: -297.1 MB). Peak memory consumption was 187.4 MB. Max. memory is 7.1 GB. [2019-10-07 03:33:04,025 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.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1449.08 ms. Allocated memory was 137.9 MB in the beginning and 203.9 MB in the end (delta: 66.1 MB). Free memory was 98.1 MB in the beginning and 126.3 MB in the end (delta: -28.3 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 179.75 ms. Allocated memory is still 203.9 MB. Free memory was 126.3 MB in the beginning and 115.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11510.98 ms. Allocated memory was 203.9 MB in the beginning and 300.9 MB in the end (delta: 97.0 MB). Free memory was 115.4 MB in the beginning and 101.9 MB in the end (delta: 13.5 MB). Peak memory consumption was 141.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33215.55 ms. Allocated memory was 300.9 MB in the beginning and 785.4 MB in the end (delta: 484.4 MB). Free memory was 101.9 MB in the beginning and 399.0 MB in the end (delta: -297.1 MB). Peak memory consumption was 187.4 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...