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/Problem04_label41.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 01:00:07,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 01:00:07,327 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 01:00:07,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 01:00:07,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 01:00:07,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 01:00:07,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 01:00:07,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 01:00:07,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 01:00:07,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 01:00:07,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 01:00:07,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 01:00:07,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 01:00:07,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 01:00:07,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 01:00:07,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 01:00:07,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 01:00:07,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 01:00:07,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 01:00:07,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 01:00:07,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 01:00:07,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 01:00:07,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 01:00:07,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 01:00:07,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 01:00:07,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 01:00:07,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 01:00:07,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 01:00:07,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 01:00:07,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 01:00:07,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 01:00:07,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 01:00:07,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 01:00:07,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 01:00:07,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 01:00:07,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 01:00:07,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 01:00:07,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 01:00:07,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 01:00:07,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 01:00:07,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 01:00:07,376 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 01:00:07,390 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 01:00:07,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 01:00:07,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 01:00:07,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 01:00:07,391 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 01:00:07,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 01:00:07,392 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 01:00:07,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 01:00:07,392 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 01:00:07,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 01:00:07,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 01:00:07,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 01:00:07,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 01:00:07,393 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 01:00:07,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 01:00:07,394 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 01:00:07,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 01:00:07,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 01:00:07,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 01:00:07,395 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 01:00:07,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 01:00:07,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 01:00:07,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 01:00:07,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 01:00:07,396 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 01:00:07,396 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 01:00:07,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 01:00:07,396 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 01:00:07,396 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 01:00:07,698 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 01:00:07,711 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 01:00:07,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 01:00:07,716 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 01:00:07,716 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 01:00:07,717 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem04_label41.c [2019-10-07 01:00:07,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea63c72c/f21a454dfed64291ae554de997c82268/FLAG313b404aa [2019-10-07 01:00:08,584 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 01:00:08,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem04_label41.c [2019-10-07 01:00:08,613 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea63c72c/f21a454dfed64291ae554de997c82268/FLAG313b404aa [2019-10-07 01:00:08,653 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea63c72c/f21a454dfed64291ae554de997c82268 [2019-10-07 01:00:08,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 01:00:08,666 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 01:00:08,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 01:00:08,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 01:00:08,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 01:00:08,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:00:08" (1/1) ... [2019-10-07 01:00:08,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f916025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:00:08, skipping insertion in model container [2019-10-07 01:00:08,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:00:08" (1/1) ... [2019-10-07 01:00:08,689 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 01:00:08,858 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 01:00:10,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 01:00:10,447 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 01:00:11,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 01:00:11,120 INFO L192 MainTranslator]: Completed translation [2019-10-07 01:00:11,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:00:11 WrapperNode [2019-10-07 01:00:11,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 01:00:11,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 01:00:11,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 01:00:11,122 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 01:00:11,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:00:11" (1/1) ... [2019-10-07 01:00:11,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:00:11" (1/1) ... [2019-10-07 01:00:11,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:00:11" (1/1) ... [2019-10-07 01:00:11,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:00:11" (1/1) ... [2019-10-07 01:00:11,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:00:11" (1/1) ... [2019-10-07 01:00:11,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:00:11" (1/1) ... [2019-10-07 01:00:11,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:00:11" (1/1) ... [2019-10-07 01:00:11,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 01:00:11,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 01:00:11,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 01:00:11,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 01:00:11,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:00:11" (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 01:00:11,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 01:00:11,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 01:00:11,475 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 01:00:11,476 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-07 01:00:11,476 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-10-07 01:00:11,477 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-10-07 01:00:11,478 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 01:00:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 01:00:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-07 01:00:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-10-07 01:00:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-10-07 01:00:11,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 01:00:11,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 01:00:11,483 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 01:00:11,483 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 01:00:11,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 01:00:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 01:00:16,763 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 01:00:16,764 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 01:00:16,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:00:16 BoogieIcfgContainer [2019-10-07 01:00:16,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 01:00:16,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 01:00:16,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 01:00:16,777 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 01:00:16,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:00:08" (1/3) ... [2019-10-07 01:00:16,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742c6baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:00:16, skipping insertion in model container [2019-10-07 01:00:16,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:00:11" (2/3) ... [2019-10-07 01:00:16,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742c6baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:00:16, skipping insertion in model container [2019-10-07 01:00:16,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:00:16" (3/3) ... [2019-10-07 01:00:16,795 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem04_label41.c [2019-10-07 01:00:16,806 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 01:00:16,817 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 01:00:16,829 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 01:00:16,872 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 01:00:16,873 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 01:00:16,873 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 01:00:16,873 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 01:00:16,873 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 01:00:16,873 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 01:00:16,873 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 01:00:16,874 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 01:00:16,915 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states. [2019-10-07 01:00:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 768 [2019-10-07 01:00:16,967 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 01:00:16,969 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:16,971 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_output4Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 01:00:16,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 01:00:16,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1899127143, now seen corresponding path program 1 times [2019-10-07 01:00:16,986 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 01:00:16,987 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 01:00:16,987 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 01:00:16,988 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 01:00:16,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 01:00:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 01:00:19,157 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 01:00:19,157 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 01:00:19,158 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 01:00:19,158 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 01:00:19,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 01:00:19,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 01:00:19,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 01:00:19,178 INFO L87 Difference]: Start difference. First operand 785 states. Second operand 3 states. [2019-10-07 01:00:23,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 01:00:23,944 INFO L93 Difference]: Finished difference Result 2343 states and 4615 transitions. [2019-10-07 01:00:23,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 01:00:23,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 767 [2019-10-07 01:00:23,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 01:00:23,996 INFO L225 Difference]: With dead ends: 2343 [2019-10-07 01:00:23,996 INFO L226 Difference]: Without dead ends: 1555 [2019-10-07 01:00:24,008 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 5 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 01:00:24,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2019-10-07 01:00:24,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1555. [2019-10-07 01:00:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2019-10-07 01:00:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2847 transitions. [2019-10-07 01:00:24,209 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2847 transitions. Word has length 767 [2019-10-07 01:00:24,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 01:00:24,214 INFO L462 AbstractCegarLoop]: Abstraction has 1555 states and 2847 transitions. [2019-10-07 01:00:24,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 01:00:24,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2847 transitions. [2019-10-07 01:00:24,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 783 [2019-10-07 01:00:24,259 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 01:00:24,260 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:24,261 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_output4Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 01:00:24,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 01:00:24,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1340667238, now seen corresponding path program 1 times [2019-10-07 01:00:24,262 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 01:00:24,263 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 01:00:24,263 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 01:00:24,263 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 01:00:24,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 01:00:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 01:00:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 01:00:24,979 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 01:00:24,979 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 01:00:24,979 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 01:00:24,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 01:00:24,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 01:00:24,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 01:00:24,983 INFO L87 Difference]: Start difference. First operand 1555 states and 2847 transitions. Second operand 6 states. [2019-10-07 01:00:31,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 01:00:31,368 INFO L93 Difference]: Finished difference Result 4764 states and 8788 transitions. [2019-10-07 01:00:31,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 01:00:31,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 782 [2019-10-07 01:00:31,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 01:00:31,392 INFO L225 Difference]: With dead ends: 4764 [2019-10-07 01:00:31,392 INFO L226 Difference]: Without dead ends: 3214 [2019-10-07 01:00:31,397 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 01:00:31,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3214 states. [2019-10-07 01:00:31,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3214 to 3154. [2019-10-07 01:00:31,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3154 states. [2019-10-07 01:00:31,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3154 states to 3154 states and 5656 transitions. [2019-10-07 01:00:31,545 INFO L78 Accepts]: Start accepts. Automaton has 3154 states and 5656 transitions. Word has length 782 [2019-10-07 01:00:31,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 01:00:31,546 INFO L462 AbstractCegarLoop]: Abstraction has 3154 states and 5656 transitions. [2019-10-07 01:00:31,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 01:00:31,546 INFO L276 IsEmpty]: Start isEmpty. Operand 3154 states and 5656 transitions. [2019-10-07 01:00:31,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2019-10-07 01:00:31,597 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 01:00:31,598 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:31,599 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_output4Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 01:00:31,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 01:00:31,601 INFO L82 PathProgramCache]: Analyzing trace with hash 949893184, now seen corresponding path program 1 times [2019-10-07 01:00:31,601 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 01:00:31,601 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 01:00:31,602 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 01:00:31,602 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 01:00:31,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 01:00:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 01:00:32,393 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 01:00:32,395 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 01:00:32,395 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 01:00:32,396 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 01:00:32,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 01:00:32,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 01:00:32,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 01:00:32,401 INFO L87 Difference]: Start difference. First operand 3154 states and 5656 transitions. Second operand 6 states. [2019-10-07 01:00:37,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 01:00:37,982 INFO L93 Difference]: Finished difference Result 8033 states and 14305 transitions. [2019-10-07 01:00:37,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 01:00:37,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 795 [2019-10-07 01:00:37,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 01:00:38,021 INFO L225 Difference]: With dead ends: 8033 [2019-10-07 01:00:38,021 INFO L226 Difference]: Without dead ends: 4884 [2019-10-07 01:00:38,031 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 01:00:38,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4884 states. [2019-10-07 01:00:38,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4884 to 4855. [2019-10-07 01:00:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4855 states. [2019-10-07 01:00:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4855 states to 4855 states and 7630 transitions. [2019-10-07 01:00:38,205 INFO L78 Accepts]: Start accepts. Automaton has 4855 states and 7630 transitions. Word has length 795 [2019-10-07 01:00:38,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 01:00:38,205 INFO L462 AbstractCegarLoop]: Abstraction has 4855 states and 7630 transitions. [2019-10-07 01:00:38,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 01:00:38,206 INFO L276 IsEmpty]: Start isEmpty. Operand 4855 states and 7630 transitions. [2019-10-07 01:00:38,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 802 [2019-10-07 01:00:38,226 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 01:00:38,227 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:38,227 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_output4Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 01:00:38,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 01:00:38,228 INFO L82 PathProgramCache]: Analyzing trace with hash -599412095, now seen corresponding path program 1 times [2019-10-07 01:00:38,228 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 01:00:38,228 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 01:00:38,229 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 01:00:38,229 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 01:00:38,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 01:00:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 01:00:39,115 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 01:00:39,115 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 01:00:39,115 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 01:00:39,116 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 01:00:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 01:00:39,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-07 01:00:39,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 01:00:40,462 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 01:00:40,465 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 01:00:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 01:00:41,360 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 01:00:41,360 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-07 01:00:41,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 01:00:41,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 01:00:41,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 01:00:41,363 INFO L87 Difference]: Start difference. First operand 4855 states and 7630 transitions. Second operand 3 states. [2019-10-07 01:00:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 01:00:45,337 INFO L93 Difference]: Finished difference Result 14486 states and 23279 transitions. [2019-10-07 01:00:45,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 01:00:45,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 801 [2019-10-07 01:00:45,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 01:00:45,389 INFO L225 Difference]: With dead ends: 14486 [2019-10-07 01:00:45,389 INFO L226 Difference]: Without dead ends: 9636 [2019-10-07 01:00:45,407 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1607 GetRequests, 1597 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 01:00:45,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9636 states. [2019-10-07 01:00:45,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9636 to 9636. [2019-10-07 01:00:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9636 states. [2019-10-07 01:00:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9636 states to 9636 states and 15339 transitions. [2019-10-07 01:00:45,683 INFO L78 Accepts]: Start accepts. Automaton has 9636 states and 15339 transitions. Word has length 801 [2019-10-07 01:00:45,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 01:00:45,684 INFO L462 AbstractCegarLoop]: Abstraction has 9636 states and 15339 transitions. [2019-10-07 01:00:45,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 01:00:45,684 INFO L276 IsEmpty]: Start isEmpty. Operand 9636 states and 15339 transitions. [2019-10-07 01:00:45,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2019-10-07 01:00:45,716 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 01:00:45,717 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:45,922 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 01:00:45,922 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_output4Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 01:00:45,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 01:00:45,923 INFO L82 PathProgramCache]: Analyzing trace with hash 97622972, now seen corresponding path program 1 times [2019-10-07 01:00:45,923 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 01:00:45,923 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 01:00:45,923 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 01:00:45,924 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 01:00:45,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 01:00:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 01:00:46,861 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 01:00:46,861 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 01:00:46,862 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 01:00:46,862 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 01:00:46,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 01:00:46,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 01:00:46,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 01:00:46,864 INFO L87 Difference]: Start difference. First operand 9636 states and 15339 transitions. Second operand 6 states. [2019-10-07 01:00:52,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 01:00:52,901 INFO L93 Difference]: Finished difference Result 24291 states and 39873 transitions. [2019-10-07 01:00:52,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 01:00:52,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 829 [2019-10-07 01:00:52,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 01:00:52,974 INFO L225 Difference]: With dead ends: 24291 [2019-10-07 01:00:52,974 INFO L226 Difference]: Without dead ends: 14660 [2019-10-07 01:00:53,001 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 01:00:53,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14660 states. [2019-10-07 01:00:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14660 to 14557. [2019-10-07 01:00:53,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14557 states. [2019-10-07 01:00:53,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14557 states to 14557 states and 22286 transitions. [2019-10-07 01:00:53,371 INFO L78 Accepts]: Start accepts. Automaton has 14557 states and 22286 transitions. Word has length 829 [2019-10-07 01:00:53,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 01:00:53,372 INFO L462 AbstractCegarLoop]: Abstraction has 14557 states and 22286 transitions. [2019-10-07 01:00:53,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 01:00:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 14557 states and 22286 transitions. [2019-10-07 01:00:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2019-10-07 01:00:53,413 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 01:00:53,413 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:53,414 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_output4Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 01:00:53,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 01:00:53,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1873913909, now seen corresponding path program 1 times [2019-10-07 01:00:53,415 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 01:00:53,415 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 01:00:53,415 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 01:00:53,415 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 01:00:53,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 01:00:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 01:00:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 01:00:54,283 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 01:00:54,284 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 01:00:54,284 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 01:00:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 01:00:54,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 01:00:54,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 01:00:55,164 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 01:00:55,166 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 01:00:55,579 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 01:00:55,580 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 01:00:55,635 INFO L162 IcfgInterpreter]: Started Sifa with 771 locations of interest [2019-10-07 01:00:55,635 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 01:00:55,650 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 01:00:55,658 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 01:00:55,658 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 01:00:56,060 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 101 for LOIs [2019-10-07 01:00:56,836 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 01:00:56,837 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 01:00:56,843 INFO L168 Benchmark]: Toolchain (without parser) took 48175.91 ms. Allocated memory was 145.2 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 87.9 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 367.2 MB. Max. memory is 7.1 GB. [2019-10-07 01:00:56,845 INFO L168 Benchmark]: CDTParser took 0.21 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 01:00:56,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2450.21 ms. Allocated memory was 145.2 MB in the beginning and 258.5 MB in the end (delta: 113.2 MB). Free memory was 87.7 MB in the beginning and 175.3 MB in the end (delta: -87.7 MB). Peak memory consumption was 112.9 MB. Max. memory is 7.1 GB. [2019-10-07 01:00:56,847 INFO L168 Benchmark]: Boogie Preprocessor took 279.57 ms. Allocated memory is still 258.5 MB. Free memory was 175.3 MB in the beginning and 146.4 MB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2019-10-07 01:00:56,848 INFO L168 Benchmark]: RCFGBuilder took 5369.93 ms. Allocated memory was 258.5 MB in the beginning and 408.9 MB in the end (delta: 150.5 MB). Free memory was 146.4 MB in the beginning and 104.1 MB in the end (delta: 42.3 MB). Peak memory consumption was 198.0 MB. Max. memory is 7.1 GB. [2019-10-07 01:00:56,849 INFO L168 Benchmark]: TraceAbstraction took 40067.10 ms. Allocated memory was 408.9 MB in the beginning and 1.6 GB in the end (delta: 1.1 GB). Free memory was 104.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 119.7 MB. Max. memory is 7.1 GB. [2019-10-07 01:00:56,853 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.21 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 2450.21 ms. Allocated memory was 145.2 MB in the beginning and 258.5 MB in the end (delta: 113.2 MB). Free memory was 87.7 MB in the beginning and 175.3 MB in the end (delta: -87.7 MB). Peak memory consumption was 112.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 279.57 ms. Allocated memory is still 258.5 MB. Free memory was 175.3 MB in the beginning and 146.4 MB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5369.93 ms. Allocated memory was 258.5 MB in the beginning and 408.9 MB in the end (delta: 150.5 MB). Free memory was 146.4 MB in the beginning and 104.1 MB in the end (delta: 42.3 MB). Peak memory consumption was 198.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 40067.10 ms. Allocated memory was 408.9 MB in the beginning and 1.6 GB in the end (delta: 1.1 GB). Free memory was 104.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 119.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: 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...