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/Problem01_label42.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:40:34,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:40:34,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:40:34,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:40:34,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:40:34,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:40:34,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:40:34,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:40:34,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:40:34,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:40:34,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:40:34,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:40:34,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:40:34,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:40:34,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:40:34,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:40:34,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:40:34,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:40:34,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:40:34,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:40:34,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:40:34,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:40:34,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:40:34,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:40:34,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:40:34,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:40:34,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:40:34,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:40:34,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:40:34,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:40:34,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:40:34,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:40:34,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:40:34,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:40:34,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:40:34,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:40:34,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:40:34,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:40:34,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:40:34,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:40:34,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:40:34,783 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-13 21:40:34,804 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:40:34,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:40:34,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:40:34,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:40:34,807 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:40:34,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:40:34,807 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:40:34,807 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:40:34,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:40:34,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:40:34,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:40:34,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:40:34,809 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:40:34,810 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:40:34,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:40:34,810 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:40:34,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:40:34,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:40:34,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:40:34,811 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:40:34,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:40:34,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:40:34,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:40:34,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:40:34,812 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:40:34,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:40:34,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:40:34,813 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:40:34,813 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-13 21:40:35,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:40:35,149 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:40:35,152 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:40:35,153 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:40:35,153 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:40:35,154 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label42.c [2019-10-13 21:40:35,217 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b3485442/56d0c97631824036b212bde8678c0eeb/FLAG539738f46 [2019-10-13 21:40:35,776 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:40:35,777 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label42.c [2019-10-13 21:40:35,790 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b3485442/56d0c97631824036b212bde8678c0eeb/FLAG539738f46 [2019-10-13 21:40:36,052 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b3485442/56d0c97631824036b212bde8678c0eeb [2019-10-13 21:40:36,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:40:36,065 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:40:36,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:40:36,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:40:36,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:40:36,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:40:36" (1/1) ... [2019-10-13 21:40:36,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a725cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:36, skipping insertion in model container [2019-10-13 21:40:36,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:40:36" (1/1) ... [2019-10-13 21:40:36,084 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:40:36,139 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:40:36,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:40:36,680 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:40:36,796 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:40:36,813 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:40:36,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:36 WrapperNode [2019-10-13 21:40:36,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:40:36,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:40:36,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:40:36,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:40:36,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:36" (1/1) ... [2019-10-13 21:40:36,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:36" (1/1) ... [2019-10-13 21:40:36,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:36" (1/1) ... [2019-10-13 21:40:36,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:36" (1/1) ... [2019-10-13 21:40:36,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:36" (1/1) ... [2019-10-13 21:40:36,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:36" (1/1) ... [2019-10-13 21:40:36,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:36" (1/1) ... [2019-10-13 21:40:36,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:40:36,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:40:36,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:40:36,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:40:36,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:36" (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-13 21:40:36,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:40:36,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:40:36,986 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 21:40:36,986 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:40:36,986 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 21:40:36,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:40:36,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:40:36,987 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:40:36,988 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:40:36,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:40:36,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:40:38,920 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:40:38,921 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:40:38,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:40:38 BoogieIcfgContainer [2019-10-13 21:40:38,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:40:38,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:40:38,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:40:38,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:40:38,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:40:36" (1/3) ... [2019-10-13 21:40:38,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7346b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:40:38, skipping insertion in model container [2019-10-13 21:40:38,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:36" (2/3) ... [2019-10-13 21:40:38,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7346b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:40:38, skipping insertion in model container [2019-10-13 21:40:38,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:40:38" (3/3) ... [2019-10-13 21:40:38,938 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label42.c [2019-10-13 21:40:38,953 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:40:38,963 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:40:38,974 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:40:39,001 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:40:39,001 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:40:39,001 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:40:39,001 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:40:39,002 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:40:39,002 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:40:39,002 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:40:39,002 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:40:39,022 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-10-13 21:40:39,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 21:40:39,032 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:39,033 INFO L380 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] [2019-10-13 21:40:39,034 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:39,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:39,039 INFO L82 PathProgramCache]: Analyzing trace with hash 826822244, now seen corresponding path program 1 times [2019-10-13 21:40:39,046 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:39,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751212326] [2019-10-13 21:40:39,046 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:39,046 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:39,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:39,470 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-13 21:40:39,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751212326] [2019-10-13 21:40:39,472 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:39,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:40:39,473 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107083569] [2019-10-13 21:40:39,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:39,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:39,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:39,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:40:39,497 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-10-13 21:40:40,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:40,136 INFO L93 Difference]: Finished difference Result 246 states and 454 transitions. [2019-10-13 21:40:40,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:40,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-13 21:40:40,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:40,155 INFO L225 Difference]: With dead ends: 246 [2019-10-13 21:40:40,156 INFO L226 Difference]: Without dead ends: 157 [2019-10-13 21:40:40,161 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:40:40,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-13 21:40:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-10-13 21:40:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-13 21:40:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 273 transitions. [2019-10-13 21:40:40,231 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 273 transitions. Word has length 77 [2019-10-13 21:40:40,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:40,232 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 273 transitions. [2019-10-13 21:40:40,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:40,233 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 273 transitions. [2019-10-13 21:40:40,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-13 21:40:40,237 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:40,238 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:40:40,238 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:40,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:40,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1195664389, now seen corresponding path program 1 times [2019-10-13 21:40:40,239 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:40,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140290326] [2019-10-13 21:40:40,239 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:40,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:40,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:40,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140290326] [2019-10-13 21:40:40,368 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:40,368 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:40:40,368 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107063555] [2019-10-13 21:40:40,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:40:40,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:40,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:40:40,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:40:40,372 INFO L87 Difference]: Start difference. First operand 157 states and 273 transitions. Second operand 6 states. [2019-10-13 21:40:41,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:41,007 INFO L93 Difference]: Finished difference Result 479 states and 861 transitions. [2019-10-13 21:40:41,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:40:41,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-10-13 21:40:41,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:41,014 INFO L225 Difference]: With dead ends: 479 [2019-10-13 21:40:41,015 INFO L226 Difference]: Without dead ends: 327 [2019-10-13 21:40:41,017 INFO L600 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-13 21:40:41,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-10-13 21:40:41,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 315. [2019-10-13 21:40:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-10-13 21:40:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 544 transitions. [2019-10-13 21:40:41,060 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 544 transitions. Word has length 87 [2019-10-13 21:40:41,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:41,061 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 544 transitions. [2019-10-13 21:40:41,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:40:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 544 transitions. [2019-10-13 21:40:41,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 21:40:41,066 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:41,066 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:40:41,066 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:41,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:41,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2128685993, now seen corresponding path program 1 times [2019-10-13 21:40:41,067 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:41,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844814298] [2019-10-13 21:40:41,067 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:41,068 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:41,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:41,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844814298] [2019-10-13 21:40:41,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:41,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:40:41,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165939517] [2019-10-13 21:40:41,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:41,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:41,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:41,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:40:41,227 INFO L87 Difference]: Start difference. First operand 315 states and 544 transitions. Second operand 3 states. [2019-10-13 21:40:41,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:41,659 INFO L93 Difference]: Finished difference Result 852 states and 1501 transitions. [2019-10-13 21:40:41,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:41,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-10-13 21:40:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:41,667 INFO L225 Difference]: With dead ends: 852 [2019-10-13 21:40:41,668 INFO L226 Difference]: Without dead ends: 542 [2019-10-13 21:40:41,670 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:40:41,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-10-13 21:40:41,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 540. [2019-10-13 21:40:41,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-10-13 21:40:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 858 transitions. [2019-10-13 21:40:41,715 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 858 transitions. Word has length 88 [2019-10-13 21:40:41,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:41,716 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 858 transitions. [2019-10-13 21:40:41,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 858 transitions. [2019-10-13 21:40:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-13 21:40:41,722 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:41,723 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:40:41,723 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:41,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:41,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1060658908, now seen corresponding path program 1 times [2019-10-13 21:40:41,724 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:41,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618035753] [2019-10-13 21:40:41,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:41,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:41,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:41,818 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:41,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618035753] [2019-10-13 21:40:41,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882409728] [2019-10-13 21:40:41,820 INFO L94 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-13 21:40:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:41,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:40:41,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:40:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:40:42,062 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:40:42,151 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:40:42,152 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:40:42,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-13 21:40:42,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581894537] [2019-10-13 21:40:42,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:42,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:42,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:42,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:40:42,157 INFO L87 Difference]: Start difference. First operand 540 states and 858 transitions. Second operand 3 states. [2019-10-13 21:40:42,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:42,591 INFO L93 Difference]: Finished difference Result 1298 states and 2108 transitions. [2019-10-13 21:40:42,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:42,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-10-13 21:40:42,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:42,594 INFO L225 Difference]: With dead ends: 1298 [2019-10-13 21:40:42,594 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:40:42,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 236 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:40:42,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:40:42,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:40:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:40:42,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:40:42,599 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2019-10-13 21:40:42,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:42,600 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:40:42,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:42,600 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:40:42,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:40:42,806 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:40:42,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:40:42,995 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~a16~0 |old(~a16~0)|) [2019-10-13 21:40:42,995 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:40:42,995 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-13 21:40:42,995 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-13 21:40:42,995 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-13 21:40:42,996 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-13 21:40:42,996 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-13 21:40:42,996 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-13 21:40:42,996 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-13 21:40:42,996 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-13 21:40:42,996 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-13 21:40:42,997 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-13 21:40:42,997 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-13 21:40:42,997 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-13 21:40:42,997 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-13 21:40:42,997 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-13 21:40:42,997 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-13 21:40:42,997 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-13 21:40:42,998 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-13 21:40:42,998 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-13 21:40:42,998 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-13 21:40:42,998 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-13 21:40:42,998 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-13 21:40:42,998 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-13 21:40:42,999 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-13 21:40:42,999 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-13 21:40:42,999 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-13 21:40:42,999 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-13 21:40:42,999 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-13 21:40:42,999 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-13 21:40:43,000 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-13 21:40:43,000 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2019-10-13 21:40:43,000 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2019-10-13 21:40:43,000 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-13 21:40:43,000 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-13 21:40:43,000 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-13 21:40:43,001 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-13 21:40:43,001 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-13 21:40:43,001 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-13 21:40:43,001 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-13 21:40:43,001 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-13 21:40:43,001 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-13 21:40:43,001 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-10-13 21:40:43,002 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-13 21:40:43,002 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-13 21:40:43,002 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-13 21:40:43,002 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-10-13 21:40:43,002 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-13 21:40:43,002 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-13 21:40:43,002 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-13 21:40:43,003 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-13 21:40:43,003 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-10-13 21:40:43,003 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-13 21:40:43,003 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a16~0 |old(~a16~0)|))) (and (or .cse0 (not (<= |old(~a16~0)| 4))) (or (not (= 1 |old(~a20~0)|)) (and .cse0 (= ~a20~0 1))) (or (= 13 |old(~a8~0)|) (and .cse0 (not (= ~a8~0 13)))))) [2019-10-13 21:40:43,003 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-13 21:40:43,004 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 521) no Hoare annotation was computed. [2019-10-13 21:40:43,004 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-13 21:40:43,004 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-13 21:40:43,004 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-13 21:40:43,004 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-13 21:40:43,004 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-13 21:40:43,004 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-13 21:40:43,032 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-13 21:40:43,032 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-13 21:40:43,032 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-13 21:40:43,032 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-13 21:40:43,033 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-13 21:40:43,033 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-13 21:40:43,033 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-13 21:40:43,033 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-13 21:40:43,033 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-13 21:40:43,033 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-13 21:40:43,034 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-13 21:40:43,034 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-13 21:40:43,034 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-13 21:40:43,034 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:40:43,034 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a16~0 6)) (= ~a20~0 1) (not (= ~a8~0 13))) [2019-10-13 21:40:43,035 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:40:43,035 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:40:43,035 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (not (= 1 |old(~a20~0)|)) (= 13 |old(~a8~0)|) (and (= ~a16~0 |old(~a16~0)|) (= ~a20~0 1) (not (= ~a8~0 13)))) [2019-10-13 21:40:43,035 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2019-10-13 21:40:43,035 INFO L439 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (not (= 1 |old(~a20~0)|)) (= 13 |old(~a8~0)|) (<= ~a16~0 4) (= ~a20~0 1) (not (= ~a8~0 13))) [2019-10-13 21:40:43,035 INFO L443 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2019-10-13 21:40:43,036 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-13 21:40:43,036 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (not (= 1 |old(~a20~0)|)) (= 13 |old(~a8~0)|) (<= ~a16~0 4) (= ~a20~0 1) (not (= ~a8~0 13))) [2019-10-13 21:40:43,036 INFO L443 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2019-10-13 21:40:43,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:40:43 BoogieIcfgContainer [2019-10-13 21:40:43,053 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:40:43,056 INFO L168 Benchmark]: Toolchain (without parser) took 6990.75 ms. Allocated memory was 142.6 MB in the beginning and 311.4 MB in the end (delta: 168.8 MB). Free memory was 105.4 MB in the beginning and 273.9 MB in the end (delta: -168.5 MB). Peak memory consumption was 147.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:43,057 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 142.6 MB. Free memory was 125.9 MB in the beginning and 125.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 21:40:43,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.18 ms. Allocated memory was 142.6 MB in the beginning and 207.6 MB in the end (delta: 65.0 MB). Free memory was 105.2 MB in the beginning and 172.8 MB in the end (delta: -67.6 MB). Peak memory consumption was 35.1 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:43,059 INFO L168 Benchmark]: Boogie Preprocessor took 110.43 ms. Allocated memory is still 207.6 MB. Free memory was 172.8 MB in the beginning and 167.7 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:43,062 INFO L168 Benchmark]: RCFGBuilder took 1998.58 ms. Allocated memory was 207.6 MB in the beginning and 244.8 MB in the end (delta: 37.2 MB). Free memory was 167.7 MB in the beginning and 187.0 MB in the end (delta: -19.3 MB). Peak memory consumption was 101.6 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:43,065 INFO L168 Benchmark]: TraceAbstraction took 4128.62 ms. Allocated memory was 244.8 MB in the beginning and 311.4 MB in the end (delta: 66.6 MB). Free memory was 187.0 MB in the beginning and 273.9 MB in the end (delta: -86.9 MB). Peak memory consumption was 126.7 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:43,071 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 142.6 MB. Free memory was 125.9 MB in the beginning and 125.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 748.18 ms. Allocated memory was 142.6 MB in the beginning and 207.6 MB in the end (delta: 65.0 MB). Free memory was 105.2 MB in the beginning and 172.8 MB in the end (delta: -67.6 MB). Peak memory consumption was 35.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.43 ms. Allocated memory is still 207.6 MB. Free memory was 172.8 MB in the beginning and 167.7 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1998.58 ms. Allocated memory was 207.6 MB in the beginning and 244.8 MB in the end (delta: 37.2 MB). Free memory was 167.7 MB in the beginning and 187.0 MB in the end (delta: -19.3 MB). Peak memory consumption was 101.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4128.62 ms. Allocated memory was 244.8 MB in the beginning and 311.4 MB in the end (delta: 66.6 MB). Free memory was 187.0 MB in the beginning and 273.9 MB in the end (delta: -86.9 MB). Peak memory consumption was 126.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 521]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((6 == \old(a16) || !(1 == \old(a20))) || 13 == \old(a8)) || a16 <= 4) || a20 == 1) || !(a8 == 13) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 86 locations, 1 error locations. Result: SAFE, OverallTime: 4.0s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 240 SDtfs, 327 SDslu, 68 SDs, 0 SdLazy, 1048 SolverSat, 308 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 245 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=540occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 30 PreInvPairs, 50 NumberOfFragments, 113 HoareAnnotationTreeSize, 30 FomulaSimplifications, 312 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 193 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 490 NumberOfCodeBlocks, 490 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 603 ConstructedInterpolants, 0 QuantifiedInterpolants, 149509 SizeOfPredicates, 2 NumberOfNonLiveVariables, 446 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 154/156 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...