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/Problem02_label45.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:58:11,397 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:58:11,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:58:11,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:58:11,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:58:11,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:58:11,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:58:11,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:58:11,438 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:58:11,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:58:11,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:58:11,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:58:11,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:58:11,447 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:58:11,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:58:11,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:58:11,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:58:11,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:58:11,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:58:11,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:58:11,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:58:11,470 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:58:11,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:58:11,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:58:11,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:58:11,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:58:11,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:58:11,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:58:11,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:58:11,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:58:11,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:58:11,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:58:11,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:58:11,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:58:11,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:58:11,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:58:11,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:58:11,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:58:11,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:58:11,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:58:11,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:58:11,487 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 00:58:11,502 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:58:11,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:58:11,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:58:11,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:58:11,504 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:58:11,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:58:11,504 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:58:11,504 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:58:11,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:58:11,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:58:11,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:58:11,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:58:11,505 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:58:11,507 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:58:11,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:58:11,508 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:58:11,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:58:11,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:58:11,508 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:58:11,508 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:58:11,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:58:11,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:58:11,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:58:11,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:58:11,509 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:58:11,509 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:58:11,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:58:11,510 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:58:11,510 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 00:58:11,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:58:11,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:58:11,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:58:11,845 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:58:11,845 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:58:11,846 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label45.c [2019-10-07 00:58:11,925 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/320cca9c6/580c2c0ee8594e7f9fbd7c8a9f82995b/FLAGecd92b74b [2019-10-07 00:58:12,550 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:58:12,551 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label45.c [2019-10-07 00:58:12,568 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/320cca9c6/580c2c0ee8594e7f9fbd7c8a9f82995b/FLAGecd92b74b [2019-10-07 00:58:12,750 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/320cca9c6/580c2c0ee8594e7f9fbd7c8a9f82995b [2019-10-07 00:58:12,761 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:58:12,763 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:58:12,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:58:12,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:58:12,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:58:12,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:58:12" (1/1) ... [2019-10-07 00:58:12,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f01636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:12, skipping insertion in model container [2019-10-07 00:58:12,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:58:12" (1/1) ... [2019-10-07 00:58:12,781 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:58:12,834 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:58:13,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:58:13,407 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:58:13,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:58:13,557 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:58:13,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:13 WrapperNode [2019-10-07 00:58:13,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:58:13,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:58:13,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:58:13,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:58:13,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:13" (1/1) ... [2019-10-07 00:58:13,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:13" (1/1) ... [2019-10-07 00:58:13,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:13" (1/1) ... [2019-10-07 00:58:13,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:13" (1/1) ... [2019-10-07 00:58:13,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:13" (1/1) ... [2019-10-07 00:58:13,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:13" (1/1) ... [2019-10-07 00:58:13,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:13" (1/1) ... [2019-10-07 00:58:13,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:58:13,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:58:13,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:58:13,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:58:13,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:58:13,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:58:13,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:58:13,726 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 00:58:13,726 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:58:13,727 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 00:58:13,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:58:13,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:58:13,727 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 00:58:13,727 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:58:13,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:58:13,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:58:15,997 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:58:15,997 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:58:15,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:58:15 BoogieIcfgContainer [2019-10-07 00:58:15,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:58:16,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:58:16,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:58:16,008 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:58:16,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:58:12" (1/3) ... [2019-10-07 00:58:16,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c0bad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:58:16, skipping insertion in model container [2019-10-07 00:58:16,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:13" (2/3) ... [2019-10-07 00:58:16,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c0bad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:58:16, skipping insertion in model container [2019-10-07 00:58:16,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:58:15" (3/3) ... [2019-10-07 00:58:16,027 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label45.c [2019-10-07 00:58:16,042 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:58:16,051 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:58:16,063 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:58:16,092 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:58:16,093 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:58:16,093 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:58:16,093 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:58:16,093 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:58:16,093 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:58:16,094 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:58:16,094 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:58:16,115 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-10-07 00:58:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-07 00:58:16,126 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:16,127 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:58:16,129 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:16,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:16,136 INFO L82 PathProgramCache]: Analyzing trace with hash -219486466, now seen corresponding path program 1 times [2019-10-07 00:58:16,146 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:16,146 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:16,147 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:16,147 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:16,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:16,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:16,627 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:16,628 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:16,628 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:58:16,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:58:16,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:58:16,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:16,656 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 3 states. [2019-10-07 00:58:17,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:17,263 INFO L93 Difference]: Finished difference Result 273 states and 508 transitions. [2019-10-07 00:58:17,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:58:17,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-10-07 00:58:17,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:17,294 INFO L225 Difference]: With dead ends: 273 [2019-10-07 00:58:17,294 INFO L226 Difference]: Without dead ends: 175 [2019-10-07 00:58:17,302 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 00:58:17,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-07 00:58:17,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-10-07 00:58:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-07 00:58:17,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 312 transitions. [2019-10-07 00:58:17,423 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 312 transitions. Word has length 86 [2019-10-07 00:58:17,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:17,454 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 312 transitions. [2019-10-07 00:58:17,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:58:17,455 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 312 transitions. [2019-10-07 00:58:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-07 00:58:17,465 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:17,468 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:58:17,469 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:17,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:17,469 INFO L82 PathProgramCache]: Analyzing trace with hash -702021245, now seen corresponding path program 1 times [2019-10-07 00:58:17,470 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:17,470 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:17,471 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:17,471 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:17,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:17,631 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:17,632 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:17,632 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 00:58:17,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 00:58:17,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 00:58:17,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 00:58:17,634 INFO L87 Difference]: Start difference. First operand 175 states and 312 transitions. Second operand 4 states. [2019-10-07 00:58:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:18,441 INFO L93 Difference]: Finished difference Result 681 states and 1261 transitions. [2019-10-07 00:58:18,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 00:58:18,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-07 00:58:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:18,449 INFO L225 Difference]: With dead ends: 681 [2019-10-07 00:58:18,449 INFO L226 Difference]: Without dead ends: 511 [2019-10-07 00:58:18,452 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 00:58:18,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-10-07 00:58:18,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2019-10-07 00:58:18,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-10-07 00:58:18,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 836 transitions. [2019-10-07 00:58:18,495 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 836 transitions. Word has length 94 [2019-10-07 00:58:18,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:18,496 INFO L462 AbstractCegarLoop]: Abstraction has 511 states and 836 transitions. [2019-10-07 00:58:18,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 00:58:18,497 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 836 transitions. [2019-10-07 00:58:18,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-07 00:58:18,501 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:18,501 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:58:18,501 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:18,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:18,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1307424922, now seen corresponding path program 1 times [2019-10-07 00:58:18,502 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:18,502 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:18,503 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:18,503 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:18,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:18,584 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:18,585 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:18,585 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:58:18,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:58:18,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:58:18,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:58:18,587 INFO L87 Difference]: Start difference. First operand 511 states and 836 transitions. Second operand 6 states. [2019-10-07 00:58:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:19,285 INFO L93 Difference]: Finished difference Result 1237 states and 2158 transitions. [2019-10-07 00:58:19,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:58:19,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2019-10-07 00:58:19,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:19,294 INFO L225 Difference]: With dead ends: 1237 [2019-10-07 00:58:19,295 INFO L226 Difference]: Without dead ends: 731 [2019-10-07 00:58:19,299 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:58:19,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-10-07 00:58:19,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 703. [2019-10-07 00:58:19,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-10-07 00:58:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1139 transitions. [2019-10-07 00:58:19,373 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1139 transitions. Word has length 108 [2019-10-07 00:58:19,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:19,376 INFO L462 AbstractCegarLoop]: Abstraction has 703 states and 1139 transitions. [2019-10-07 00:58:19,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:58:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1139 transitions. [2019-10-07 00:58:19,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-07 00:58:19,387 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:19,389 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:58:19,390 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:19,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:19,390 INFO L82 PathProgramCache]: Analyzing trace with hash -650311126, now seen corresponding path program 1 times [2019-10-07 00:58:19,391 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:19,391 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:19,391 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:19,391 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:19,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:19,603 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:19,603 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:19,603 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:58:19,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:58:19,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:58:19,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:58:19,605 INFO L87 Difference]: Start difference. First operand 703 states and 1139 transitions. Second operand 6 states. [2019-10-07 00:58:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:20,464 INFO L93 Difference]: Finished difference Result 1725 states and 2992 transitions. [2019-10-07 00:58:20,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 00:58:20,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2019-10-07 00:58:20,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:20,473 INFO L225 Difference]: With dead ends: 1725 [2019-10-07 00:58:20,474 INFO L226 Difference]: Without dead ends: 1027 [2019-10-07 00:58:20,477 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-10-07 00:58:20,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-10-07 00:58:20,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 997. [2019-10-07 00:58:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-10-07 00:58:20,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1484 transitions. [2019-10-07 00:58:20,529 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1484 transitions. Word has length 110 [2019-10-07 00:58:20,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:20,529 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1484 transitions. [2019-10-07 00:58:20,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:58:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1484 transitions. [2019-10-07 00:58:20,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-07 00:58:20,534 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:20,535 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:58:20,535 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:20,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:20,536 INFO L82 PathProgramCache]: Analyzing trace with hash -72689956, now seen corresponding path program 1 times [2019-10-07 00:58:20,536 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:20,536 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:20,536 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:20,537 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:20,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:20,633 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:20,633 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:20,633 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:58:20,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:58:20,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:58:20,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:58:20,635 INFO L87 Difference]: Start difference. First operand 997 states and 1484 transitions. Second operand 6 states. [2019-10-07 00:58:21,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:21,338 INFO L93 Difference]: Finished difference Result 2743 states and 4368 transitions. [2019-10-07 00:58:21,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:58:21,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-10-07 00:58:21,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:21,360 INFO L225 Difference]: With dead ends: 2743 [2019-10-07 00:58:21,360 INFO L226 Difference]: Without dead ends: 1751 [2019-10-07 00:58:21,364 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 00:58:21,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2019-10-07 00:58:21,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1711. [2019-10-07 00:58:21,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1711 states. [2019-10-07 00:58:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2392 transitions. [2019-10-07 00:58:21,439 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2392 transitions. Word has length 117 [2019-10-07 00:58:21,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:21,440 INFO L462 AbstractCegarLoop]: Abstraction has 1711 states and 2392 transitions. [2019-10-07 00:58:21,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:58:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2392 transitions. [2019-10-07 00:58:21,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-07 00:58:21,447 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:21,447 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:58:21,447 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:21,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:21,448 INFO L82 PathProgramCache]: Analyzing trace with hash 5219257, now seen corresponding path program 1 times [2019-10-07 00:58:21,448 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:21,448 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:21,448 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:21,448 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:21,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:21,601 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:21,602 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:21,602 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:58:21,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:58:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:21,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 00:58:21,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:58:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:58:21,819 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:58:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:58:21,905 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 00:58:21,906 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2019-10-07 00:58:21,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:58:21,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:58:21,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:58:21,909 INFO L87 Difference]: Start difference. First operand 1711 states and 2392 transitions. Second operand 3 states. [2019-10-07 00:58:22,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:22,408 INFO L93 Difference]: Finished difference Result 4009 states and 5605 transitions. [2019-10-07 00:58:22,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:58:22,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-10-07 00:58:22,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:22,418 INFO L225 Difference]: With dead ends: 4009 [2019-10-07 00:58:22,418 INFO L226 Difference]: Without dead ends: 1521 [2019-10-07 00:58:22,426 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 244 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:58:22,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-10-07 00:58:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1521. [2019-10-07 00:58:22,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2019-10-07 00:58:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2002 transitions. [2019-10-07 00:58:22,496 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2002 transitions. Word has length 121 [2019-10-07 00:58:22,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:22,497 INFO L462 AbstractCegarLoop]: Abstraction has 1521 states and 2002 transitions. [2019-10-07 00:58:22,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:58:22,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2002 transitions. [2019-10-07 00:58:22,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-07 00:58:22,503 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:22,503 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:58:22,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:58:22,708 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:22,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:22,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2015126325, now seen corresponding path program 1 times [2019-10-07 00:58:22,718 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:22,719 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:22,719 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:22,719 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:22,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 78 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-07 00:58:22,848 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:22,848 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:58:22,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:58:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:22,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 00:58:22,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:58:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-07 00:58:23,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:58:23,189 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 78 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-07 00:58:23,190 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:58:23,240 INFO L162 IcfgInterpreter]: Started Sifa with 90 locations of interest [2019-10-07 00:58:23,240 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:58:23,249 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:58:23,265 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:58:23,266 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:58:23,534 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 89 for LOIs [2019-10-07 00:58:24,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:58:24,025 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 00:58:24,032 INFO L168 Benchmark]: Toolchain (without parser) took 11268.80 ms. Allocated memory was 144.2 MB in the beginning and 388.5 MB in the end (delta: 244.3 MB). Free memory was 100.0 MB in the beginning and 182.6 MB in the end (delta: -82.6 MB). Peak memory consumption was 161.7 MB. Max. memory is 7.1 GB. [2019-10-07 00:58:24,034 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.2 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 00:58:24,035 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.48 ms. Allocated memory was 144.2 MB in the beginning and 203.4 MB in the end (delta: 59.2 MB). Free memory was 99.8 MB in the beginning and 170.4 MB in the end (delta: -70.6 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. [2019-10-07 00:58:24,035 INFO L168 Benchmark]: Boogie Preprocessor took 97.90 ms. Allocated memory is still 203.4 MB. Free memory was 170.4 MB in the beginning and 165.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-10-07 00:58:24,036 INFO L168 Benchmark]: RCFGBuilder took 2342.64 ms. Allocated memory was 203.4 MB in the beginning and 253.2 MB in the end (delta: 49.8 MB). Free memory was 164.8 MB in the beginning and 196.9 MB in the end (delta: -32.1 MB). Peak memory consumption was 118.1 MB. Max. memory is 7.1 GB. [2019-10-07 00:58:24,037 INFO L168 Benchmark]: TraceAbstraction took 8027.60 ms. Allocated memory was 253.2 MB in the beginning and 388.5 MB in the end (delta: 135.3 MB). Free memory was 196.9 MB in the beginning and 182.6 MB in the end (delta: 14.3 MB). Peak memory consumption was 149.5 MB. Max. memory is 7.1 GB. [2019-10-07 00:58:24,042 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.24 ms. Allocated memory is still 144.2 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 793.48 ms. Allocated memory was 144.2 MB in the beginning and 203.4 MB in the end (delta: 59.2 MB). Free memory was 99.8 MB in the beginning and 170.4 MB in the end (delta: -70.6 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 97.90 ms. Allocated memory is still 203.4 MB. Free memory was 170.4 MB in the beginning and 165.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2342.64 ms. Allocated memory was 203.4 MB in the beginning and 253.2 MB in the end (delta: 49.8 MB). Free memory was 164.8 MB in the beginning and 196.9 MB in the end (delta: -32.1 MB). Peak memory consumption was 118.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8027.60 ms. Allocated memory was 253.2 MB in the beginning and 388.5 MB in the end (delta: 135.3 MB). Free memory was 196.9 MB in the beginning and 182.6 MB in the end (delta: 14.3 MB). Peak memory consumption was 149.5 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...