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/Problem18_label59.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:46:44,044 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:46:44,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:46:44,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:46:44,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:46:44,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:46:44,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:46:44,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:46:44,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:46:44,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:46:44,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:46:44,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:46:44,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:46:44,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:46:44,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:46:44,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:46:44,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:46:44,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:46:44,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:46:44,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:46:44,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:46:44,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:46:44,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:46:44,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:46:44,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:46:44,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:46:44,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:46:44,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:46:44,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:46:44,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:46:44,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:46:44,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:46:44,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:46:44,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:46:44,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:46:44,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:46:44,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:46:44,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:46:44,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:46:44,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:46:44,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:46:44,104 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:46:44,126 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:46:44,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:46:44,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:46:44,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:46:44,130 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:46:44,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:46:44,130 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:46:44,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:46:44,131 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:46:44,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:46:44,132 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:46:44,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:46:44,132 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:46:44,133 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:46:44,133 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:46:44,133 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:46:44,133 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:46:44,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:46:44,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:46:44,134 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:46:44,134 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:46:44,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:46:44,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:46:44,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:46:44,135 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:46:44,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:46:44,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:46:44,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:46:44,136 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:46:44,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:46:44,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:46:44,473 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:46:44,474 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:46:44,474 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:46:44,475 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label59.c [2019-10-07 03:46:44,552 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9256eaf2b/5f7323356fb8487c8dd341a2e562d8ba/FLAGce5834aae [2019-10-07 03:46:45,303 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:46:45,305 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label59.c [2019-10-07 03:46:45,331 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9256eaf2b/5f7323356fb8487c8dd341a2e562d8ba/FLAGce5834aae [2019-10-07 03:46:45,394 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9256eaf2b/5f7323356fb8487c8dd341a2e562d8ba [2019-10-07 03:46:45,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:46:45,407 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:46:45,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:46:45,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:46:45,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:46:45,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:46:45" (1/1) ... [2019-10-07 03:46:45,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a3d015c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:45, skipping insertion in model container [2019-10-07 03:46:45,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:46:45" (1/1) ... [2019-10-07 03:46:45,426 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:46:45,548 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:46:46,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:46:46,625 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:46:47,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:46:47,112 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:46:47,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:47 WrapperNode [2019-10-07 03:46:47,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:46:47,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:46:47,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:46:47,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:46:47,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:47" (1/1) ... [2019-10-07 03:46:47,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:47" (1/1) ... [2019-10-07 03:46:47,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:47" (1/1) ... [2019-10-07 03:46:47,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:47" (1/1) ... [2019-10-07 03:46:47,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:47" (1/1) ... [2019-10-07 03:46:47,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:47" (1/1) ... [2019-10-07 03:46:47,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:47" (1/1) ... [2019-10-07 03:46:47,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:46:47,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:46:47,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:46:47,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:46:47,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:47" (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:46:47,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:46:47,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:46:47,457 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 03:46:47,457 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-07 03:46:47,457 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-10-07 03:46:47,458 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:46:47,458 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 03:46:47,458 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-07 03:46:47,458 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-10-07 03:46:47,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:46:47,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:46:47,459 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:46:47,459 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:46:47,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:46:47,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:48:24,399 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:48:24,400 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 03:48:24,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:48:24 BoogieIcfgContainer [2019-10-07 03:48:24,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:48:24,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:48:24,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:48:24,406 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:48:24,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:46:45" (1/3) ... [2019-10-07 03:48:24,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400b0738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:48:24, skipping insertion in model container [2019-10-07 03:48:24,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:47" (2/3) ... [2019-10-07 03:48:24,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400b0738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:48:24, skipping insertion in model container [2019-10-07 03:48:24,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:48:24" (3/3) ... [2019-10-07 03:48:24,410 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem18_label59.c [2019-10-07 03:48:24,420 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:48:24,427 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 03:48:24,437 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 03:48:24,468 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:48:24,468 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:48:24,469 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:48:24,469 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:48:24,469 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:48:24,469 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:48:24,469 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:48:24,470 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:48:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states. [2019-10-07 03:48:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 03:48:24,504 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:24,505 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:24,507 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:24,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:24,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1816955558, now seen corresponding path program 1 times [2019-10-07 03:48:24,522 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:24,522 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:24,522 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:24,523 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:24,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:24,755 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:48:24,756 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:24,758 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:24,759 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:48:24,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:48:24,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:48:24,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:24,781 INFO L87 Difference]: Start difference. First operand 469 states. Second operand 3 states. [2019-10-07 03:48:30,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:30,183 INFO L93 Difference]: Finished difference Result 1393 states and 2727 transitions. [2019-10-07 03:48:30,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:48:30,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-07 03:48:30,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:30,211 INFO L225 Difference]: With dead ends: 1393 [2019-10-07 03:48:30,211 INFO L226 Difference]: Without dead ends: 921 [2019-10-07 03:48:30,220 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:30,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-10-07 03:48:30,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 915. [2019-10-07 03:48:30,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2019-10-07 03:48:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1772 transitions. [2019-10-07 03:48:30,333 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1772 transitions. Word has length 11 [2019-10-07 03:48:30,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:30,333 INFO L462 AbstractCegarLoop]: Abstraction has 915 states and 1772 transitions. [2019-10-07 03:48:30,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:48:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1772 transitions. [2019-10-07 03:48:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 03:48:30,336 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:30,336 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:48:30,336 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:30,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:30,337 INFO L82 PathProgramCache]: Analyzing trace with hash -672020982, now seen corresponding path program 1 times [2019-10-07 03:48:30,337 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:30,338 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:30,338 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:30,338 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:30,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:30,488 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:48:30,488 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:30,491 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:30,491 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:48:30,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:48:30,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:48:30,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:48:30,493 INFO L87 Difference]: Start difference. First operand 915 states and 1772 transitions. Second operand 5 states. [2019-10-07 03:48:34,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:34,433 INFO L93 Difference]: Finished difference Result 2769 states and 5402 transitions. [2019-10-07 03:48:34,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:48:34,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-07 03:48:34,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:34,450 INFO L225 Difference]: With dead ends: 2769 [2019-10-07 03:48:34,450 INFO L226 Difference]: Without dead ends: 1859 [2019-10-07 03:48:34,454 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:48:34,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2019-10-07 03:48:34,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1826. [2019-10-07 03:48:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1826 states. [2019-10-07 03:48:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 3257 transitions. [2019-10-07 03:48:34,569 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 3257 transitions. Word has length 21 [2019-10-07 03:48:34,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:34,570 INFO L462 AbstractCegarLoop]: Abstraction has 1826 states and 3257 transitions. [2019-10-07 03:48:34,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:48:34,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 3257 transitions. [2019-10-07 03:48:34,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 03:48:34,571 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:34,571 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:34,572 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:34,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:34,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1774720843, now seen corresponding path program 1 times [2019-10-07 03:48:34,573 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:34,574 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:34,574 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:34,574 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:34,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:34,672 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:48:34,673 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:34,673 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:34,673 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:48:34,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:48:34,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:48:34,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:48:34,674 INFO L87 Difference]: Start difference. First operand 1826 states and 3257 transitions. Second operand 5 states. [2019-10-07 03:48:40,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:40,496 INFO L93 Difference]: Finished difference Result 5057 states and 9092 transitions. [2019-10-07 03:48:40,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:48:40,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-07 03:48:40,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:40,516 INFO L225 Difference]: With dead ends: 5057 [2019-10-07 03:48:40,516 INFO L226 Difference]: Without dead ends: 3236 [2019-10-07 03:48:40,522 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:48:40,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3236 states. [2019-10-07 03:48:40,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3236 to 3209. [2019-10-07 03:48:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3209 states. [2019-10-07 03:48:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3209 states to 3209 states and 4946 transitions. [2019-10-07 03:48:40,628 INFO L78 Accepts]: Start accepts. Automaton has 3209 states and 4946 transitions. Word has length 22 [2019-10-07 03:48:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:40,629 INFO L462 AbstractCegarLoop]: Abstraction has 3209 states and 4946 transitions. [2019-10-07 03:48:40,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:48:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 3209 states and 4946 transitions. [2019-10-07 03:48:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 03:48:40,630 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:40,630 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:48:40,630 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:40,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:40,631 INFO L82 PathProgramCache]: Analyzing trace with hash -606301359, now seen corresponding path program 1 times [2019-10-07 03:48:40,631 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:40,631 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:40,631 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:40,632 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:40,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:40,695 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:48:40,696 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:40,696 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:40,696 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:48:40,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:48:40,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:48:40,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:48:40,697 INFO L87 Difference]: Start difference. First operand 3209 states and 4946 transitions. Second operand 6 states. [2019-10-07 03:48:50,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:50,044 INFO L93 Difference]: Finished difference Result 11296 states and 18366 transitions. [2019-10-07 03:48:50,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 03:48:50,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-07 03:48:50,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:50,086 INFO L225 Difference]: With dead ends: 11296 [2019-10-07 03:48:50,087 INFO L226 Difference]: Without dead ends: 8092 [2019-10-07 03:48:50,098 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-10-07 03:48:50,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8092 states. [2019-10-07 03:48:50,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8092 to 7085. [2019-10-07 03:48:50,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7085 states. [2019-10-07 03:48:50,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7085 states to 7085 states and 10501 transitions. [2019-10-07 03:48:50,394 INFO L78 Accepts]: Start accepts. Automaton has 7085 states and 10501 transitions. Word has length 24 [2019-10-07 03:48:50,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:50,395 INFO L462 AbstractCegarLoop]: Abstraction has 7085 states and 10501 transitions. [2019-10-07 03:48:50,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:48:50,396 INFO L276 IsEmpty]: Start isEmpty. Operand 7085 states and 10501 transitions. [2019-10-07 03:48:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-07 03:48:50,398 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:50,398 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] [2019-10-07 03:48:50,398 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:50,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:50,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1952823314, now seen corresponding path program 1 times [2019-10-07 03:48:50,399 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:50,399 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:50,399 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:50,400 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:50,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:50,488 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:48:50,488 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:50,489 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:50,489 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:48:50,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:48:50,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:48:50,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:50,490 INFO L87 Difference]: Start difference. First operand 7085 states and 10501 transitions. Second operand 3 states. [2019-10-07 03:48:53,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:53,114 INFO L93 Difference]: Finished difference Result 16426 states and 24378 transitions. [2019-10-07 03:48:53,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:48:53,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-07 03:48:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:53,166 INFO L225 Difference]: With dead ends: 16426 [2019-10-07 03:48:53,167 INFO L226 Difference]: Without dead ends: 9346 [2019-10-07 03:48:53,190 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 03:48:53,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9346 states. [2019-10-07 03:48:53,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9346 to 8267. [2019-10-07 03:48:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8267 states. [2019-10-07 03:48:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8267 states to 8267 states and 11043 transitions. [2019-10-07 03:48:53,399 INFO L78 Accepts]: Start accepts. Automaton has 8267 states and 11043 transitions. Word has length 49 [2019-10-07 03:48:53,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:53,399 INFO L462 AbstractCegarLoop]: Abstraction has 8267 states and 11043 transitions. [2019-10-07 03:48:53,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:48:53,400 INFO L276 IsEmpty]: Start isEmpty. Operand 8267 states and 11043 transitions. [2019-10-07 03:48:53,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-07 03:48:53,402 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:53,403 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-07 03:48:53,403 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:53,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:53,403 INFO L82 PathProgramCache]: Analyzing trace with hash -172862307, now seen corresponding path program 1 times [2019-10-07 03:48:53,404 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:53,404 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:53,404 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:53,404 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:53,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:53,580 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-07 03:48:53,580 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:53,580 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:53,581 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:48:53,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:48:53,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:48:53,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:48:53,582 INFO L87 Difference]: Start difference. First operand 8267 states and 11043 transitions. Second operand 4 states. [2019-10-07 03:49:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:49:00,867 INFO L93 Difference]: Finished difference Result 24650 states and 33900 transitions. [2019-10-07 03:49:00,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:49:00,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-10-07 03:49:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:49:00,921 INFO L225 Difference]: With dead ends: 24650 [2019-10-07 03:49:00,922 INFO L226 Difference]: Without dead ends: 16388 [2019-10-07 03:49:00,950 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:49:00,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16388 states. [2019-10-07 03:49:01,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16388 to 14844. [2019-10-07 03:49:01,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14844 states. [2019-10-07 03:49:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14844 states to 14844 states and 19983 transitions. [2019-10-07 03:49:01,289 INFO L78 Accepts]: Start accepts. Automaton has 14844 states and 19983 transitions. Word has length 68 [2019-10-07 03:49:01,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:49:01,290 INFO L462 AbstractCegarLoop]: Abstraction has 14844 states and 19983 transitions. [2019-10-07 03:49:01,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:49:01,291 INFO L276 IsEmpty]: Start isEmpty. Operand 14844 states and 19983 transitions. [2019-10-07 03:49:01,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-07 03:49:01,302 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:49:01,303 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-07 03:49:01,303 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:49:01,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:49:01,304 INFO L82 PathProgramCache]: Analyzing trace with hash 653006814, now seen corresponding path program 1 times [2019-10-07 03:49:01,304 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:49:01,304 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:49:01,305 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:49:01,305 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:49:01,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:49:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:49:01,660 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:49:01,661 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:49:01,661 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:49:01,661 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:49:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:49:01,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 03:49:01,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:49:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:49:01,853 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:49:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:49:01,986 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:49:02,042 INFO L162 IcfgInterpreter]: Started Sifa with 54 locations of interest [2019-10-07 03:49:02,042 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:49:02,051 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:49:02,066 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:49:02,066 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:49:02,308 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 53 for LOIs [2019-10-07 03:49:02,467 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 31 [2019-10-07 03:49:02,625 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 31 [2019-10-07 03:49:02,772 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2019-10-07 03:49:02,899 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2019-10-07 03:49:03,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:49:03,255 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:49:03,262 INFO L168 Benchmark]: Toolchain (without parser) took 137854.41 ms. Allocated memory was 139.5 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 92.4 MB in the beginning and 621.8 MB in the end (delta: -529.4 MB). Peak memory consumption was 552.7 MB. Max. memory is 7.1 GB. [2019-10-07 03:49:03,263 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory was 120.4 MB in the beginning and 120.2 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:49:03,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1704.61 ms. Allocated memory was 139.5 MB in the beginning and 237.0 MB in the end (delta: 97.5 MB). Free memory was 92.2 MB in the beginning and 174.1 MB in the end (delta: -81.8 MB). Peak memory consumption was 87.5 MB. Max. memory is 7.1 GB. [2019-10-07 03:49:03,265 INFO L168 Benchmark]: Boogie Preprocessor took 272.59 ms. Allocated memory is still 237.0 MB. Free memory was 174.1 MB in the beginning and 154.0 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. [2019-10-07 03:49:03,266 INFO L168 Benchmark]: RCFGBuilder took 97015.56 ms. Allocated memory was 237.0 MB in the beginning and 797.4 MB in the end (delta: 560.5 MB). Free memory was 152.5 MB in the beginning and 283.0 MB in the end (delta: -130.5 MB). Peak memory consumption was 689.7 MB. Max. memory is 7.1 GB. [2019-10-07 03:49:03,267 INFO L168 Benchmark]: TraceAbstraction took 38855.99 ms. Allocated memory was 797.4 MB in the beginning and 1.2 GB in the end (delta: 424.1 MB). Free memory was 283.0 MB in the beginning and 621.8 MB in the end (delta: -338.8 MB). Peak memory consumption was 85.3 MB. Max. memory is 7.1 GB. [2019-10-07 03:49:03,276 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.20 ms. Allocated memory is still 139.5 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1704.61 ms. Allocated memory was 139.5 MB in the beginning and 237.0 MB in the end (delta: 97.5 MB). Free memory was 92.2 MB in the beginning and 174.1 MB in the end (delta: -81.8 MB). Peak memory consumption was 87.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 272.59 ms. Allocated memory is still 237.0 MB. Free memory was 174.1 MB in the beginning and 154.0 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 97015.56 ms. Allocated memory was 237.0 MB in the beginning and 797.4 MB in the end (delta: 560.5 MB). Free memory was 152.5 MB in the beginning and 283.0 MB in the end (delta: -130.5 MB). Peak memory consumption was 689.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 38855.99 ms. Allocated memory was 797.4 MB in the beginning and 1.2 GB in the end (delta: 424.1 MB). Free memory was 283.0 MB in the beginning and 621.8 MB in the end (delta: -338.8 MB). Peak memory consumption was 85.3 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...