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/Problem12_label24.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 02:42:09,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 02:42:09,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 02:42:09,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 02:42:09,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 02:42:09,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 02:42:09,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 02:42:09,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 02:42:09,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 02:42:09,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 02:42:09,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 02:42:09,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 02:42:09,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 02:42:09,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 02:42:09,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 02:42:09,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 02:42:09,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 02:42:09,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 02:42:09,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 02:42:09,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 02:42:09,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 02:42:09,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 02:42:09,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 02:42:09,274 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 02:42:09,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 02:42:09,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 02:42:09,277 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 02:42:09,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 02:42:09,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 02:42:09,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 02:42:09,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 02:42:09,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 02:42:09,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 02:42:09,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 02:42:09,283 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 02:42:09,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 02:42:09,284 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 02:42:09,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 02:42:09,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 02:42:09,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 02:42:09,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 02:42:09,287 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 02:42:09,302 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 02:42:09,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 02:42:09,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 02:42:09,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 02:42:09,304 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 02:42:09,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 02:42:09,304 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 02:42:09,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 02:42:09,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 02:42:09,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 02:42:09,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 02:42:09,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 02:42:09,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 02:42:09,306 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 02:42:09,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 02:42:09,306 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 02:42:09,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 02:42:09,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 02:42:09,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 02:42:09,307 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 02:42:09,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 02:42:09,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 02:42:09,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 02:42:09,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 02:42:09,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 02:42:09,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 02:42:09,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 02:42:09,308 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 02:42:09,309 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 02:42:09,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 02:42:09,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 02:42:09,619 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 02:42:09,621 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 02:42:09,621 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 02:42:09,622 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label24.c [2019-10-07 02:42:09,704 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/794b350ef/ca8d37ec24f741fba8998dacbf9963ed/FLAG6d87007df [2019-10-07 02:42:10,428 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 02:42:10,429 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label24.c [2019-10-07 02:42:10,462 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/794b350ef/ca8d37ec24f741fba8998dacbf9963ed/FLAG6d87007df [2019-10-07 02:42:10,529 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/794b350ef/ca8d37ec24f741fba8998dacbf9963ed [2019-10-07 02:42:10,541 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 02:42:10,543 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 02:42:10,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 02:42:10,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 02:42:10,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 02:42:10,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 02:42:10" (1/1) ... [2019-10-07 02:42:10,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e156f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:42:10, skipping insertion in model container [2019-10-07 02:42:10,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 02:42:10" (1/1) ... [2019-10-07 02:42:10,566 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 02:42:10,732 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 02:42:12,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 02:42:12,314 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 02:42:12,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 02:42:12,974 INFO L192 MainTranslator]: Completed translation [2019-10-07 02:42:12,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:42:12 WrapperNode [2019-10-07 02:42:12,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 02:42:12,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 02:42:12,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 02:42:12,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 02:42:12,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:42:12" (1/1) ... [2019-10-07 02:42:12,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:42:12" (1/1) ... [2019-10-07 02:42:13,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:42:12" (1/1) ... [2019-10-07 02:42:13,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:42:12" (1/1) ... [2019-10-07 02:42:13,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:42:12" (1/1) ... [2019-10-07 02:42:13,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:42:12" (1/1) ... [2019-10-07 02:42:13,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:42:12" (1/1) ... [2019-10-07 02:42:13,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 02:42:13,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 02:42:13,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 02:42:13,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 02:42:13,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:42:12" (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 02:42:13,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 02:42:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 02:42:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 02:42:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-07 02:42:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-10-07 02:42:13,364 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-10-07 02:42:13,365 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 02:42:13,367 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 02:42:13,368 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-07 02:42:13,368 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-10-07 02:42:13,369 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-10-07 02:42:13,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 02:42:13,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 02:42:13,370 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 02:42:13,370 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 02:42:13,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 02:42:13,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 02:42:20,394 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 02:42:20,395 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 02:42:20,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 02:42:20 BoogieIcfgContainer [2019-10-07 02:42:20,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 02:42:20,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 02:42:20,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 02:42:20,402 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 02:42:20,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 02:42:10" (1/3) ... [2019-10-07 02:42:20,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115aefbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 02:42:20, skipping insertion in model container [2019-10-07 02:42:20,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:42:12" (2/3) ... [2019-10-07 02:42:20,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115aefbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 02:42:20, skipping insertion in model container [2019-10-07 02:42:20,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 02:42:20" (3/3) ... [2019-10-07 02:42:20,416 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem12_label24.c [2019-10-07 02:42:20,428 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 02:42:20,442 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 02:42:20,455 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 02:42:20,507 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 02:42:20,508 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 02:42:20,508 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 02:42:20,508 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 02:42:20,508 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 02:42:20,508 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 02:42:20,509 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 02:42:20,509 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 02:42:20,556 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states. [2019-10-07 02:42:20,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 02:42:20,562 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 02:42:20,563 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 02:42:20,565 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 02:42:20,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 02:42:20,571 INFO L82 PathProgramCache]: Analyzing trace with hash -874908338, now seen corresponding path program 1 times [2019-10-07 02:42:20,581 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 02:42:20,581 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:42:20,581 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:42:20,582 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:42:20,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 02:42:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:42:20,872 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 02:42:20,873 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:42:20,873 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 02:42:20,874 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 02:42:20,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 02:42:20,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 02:42:20,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 02:42:20,896 INFO L87 Difference]: Start difference. First operand 694 states. Second operand 3 states. [2019-10-07 02:42:27,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 02:42:27,398 INFO L93 Difference]: Finished difference Result 2068 states and 4065 transitions. [2019-10-07 02:42:27,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 02:42:27,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-07 02:42:27,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 02:42:27,431 INFO L225 Difference]: With dead ends: 2068 [2019-10-07 02:42:27,432 INFO L226 Difference]: Without dead ends: 1371 [2019-10-07 02:42:27,443 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 02:42:27,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2019-10-07 02:42:27,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1357. [2019-10-07 02:42:27,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2019-10-07 02:42:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 2576 transitions. [2019-10-07 02:42:27,623 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 2576 transitions. Word has length 11 [2019-10-07 02:42:27,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 02:42:27,623 INFO L462 AbstractCegarLoop]: Abstraction has 1357 states and 2576 transitions. [2019-10-07 02:42:27,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 02:42:27,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 2576 transitions. [2019-10-07 02:42:27,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-07 02:42:27,627 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 02:42:27,627 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 02:42:27,627 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 02:42:27,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 02:42:27,629 INFO L82 PathProgramCache]: Analyzing trace with hash -639780444, now seen corresponding path program 1 times [2019-10-07 02:42:27,629 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 02:42:27,630 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:42:27,630 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:42:27,630 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:42:27,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 02:42:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:42:27,816 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 02:42:27,817 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:42:27,817 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 02:42:27,817 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 02:42:27,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 02:42:27,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 02:42:27,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 02:42:27,820 INFO L87 Difference]: Start difference. First operand 1357 states and 2576 transitions. Second operand 5 states. [2019-10-07 02:42:34,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 02:42:34,605 INFO L93 Difference]: Finished difference Result 4103 states and 7818 transitions. [2019-10-07 02:42:34,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 02:42:34,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-07 02:42:34,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 02:42:34,635 INFO L225 Difference]: With dead ends: 4103 [2019-10-07 02:42:34,635 INFO L226 Difference]: Without dead ends: 2751 [2019-10-07 02:42:34,643 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 02:42:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2751 states. [2019-10-07 02:42:34,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2751 to 2739. [2019-10-07 02:42:34,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2739 states. [2019-10-07 02:42:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2739 states to 2739 states and 4960 transitions. [2019-10-07 02:42:34,849 INFO L78 Accepts]: Start accepts. Automaton has 2739 states and 4960 transitions. Word has length 25 [2019-10-07 02:42:34,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 02:42:34,849 INFO L462 AbstractCegarLoop]: Abstraction has 2739 states and 4960 transitions. [2019-10-07 02:42:34,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 02:42:34,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2739 states and 4960 transitions. [2019-10-07 02:42:34,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-07 02:42:34,851 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 02:42:34,851 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] [2019-10-07 02:42:34,851 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 02:42:34,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 02:42:34,852 INFO L82 PathProgramCache]: Analyzing trace with hash 815606016, now seen corresponding path program 1 times [2019-10-07 02:42:34,852 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 02:42:34,853 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:42:34,853 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:42:34,853 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:42:34,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 02:42:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:42:34,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 02:42:34,957 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:42:34,957 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 02:42:34,957 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 02:42:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:42:35,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 02:42:35,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 02:42:35,108 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 02:42:35,108 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 02:42:35,158 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 02:42:35,159 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 02:42:35,159 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-10-07 02:42:35,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 02:42:35,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 02:42:35,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-07 02:42:35,161 INFO L87 Difference]: Start difference. First operand 2739 states and 4960 transitions. Second operand 4 states. [2019-10-07 02:42:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 02:42:42,433 INFO L93 Difference]: Finished difference Result 9592 states and 17475 transitions. [2019-10-07 02:42:42,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 02:42:42,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-10-07 02:42:42,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 02:42:42,477 INFO L225 Difference]: With dead ends: 9592 [2019-10-07 02:42:42,477 INFO L226 Difference]: Without dead ends: 6858 [2019-10-07 02:42:42,485 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-07 02:42:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6858 states. [2019-10-07 02:42:42,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6858 to 6844. [2019-10-07 02:42:42,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6844 states. [2019-10-07 02:42:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6844 states to 6844 states and 10881 transitions. [2019-10-07 02:42:42,681 INFO L78 Accepts]: Start accepts. Automaton has 6844 states and 10881 transitions. Word has length 27 [2019-10-07 02:42:42,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 02:42:42,682 INFO L462 AbstractCegarLoop]: Abstraction has 6844 states and 10881 transitions. [2019-10-07 02:42:42,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 02:42:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 6844 states and 10881 transitions. [2019-10-07 02:42:42,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-07 02:42:42,684 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 02:42:42,684 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] [2019-10-07 02:42:42,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 02:42:42,891 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 02:42:42,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 02:42:42,892 INFO L82 PathProgramCache]: Analyzing trace with hash -720124140, now seen corresponding path program 1 times [2019-10-07 02:42:42,892 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 02:42:42,892 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:42:42,893 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:42:42,893 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:42:42,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 02:42:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:42:43,043 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 02:42:43,043 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:42:43,044 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 02:42:43,044 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 02:42:43,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 02:42:43,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 02:42:43,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 02:42:43,048 INFO L87 Difference]: Start difference. First operand 6844 states and 10881 transitions. Second operand 6 states. [2019-10-07 02:42:49,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 02:42:49,516 INFO L93 Difference]: Finished difference Result 20069 states and 32990 transitions. [2019-10-07 02:42:49,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 02:42:49,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-10-07 02:42:49,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 02:42:49,603 INFO L225 Difference]: With dead ends: 20069 [2019-10-07 02:42:49,603 INFO L226 Difference]: Without dead ends: 13230 [2019-10-07 02:42:49,626 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 02:42:49,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13230 states. [2019-10-07 02:42:50,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13230 to 12805. [2019-10-07 02:42:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12805 states. [2019-10-07 02:42:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12805 states to 12805 states and 20782 transitions. [2019-10-07 02:42:50,053 INFO L78 Accepts]: Start accepts. Automaton has 12805 states and 20782 transitions. Word has length 33 [2019-10-07 02:42:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 02:42:50,054 INFO L462 AbstractCegarLoop]: Abstraction has 12805 states and 20782 transitions. [2019-10-07 02:42:50,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 02:42:50,054 INFO L276 IsEmpty]: Start isEmpty. Operand 12805 states and 20782 transitions. [2019-10-07 02:42:50,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-07 02:42:50,066 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 02:42:50,067 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] [2019-10-07 02:42:50,068 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 02:42:50,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 02:42:50,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1441638962, now seen corresponding path program 1 times [2019-10-07 02:42:50,069 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 02:42:50,069 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:42:50,069 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:42:50,069 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:42:50,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 02:42:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:42:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 02:42:50,199 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:42:50,199 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 02:42:50,199 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 02:42:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:42:50,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 02:42:50,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 02:42:50,485 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 02:42:50,485 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 02:42:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 02:42:50,567 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 02:42:50,567 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2019-10-07 02:42:50,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 02:42:50,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 02:42:50,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-07 02:42:50,568 INFO L87 Difference]: Start difference. First operand 12805 states and 20782 transitions. Second operand 5 states. [2019-10-07 02:42:57,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 02:42:57,027 INFO L93 Difference]: Finished difference Result 26487 states and 43847 transitions. [2019-10-07 02:42:57,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 02:42:57,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-07 02:42:57,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 02:42:57,089 INFO L225 Difference]: With dead ends: 26487 [2019-10-07 02:42:57,089 INFO L226 Difference]: Without dead ends: 13687 [2019-10-07 02:42:57,122 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-07 02:42:57,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13687 states. [2019-10-07 02:42:57,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13687 to 13646. [2019-10-07 02:42:57,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13646 states. [2019-10-07 02:42:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13646 states to 13646 states and 20593 transitions. [2019-10-07 02:42:57,522 INFO L78 Accepts]: Start accepts. Automaton has 13646 states and 20593 transitions. Word has length 43 [2019-10-07 02:42:57,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 02:42:57,523 INFO L462 AbstractCegarLoop]: Abstraction has 13646 states and 20593 transitions. [2019-10-07 02:42:57,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 02:42:57,523 INFO L276 IsEmpty]: Start isEmpty. Operand 13646 states and 20593 transitions. [2019-10-07 02:42:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-07 02:42:57,525 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 02:42:57,525 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-07 02:42:57,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 02:42:57,729 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 02:42:57,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 02:42:57,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1838893382, now seen corresponding path program 1 times [2019-10-07 02:42:57,731 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 02:42:57,731 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:42:57,731 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:42:57,731 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:42:57,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 02:42:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:42:57,898 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 02:42:57,899 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:42:57,899 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 02:42:57,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 02:42:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:42:57,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-07 02:42:57,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 02:42:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-07 02:42:58,043 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 02:42:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-07 02:42:58,130 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 02:42:58,130 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [8] total 14 [2019-10-07 02:42:58,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 02:42:58,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 02:42:58,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-10-07 02:42:58,134 INFO L87 Difference]: Start difference. First operand 13646 states and 20593 transitions. Second operand 8 states. [2019-10-07 02:43:08,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 02:43:08,263 INFO L93 Difference]: Finished difference Result 46181 states and 71555 transitions. [2019-10-07 02:43:08,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 02:43:08,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-10-07 02:43:08,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 02:43:08,390 INFO L225 Difference]: With dead ends: 46181 [2019-10-07 02:43:08,390 INFO L226 Difference]: Without dead ends: 32540 [2019-10-07 02:43:08,446 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-10-07 02:43:08,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32540 states. [2019-10-07 02:43:10,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32540 to 26661. [2019-10-07 02:43:10,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26661 states. [2019-10-07 02:43:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26661 states to 26661 states and 37750 transitions. [2019-10-07 02:43:10,347 INFO L78 Accepts]: Start accepts. Automaton has 26661 states and 37750 transitions. Word has length 49 [2019-10-07 02:43:10,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 02:43:10,348 INFO L462 AbstractCegarLoop]: Abstraction has 26661 states and 37750 transitions. [2019-10-07 02:43:10,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 02:43:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand 26661 states and 37750 transitions. [2019-10-07 02:43:10,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-07 02:43:10,350 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 02:43:10,350 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 02:43:10,565 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 02:43:10,566 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 02:43:10,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 02:43:10,567 INFO L82 PathProgramCache]: Analyzing trace with hash 533051927, now seen corresponding path program 1 times [2019-10-07 02:43:10,567 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 02:43:10,567 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:43:10,567 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:43:10,568 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:43:10,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 02:43:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:43:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-07 02:43:10,676 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:43:10,676 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 02:43:10,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 02:43:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:43:10,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 02:43:10,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 02:43:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-07 02:43:10,859 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 02:43:10,933 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-07 02:43:10,934 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 02:43:10,934 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2019-10-07 02:43:10,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 02:43:10,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 02:43:10,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-10-07 02:43:10,935 INFO L87 Difference]: Start difference. First operand 26661 states and 37750 transitions. Second operand 5 states. [2019-10-07 02:43:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 02:43:18,901 INFO L93 Difference]: Finished difference Result 74720 states and 109931 transitions. [2019-10-07 02:43:18,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 02:43:18,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-07 02:43:18,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 02:43:19,063 INFO L225 Difference]: With dead ends: 74720 [2019-10-07 02:43:19,064 INFO L226 Difference]: Without dead ends: 48064 [2019-10-07 02:43:19,120 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-10-07 02:43:19,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48064 states. [2019-10-07 02:43:19,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48064 to 42799. [2019-10-07 02:43:19,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42799 states. [2019-10-07 02:43:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42799 states to 42799 states and 59505 transitions. [2019-10-07 02:43:21,594 INFO L78 Accepts]: Start accepts. Automaton has 42799 states and 59505 transitions. Word has length 62 [2019-10-07 02:43:21,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 02:43:21,594 INFO L462 AbstractCegarLoop]: Abstraction has 42799 states and 59505 transitions. [2019-10-07 02:43:21,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 02:43:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 42799 states and 59505 transitions. [2019-10-07 02:43:21,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-07 02:43:21,596 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 02:43:21,596 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-07 02:43:21,800 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 02:43:21,801 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 02:43:21,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 02:43:21,802 INFO L82 PathProgramCache]: Analyzing trace with hash 241211281, now seen corresponding path program 1 times [2019-10-07 02:43:21,802 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 02:43:21,802 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:43:21,802 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:43:21,802 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:43:21,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 02:43:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:43:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 02:43:21,913 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:43:21,913 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 02:43:21,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 02:43:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:43:22,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 02:43:22,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 02:43:22,043 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 02:43:22,043 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 02:43:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 02:43:22,115 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 02:43:22,151 INFO L162 IcfgInterpreter]: Started Sifa with 50 locations of interest [2019-10-07 02:43:22,151 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 02:43:22,158 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 02:43:22,166 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 02:43:22,166 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 02:43:22,397 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 57 for LOIs [2019-10-07 02:43:22,561 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 40 [2019-10-07 02:43:22,772 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 40 [2019-10-07 02:43:22,917 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 21 [2019-10-07 02:43:22,981 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 21 [2019-10-07 02:43:23,270 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 02:43:23,271 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 02:43:23,280 INFO L168 Benchmark]: Toolchain (without parser) took 72734.69 ms. Allocated memory was 145.2 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 90.1 MB in the beginning and 687.5 MB in the end (delta: -597.4 MB). Peak memory consumption was 561.8 MB. Max. memory is 7.1 GB. [2019-10-07 02:43:23,282 INFO L168 Benchmark]: CDTParser took 1.36 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 02:43:23,285 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2426.49 ms. Allocated memory was 145.2 MB in the beginning and 265.3 MB in the end (delta: 120.1 MB). Free memory was 89.9 MB in the beginning and 184.1 MB in the end (delta: -94.3 MB). Peak memory consumption was 115.1 MB. Max. memory is 7.1 GB. [2019-10-07 02:43:23,291 INFO L168 Benchmark]: Boogie Preprocessor took 306.78 ms. Allocated memory is still 265.3 MB. Free memory was 184.1 MB in the beginning and 158.2 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-10-07 02:43:23,298 INFO L168 Benchmark]: RCFGBuilder took 7114.86 ms. Allocated memory was 265.3 MB in the beginning and 423.6 MB in the end (delta: 158.3 MB). Free memory was 158.2 MB in the beginning and 105.8 MB in the end (delta: 52.4 MB). Peak memory consumption was 217.3 MB. Max. memory is 7.1 GB. [2019-10-07 02:43:23,302 INFO L168 Benchmark]: TraceAbstraction took 62877.66 ms. Allocated memory was 423.6 MB in the beginning and 1.3 GB in the end (delta: 880.8 MB). Free memory was 105.8 MB in the beginning and 687.5 MB in the end (delta: -581.7 MB). Peak memory consumption was 299.2 MB. Max. memory is 7.1 GB. [2019-10-07 02:43:23,308 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.36 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2426.49 ms. Allocated memory was 145.2 MB in the beginning and 265.3 MB in the end (delta: 120.1 MB). Free memory was 89.9 MB in the beginning and 184.1 MB in the end (delta: -94.3 MB). Peak memory consumption was 115.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 306.78 ms. Allocated memory is still 265.3 MB. Free memory was 184.1 MB in the beginning and 158.2 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7114.86 ms. Allocated memory was 265.3 MB in the beginning and 423.6 MB in the end (delta: 158.3 MB). Free memory was 158.2 MB in the beginning and 105.8 MB in the end (delta: 52.4 MB). Peak memory consumption was 217.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 62877.66 ms. Allocated memory was 423.6 MB in the beginning and 1.3 GB in the end (delta: 880.8 MB). Free memory was 105.8 MB in the beginning and 687.5 MB in the end (delta: -581.7 MB). Peak memory consumption was 299.2 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...