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_label43.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:59:01,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:59:01,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:59:01,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:59:01,401 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:59:01,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:59:01,404 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:59:01,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:59:01,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:59:01,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:59:01,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:59:01,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:59:01,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:59:01,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:59:01,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:59:01,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:59:01,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:59:01,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:59:01,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:59:01,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:59:01,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:59:01,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:59:01,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:59:01,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:59:01,443 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:59:01,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:59:01,444 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:59:01,445 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:59:01,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:59:01,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:59:01,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:59:01,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:59:01,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:59:01,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:59:01,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:59:01,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:59:01,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:59:01,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:59:01,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:59:01,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:59:01,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:59:01,458 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:59:01,476 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:59:01,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:59:01,478 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:59:01,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:59:01,479 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:59:01,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:59:01,479 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:59:01,479 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:59:01,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:59:01,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:59:01,481 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:59:01,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:59:01,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:59:01,482 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:59:01,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:59:01,482 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:59:01,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:59:01,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:59:01,482 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:59:01,483 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:59:01,483 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:59:01,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:59:01,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:59:01,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:59:01,484 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:59:01,484 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:59:01,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:59:01,484 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:59:01,484 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:59:01,765 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:59:01,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:59:01,786 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:59:01,788 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:59:01,788 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:59:01,789 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label43.c [2019-10-07 00:59:01,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b3a33a3/242854ac5313497d80e3f129d743efd8/FLAG03666ca90 [2019-10-07 00:59:02,508 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:59:02,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label43.c [2019-10-07 00:59:02,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b3a33a3/242854ac5313497d80e3f129d743efd8/FLAG03666ca90 [2019-10-07 00:59:02,689 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b3a33a3/242854ac5313497d80e3f129d743efd8 [2019-10-07 00:59:02,699 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:59:02,701 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:59:02,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:59:02,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:59:02,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:59:02,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:59:02" (1/1) ... [2019-10-07 00:59:02,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c04ebec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:59:02, skipping insertion in model container [2019-10-07 00:59:02,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:59:02" (1/1) ... [2019-10-07 00:59:02,720 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:59:02,806 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:59:03,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:59:03,625 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:59:03,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:59:03,971 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:59:03,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:59:03 WrapperNode [2019-10-07 00:59:03,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:59:03,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:59:03,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:59:03,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:59:03,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:59:03" (1/1) ... [2019-10-07 00:59:03,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:59:03" (1/1) ... [2019-10-07 00:59:04,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:59:03" (1/1) ... [2019-10-07 00:59:04,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:59:03" (1/1) ... [2019-10-07 00:59:04,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:59:03" (1/1) ... [2019-10-07 00:59:04,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:59:03" (1/1) ... [2019-10-07 00:59:04,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:59:03" (1/1) ... [2019-10-07 00:59:04,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:59:04,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:59:04,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:59:04,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:59:04,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:59:03" (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:59:04,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:59:04,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:59:04,227 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 00:59:04,227 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:59:04,228 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 00:59:04,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:59:04,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:59:04,229 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 00:59:04,230 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:59:04,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:59:04,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:59:06,953 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:59:06,953 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:59:06,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:59:06 BoogieIcfgContainer [2019-10-07 00:59:06,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:59:06,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:59:06,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:59:06,959 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:59:06,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:59:02" (1/3) ... [2019-10-07 00:59:06,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65aa8073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:59:06, skipping insertion in model container [2019-10-07 00:59:06,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:59:03" (2/3) ... [2019-10-07 00:59:06,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65aa8073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:59:06, skipping insertion in model container [2019-10-07 00:59:06,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:59:06" (3/3) ... [2019-10-07 00:59:06,963 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label43.c [2019-10-07 00:59:07,029 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:59:07,037 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:59:07,048 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:59:07,077 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:59:07,077 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:59:07,078 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:59:07,078 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:59:07,078 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:59:07,078 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:59:07,078 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:59:07,078 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:59:07,113 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-10-07 00:59:07,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-07 00:59:07,134 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:07,135 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:59:07,137 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:07,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:07,144 INFO L82 PathProgramCache]: Analyzing trace with hash 136465446, now seen corresponding path program 1 times [2019-10-07 00:59:07,154 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:07,154 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:07,154 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:07,155 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:07,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:07,831 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:59:07,832 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:07,833 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:59:07,833 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 00:59:07,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 00:59:07,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 00:59:07,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 00:59:07,856 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 4 states. [2019-10-07 00:59:09,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:09,320 INFO L93 Difference]: Finished difference Result 613 states and 1182 transitions. [2019-10-07 00:59:09,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 00:59:09,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-10-07 00:59:09,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:09,354 INFO L225 Difference]: With dead ends: 613 [2019-10-07 00:59:09,354 INFO L226 Difference]: Without dead ends: 448 [2019-10-07 00:59:09,363 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 00:59:09,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-10-07 00:59:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 301. [2019-10-07 00:59:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-07 00:59:09,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 570 transitions. [2019-10-07 00:59:09,486 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 570 transitions. Word has length 149 [2019-10-07 00:59:09,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:09,487 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 570 transitions. [2019-10-07 00:59:09,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 00:59:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 570 transitions. [2019-10-07 00:59:09,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-07 00:59:09,491 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:09,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,492 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:09,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:09,493 INFO L82 PathProgramCache]: Analyzing trace with hash 243766760, now seen corresponding path program 1 times [2019-10-07 00:59:09,493 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:09,493 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:09,493 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:09,493 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:09,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:09,635 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 00:59:09,635 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:09,636 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:59:09,636 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 00:59:09,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:59:09,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:59:09,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 00:59:09,638 INFO L87 Difference]: Start difference. First operand 301 states and 570 transitions. Second operand 5 states. [2019-10-07 00:59:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:10,921 INFO L93 Difference]: Finished difference Result 917 states and 1764 transitions. [2019-10-07 00:59:10,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:59:10,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-10-07 00:59:10,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:10,930 INFO L225 Difference]: With dead ends: 917 [2019-10-07 00:59:10,930 INFO L226 Difference]: Without dead ends: 621 [2019-10-07 00:59:10,933 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 00:59:10,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-07 00:59:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 605. [2019-10-07 00:59:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-07 00:59:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1112 transitions. [2019-10-07 00:59:10,971 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1112 transitions. Word has length 157 [2019-10-07 00:59:10,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:10,972 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1112 transitions. [2019-10-07 00:59:10,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:59:10,972 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1112 transitions. [2019-10-07 00:59:10,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-07 00:59:10,976 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:10,976 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:59:10,977 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:10,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:10,977 INFO L82 PathProgramCache]: Analyzing trace with hash 558835389, now seen corresponding path program 1 times [2019-10-07 00:59:10,977 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:10,978 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:10,978 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:10,978 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:10,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:11,112 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:59:11,112 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:11,113 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:59:11,114 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:59:11,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:59:11,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:59:11,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:59:11,116 INFO L87 Difference]: Start difference. First operand 605 states and 1112 transitions. Second operand 6 states. [2019-10-07 00:59:12,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:12,547 INFO L93 Difference]: Finished difference Result 1879 states and 3733 transitions. [2019-10-07 00:59:12,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:59:12,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2019-10-07 00:59:12,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:12,567 INFO L225 Difference]: With dead ends: 1879 [2019-10-07 00:59:12,567 INFO L226 Difference]: Without dead ends: 1279 [2019-10-07 00:59:12,570 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:59:12,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-10-07 00:59:12,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1221. [2019-10-07 00:59:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2019-10-07 00:59:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 2240 transitions. [2019-10-07 00:59:12,676 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 2240 transitions. Word has length 158 [2019-10-07 00:59:12,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:12,686 INFO L462 AbstractCegarLoop]: Abstraction has 1221 states and 2240 transitions. [2019-10-07 00:59:12,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:59:12,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 2240 transitions. [2019-10-07 00:59:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-07 00:59:12,695 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:12,696 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:59:12,696 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:12,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:12,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1532436462, now seen corresponding path program 1 times [2019-10-07 00:59:12,697 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:12,697 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:12,697 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:12,697 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:12,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:13,007 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:59:13,007 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:13,007 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:59:13,008 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:59:13,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:59:13,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:59:13,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:59:13,009 INFO L87 Difference]: Start difference. First operand 1221 states and 2240 transitions. Second operand 3 states. [2019-10-07 00:59:13,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:13,895 INFO L93 Difference]: Finished difference Result 3637 states and 6909 transitions. [2019-10-07 00:59:13,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:59:13,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-07 00:59:13,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:13,914 INFO L225 Difference]: With dead ends: 3637 [2019-10-07 00:59:13,914 INFO L226 Difference]: Without dead ends: 2421 [2019-10-07 00:59:13,918 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:59:13,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2019-10-07 00:59:13,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2421. [2019-10-07 00:59:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2421 states. [2019-10-07 00:59:14,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 4302 transitions. [2019-10-07 00:59:14,001 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 4302 transitions. Word has length 161 [2019-10-07 00:59:14,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:14,002 INFO L462 AbstractCegarLoop]: Abstraction has 2421 states and 4302 transitions. [2019-10-07 00:59:14,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:59:14,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 4302 transitions. [2019-10-07 00:59:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-07 00:59:14,011 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:14,011 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 00:59:14,011 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:14,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:14,012 INFO L82 PathProgramCache]: Analyzing trace with hash -2126716471, now seen corresponding path program 1 times [2019-10-07 00:59:14,012 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:14,012 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:14,012 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:14,012 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:14,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:14,116 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:14,116 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:59:14,116 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:59:14,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:59:14,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:59:14,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:59:14,118 INFO L87 Difference]: Start difference. First operand 2421 states and 4302 transitions. Second operand 6 states. [2019-10-07 00:59:15,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:15,355 INFO L93 Difference]: Finished difference Result 7089 states and 14040 transitions. [2019-10-07 00:59:15,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 00:59:15,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2019-10-07 00:59:15,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:15,399 INFO L225 Difference]: With dead ends: 7089 [2019-10-07 00:59:15,399 INFO L226 Difference]: Without dead ends: 4673 [2019-10-07 00:59:15,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:59:15,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4673 states. [2019-10-07 00:59:15,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4673 to 4587. [2019-10-07 00:59:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4587 states. [2019-10-07 00:59:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4587 states to 4587 states and 7937 transitions. [2019-10-07 00:59:15,587 INFO L78 Accepts]: Start accepts. Automaton has 4587 states and 7937 transitions. Word has length 168 [2019-10-07 00:59:15,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:15,587 INFO L462 AbstractCegarLoop]: Abstraction has 4587 states and 7937 transitions. [2019-10-07 00:59:15,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:59:15,588 INFO L276 IsEmpty]: Start isEmpty. Operand 4587 states and 7937 transitions. [2019-10-07 00:59:15,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-07 00:59:15,602 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:15,603 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,603 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:15,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:15,603 INFO L82 PathProgramCache]: Analyzing trace with hash 700926954, now seen corresponding path program 1 times [2019-10-07 00:59:15,604 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:15,604 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:15,604 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:15,604 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:15,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:15,700 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:15,700 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:15,700 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:59:15,701 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:59:15,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:59:15,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:59:15,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:59:15,702 INFO L87 Difference]: Start difference. First operand 4587 states and 7937 transitions. Second operand 6 states. [2019-10-07 00:59:17,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:17,110 INFO L93 Difference]: Finished difference Result 10680 states and 19949 transitions. [2019-10-07 00:59:17,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:59:17,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2019-10-07 00:59:17,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:17,158 INFO L225 Difference]: With dead ends: 10680 [2019-10-07 00:59:17,158 INFO L226 Difference]: Without dead ends: 6098 [2019-10-07 00:59:17,177 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:59:17,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6098 states. [2019-10-07 00:59:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6098 to 5964. [2019-10-07 00:59:17,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5964 states. [2019-10-07 00:59:17,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5964 states to 5964 states and 9941 transitions. [2019-10-07 00:59:17,465 INFO L78 Accepts]: Start accepts. Automaton has 5964 states and 9941 transitions. Word has length 171 [2019-10-07 00:59:17,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:17,466 INFO L462 AbstractCegarLoop]: Abstraction has 5964 states and 9941 transitions. [2019-10-07 00:59:17,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:59:17,466 INFO L276 IsEmpty]: Start isEmpty. Operand 5964 states and 9941 transitions. [2019-10-07 00:59:17,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-07 00:59:17,491 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:17,492 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-07 00:59:17,492 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:17,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:17,493 INFO L82 PathProgramCache]: Analyzing trace with hash -561584426, now seen corresponding path program 1 times [2019-10-07 00:59:17,493 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:17,493 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:17,493 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:17,493 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:17,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 38 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:17,734 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:17,734 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:59:17,734 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:59:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:17,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-07 00:59:17,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:59:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 00:59:18,050 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:59:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:59:18,148 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 00:59:18,148 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-07 00:59:18,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:59:18,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:59:18,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-07 00:59:18,150 INFO L87 Difference]: Start difference. First operand 5964 states and 9941 transitions. Second operand 5 states. [2019-10-07 00:59:19,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:59:19,730 INFO L93 Difference]: Finished difference Result 17184 states and 31006 transitions. [2019-10-07 00:59:19,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:59:19,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-10-07 00:59:19,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:59:19,809 INFO L225 Difference]: With dead ends: 17184 [2019-10-07 00:59:19,809 INFO L226 Difference]: Without dead ends: 11225 [2019-10-07 00:59:19,829 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 363 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:59:19,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11225 states. [2019-10-07 00:59:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11225 to 11079. [2019-10-07 00:59:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11079 states. [2019-10-07 00:59:20,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11079 states to 11079 states and 18790 transitions. [2019-10-07 00:59:20,396 INFO L78 Accepts]: Start accepts. Automaton has 11079 states and 18790 transitions. Word has length 183 [2019-10-07 00:59:20,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:59:20,397 INFO L462 AbstractCegarLoop]: Abstraction has 11079 states and 18790 transitions. [2019-10-07 00:59:20,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:59:20,397 INFO L276 IsEmpty]: Start isEmpty. Operand 11079 states and 18790 transitions. [2019-10-07 00:59:20,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-07 00:59:20,435 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:59:20,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:20,640 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:59:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:59:20,641 INFO L82 PathProgramCache]: Analyzing trace with hash -733583127, now seen corresponding path program 1 times [2019-10-07 00:59:20,641 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:59:20,642 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:20,642 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:20,642 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:59:20,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:59:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:20,845 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:59:20,845 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:59:20,845 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:59:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:59:21,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 1003 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 00:59:21,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:59:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:21,081 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:59:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:59:21,173 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:59:21,214 INFO L162 IcfgInterpreter]: Started Sifa with 153 locations of interest [2019-10-07 00:59:21,215 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:59:21,223 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:59:21,233 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:59:21,233 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:59:21,626 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2019-10-07 00:59:22,286 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 206 for LOIs [2019-10-07 00:59:22,557 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 298 [2019-10-07 00:59:22,907 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2019-10-07 00:59:23,244 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 310 [2019-10-07 00:59:23,564 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 278 [2019-10-07 00:59:24,208 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:59:24,209 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: ε 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: ε 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:24,214 INFO L168 Benchmark]: Toolchain (without parser) took 21513.77 ms. Allocated memory was 144.2 MB in the beginning and 703.6 MB in the end (delta: 559.4 MB). Free memory was 97.1 MB in the beginning and 250.2 MB in the end (delta: -153.1 MB). Peak memory consumption was 406.3 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:24,215 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 144.2 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-07 00:59:24,216 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1269.16 ms. Allocated memory was 144.2 MB in the beginning and 206.6 MB in the end (delta: 62.4 MB). Free memory was 96.7 MB in the beginning and 131.9 MB in the end (delta: -35.2 MB). Peak memory consumption was 38.4 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:24,217 INFO L168 Benchmark]: Boogie Preprocessor took 172.42 ms. Allocated memory is still 206.6 MB. Free memory was 131.9 MB in the beginning and 121.0 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:24,218 INFO L168 Benchmark]: RCFGBuilder took 2807.76 ms. Allocated memory was 206.6 MB in the beginning and 260.0 MB in the end (delta: 53.5 MB). Free memory was 121.0 MB in the beginning and 83.4 MB in the end (delta: 37.6 MB). Peak memory consumption was 91.1 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:24,219 INFO L168 Benchmark]: TraceAbstraction took 17256.60 ms. Allocated memory was 260.0 MB in the beginning and 703.6 MB in the end (delta: 443.5 MB). Free memory was 83.4 MB in the beginning and 250.2 MB in the end (delta: -166.9 MB). Peak memory consumption was 276.7 MB. Max. memory is 7.1 GB. [2019-10-07 00:59:24,223 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 144.2 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1269.16 ms. Allocated memory was 144.2 MB in the beginning and 206.6 MB in the end (delta: 62.4 MB). Free memory was 96.7 MB in the beginning and 131.9 MB in the end (delta: -35.2 MB). Peak memory consumption was 38.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 172.42 ms. Allocated memory is still 206.6 MB. Free memory was 131.9 MB in the beginning and 121.0 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2807.76 ms. Allocated memory was 206.6 MB in the beginning and 260.0 MB in the end (delta: 53.5 MB). Free memory was 121.0 MB in the beginning and 83.4 MB in the end (delta: 37.6 MB). Peak memory consumption was 91.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17256.60 ms. Allocated memory was 260.0 MB in the beginning and 703.6 MB in the end (delta: 443.5 MB). Free memory was 83.4 MB in the beginning and 250.2 MB in the end (delta: -166.9 MB). Peak memory consumption was 276.7 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: ε de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε: 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...