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_label20.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:40:15,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:40:15,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:40:15,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:40:15,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:40:15,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:40:15,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:40:15,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:40:15,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:40:15,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:40:15,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:40:15,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:40:15,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:40:15,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:40:15,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:40:15,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:40:15,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:40:15,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:40:15,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:40:15,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:40:15,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:40:15,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:40:15,916 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:40:15,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:40:15,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:40:15,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:40:15,919 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:40:15,920 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:40:15,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:40:15,921 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:40:15,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:40:15,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:40:15,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:40:15,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:40:15,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:40:15,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:40:15,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:40:15,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:40:15,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:40:15,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:40:15,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:40:15,929 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:15,948 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:40:15,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:40:15,949 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:40:15,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:40:15,950 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:40:15,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:40:15,950 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:40:15,950 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:40:15,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:40:15,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:40:15,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:40:15,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:40:15,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:40:15,952 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:40:15,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:40:15,952 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:40:15,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:40:15,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:40:15,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:40:15,953 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:40:15,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:40:15,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:40:15,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:40:15,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:40:15,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:40:15,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:40:15,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:40:15,955 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:40:15,955 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:16,260 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:40:16,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:40:16,278 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:40:16,280 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:40:16,280 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:40:16,281 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label20.c [2019-10-13 21:40:16,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5e6d32d7/85391c7e536844f4bdb70c67f4011e75/FLAGa37e3e47d [2019-10-13 21:40:16,930 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:40:16,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label20.c [2019-10-13 21:40:16,942 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5e6d32d7/85391c7e536844f4bdb70c67f4011e75/FLAGa37e3e47d [2019-10-13 21:40:17,198 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5e6d32d7/85391c7e536844f4bdb70c67f4011e75 [2019-10-13 21:40:17,210 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:40:17,213 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:40:17,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:40:17,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:40:17,220 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:40:17,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:40:17" (1/1) ... [2019-10-13 21:40:17,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d281660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:17, skipping insertion in model container [2019-10-13 21:40:17,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:40:17" (1/1) ... [2019-10-13 21:40:17,232 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:40:17,285 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:40:17,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:40:17,850 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:40:18,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:40:18,040 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:40:18,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:18 WrapperNode [2019-10-13 21:40:18,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:40:18,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:40:18,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:40:18,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:40:18,057 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:18" (1/1) ... [2019-10-13 21:40:18,057 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:18" (1/1) ... [2019-10-13 21:40:18,088 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:18" (1/1) ... [2019-10-13 21:40:18,088 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:18" (1/1) ... [2019-10-13 21:40:18,131 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:18" (1/1) ... [2019-10-13 21:40:18,150 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:18" (1/1) ... [2019-10-13 21:40:18,154 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:18" (1/1) ... [2019-10-13 21:40:18,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:40:18,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:40:18,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:40:18,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:40:18,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:18" (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:18,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:40:18,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:40:18,215 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 21:40:18,215 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:40:18,215 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 21:40:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:40:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:40:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:40:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:40:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:40:18,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:40:20,213 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:40:20,214 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:40:20,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:40:20 BoogieIcfgContainer [2019-10-13 21:40:20,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:40:20,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:40:20,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:40:20,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:40:20,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:40:17" (1/3) ... [2019-10-13 21:40:20,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247aa501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:40:20, skipping insertion in model container [2019-10-13 21:40:20,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:18" (2/3) ... [2019-10-13 21:40:20,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247aa501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:40:20, skipping insertion in model container [2019-10-13 21:40:20,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:40:20" (3/3) ... [2019-10-13 21:40:20,245 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label20.c [2019-10-13 21:40:20,257 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:40:20,266 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:40:20,278 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:40:20,309 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:40:20,309 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:40:20,310 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:40:20,310 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:40:20,310 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:40:20,310 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:40:20,310 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:40:20,311 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:40:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-10-13 21:40:20,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 21:40:20,341 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:20,342 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:20,344 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:20,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:20,349 INFO L82 PathProgramCache]: Analyzing trace with hash 826139497, now seen corresponding path program 1 times [2019-10-13 21:40:20,356 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:20,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378572078] [2019-10-13 21:40:20,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:20,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:20,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:20,800 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:20,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378572078] [2019-10-13 21:40:20,801 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:20,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:40:20,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706536709] [2019-10-13 21:40:20,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:20,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:20,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:20,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:40:20,825 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-10-13 21:40:21,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:21,385 INFO L93 Difference]: Finished difference Result 246 states and 454 transitions. [2019-10-13 21:40:21,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:21,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-13 21:40:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:21,401 INFO L225 Difference]: With dead ends: 246 [2019-10-13 21:40:21,402 INFO L226 Difference]: Without dead ends: 157 [2019-10-13 21:40:21,406 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:21,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-13 21:40:21,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-10-13 21:40:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-13 21:40:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 279 transitions. [2019-10-13 21:40:21,493 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 279 transitions. Word has length 77 [2019-10-13 21:40:21,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:21,494 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 279 transitions. [2019-10-13 21:40:21,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:21,495 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2019-10-13 21:40:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-13 21:40:21,500 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:21,500 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:21,500 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:21,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:21,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1196347136, now seen corresponding path program 1 times [2019-10-13 21:40:21,501 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:21,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779034922] [2019-10-13 21:40:21,502 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:21,502 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:21,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:21,673 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:21,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779034922] [2019-10-13 21:40:21,674 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:21,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:40:21,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817557133] [2019-10-13 21:40:21,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:40:21,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:21,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:40:21,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:40:21,679 INFO L87 Difference]: Start difference. First operand 157 states and 279 transitions. Second operand 6 states. [2019-10-13 21:40:22,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:22,315 INFO L93 Difference]: Finished difference Result 402 states and 725 transitions. [2019-10-13 21:40:22,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:40:22,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-10-13 21:40:22,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:22,321 INFO L225 Difference]: With dead ends: 402 [2019-10-13 21:40:22,321 INFO L226 Difference]: Without dead ends: 250 [2019-10-13 21:40:22,323 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:22,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-13 21:40:22,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2019-10-13 21:40:22,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-10-13 21:40:22,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 407 transitions. [2019-10-13 21:40:22,375 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 407 transitions. Word has length 87 [2019-10-13 21:40:22,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:22,375 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 407 transitions. [2019-10-13 21:40:22,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:40:22,375 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 407 transitions. [2019-10-13 21:40:22,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 21:40:22,384 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:22,384 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:22,385 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:22,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:22,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2129368740, now seen corresponding path program 1 times [2019-10-13 21:40:22,386 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:22,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086779010] [2019-10-13 21:40:22,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:22,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:22,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:22,570 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:22,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086779010] [2019-10-13 21:40:22,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:22,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:40:22,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194944657] [2019-10-13 21:40:22,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:22,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:22,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:22,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:40:22,574 INFO L87 Difference]: Start difference. First operand 238 states and 407 transitions. Second operand 3 states. [2019-10-13 21:40:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:23,011 INFO L93 Difference]: Finished difference Result 700 states and 1242 transitions. [2019-10-13 21:40:23,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:23,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-10-13 21:40:23,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:23,019 INFO L225 Difference]: With dead ends: 700 [2019-10-13 21:40:23,019 INFO L226 Difference]: Without dead ends: 467 [2019-10-13 21:40:23,021 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:40:23,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-10-13 21:40:23,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2019-10-13 21:40:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-10-13 21:40:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 737 transitions. [2019-10-13 21:40:23,063 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 737 transitions. Word has length 88 [2019-10-13 21:40:23,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:23,064 INFO L462 AbstractCegarLoop]: Abstraction has 467 states and 737 transitions. [2019-10-13 21:40:23,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:23,065 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 737 transitions. [2019-10-13 21:40:23,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:40:23,067 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:23,067 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:40:23,068 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:23,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:23,068 INFO L82 PathProgramCache]: Analyzing trace with hash 579114448, now seen corresponding path program 1 times [2019-10-13 21:40:23,068 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:23,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341764994] [2019-10-13 21:40:23,069 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:23,069 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:23,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:23,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341764994] [2019-10-13 21:40:23,155 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:23,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:40:23,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301223830] [2019-10-13 21:40:23,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:23,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:23,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:23,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:40:23,157 INFO L87 Difference]: Start difference. First operand 467 states and 737 transitions. Second operand 3 states. [2019-10-13 21:40:23,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:23,589 INFO L93 Difference]: Finished difference Result 1235 states and 2049 transitions. [2019-10-13 21:40:23,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:23,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-13 21:40:23,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:23,596 INFO L225 Difference]: With dead ends: 1235 [2019-10-13 21:40:23,597 INFO L226 Difference]: Without dead ends: 773 [2019-10-13 21:40:23,600 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:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-10-13 21:40:23,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 696. [2019-10-13 21:40:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-10-13 21:40:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1128 transitions. [2019-10-13 21:40:23,656 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1128 transitions. Word has length 94 [2019-10-13 21:40:23,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:23,657 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 1128 transitions. [2019-10-13 21:40:23,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:23,657 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1128 transitions. [2019-10-13 21:40:23,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 21:40:23,661 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:23,661 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:40:23,662 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:23,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:23,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1131111488, now seen corresponding path program 1 times [2019-10-13 21:40:23,662 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:23,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710625378] [2019-10-13 21:40:23,663 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:23,663 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:23,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:23,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710625378] [2019-10-13 21:40:23,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:23,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:40:23,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628384383] [2019-10-13 21:40:23,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:40:23,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:23,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:40:23,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:40:23,833 INFO L87 Difference]: Start difference. First operand 696 states and 1128 transitions. Second operand 6 states. [2019-10-13 21:40:24,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:24,402 INFO L93 Difference]: Finished difference Result 1437 states and 2458 transitions. [2019-10-13 21:40:24,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:40:24,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-10-13 21:40:24,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:24,409 INFO L225 Difference]: With dead ends: 1437 [2019-10-13 21:40:24,409 INFO L226 Difference]: Without dead ends: 746 [2019-10-13 21:40:24,412 INFO L600 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-13 21:40:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2019-10-13 21:40:24,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 645. [2019-10-13 21:40:24,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-10-13 21:40:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 930 transitions. [2019-10-13 21:40:24,448 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 930 transitions. Word has length 102 [2019-10-13 21:40:24,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:24,448 INFO L462 AbstractCegarLoop]: Abstraction has 645 states and 930 transitions. [2019-10-13 21:40:24,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:40:24,448 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 930 transitions. [2019-10-13 21:40:24,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 21:40:24,451 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:24,452 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,452 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:24,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:24,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1833679291, now seen corresponding path program 1 times [2019-10-13 21:40:24,453 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:24,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339640492] [2019-10-13 21:40:24,453 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:24,454 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:24,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:24,536 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 34 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:24,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339640492] [2019-10-13 21:40:24,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776179640] [2019-10-13 21:40:24,537 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:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:24,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 21:40:24,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:40:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-13 21:40:24,769 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:40:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-13 21:40:24,919 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:40:24,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 9 [2019-10-13 21:40:24,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096189283] [2019-10-13 21:40:24,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:40:24,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:24,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:40:24,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:40:24,921 INFO L87 Difference]: Start difference. First operand 645 states and 930 transitions. Second operand 4 states. [2019-10-13 21:40:25,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:25,393 INFO L93 Difference]: Finished difference Result 1905 states and 2790 transitions. [2019-10-13 21:40:25,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:40:25,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-13 21:40:25,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:25,401 INFO L225 Difference]: With dead ends: 1905 [2019-10-13 21:40:25,402 INFO L226 Difference]: Without dead ends: 1265 [2019-10-13 21:40:25,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 215 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:40:25,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-10-13 21:40:25,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1265. [2019-10-13 21:40:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2019-10-13 21:40:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1814 transitions. [2019-10-13 21:40:25,455 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1814 transitions. Word has length 111 [2019-10-13 21:40:25,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:25,456 INFO L462 AbstractCegarLoop]: Abstraction has 1265 states and 1814 transitions. [2019-10-13 21:40:25,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:40:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1814 transitions. [2019-10-13 21:40:25,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:40:25,460 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:25,461 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:40:25,666 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:25,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:25,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1928830253, now seen corresponding path program 1 times [2019-10-13 21:40:25,667 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:25,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557520813] [2019-10-13 21:40:25,667 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:25,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:25,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:25,768 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:25,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557520813] [2019-10-13 21:40:25,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26905179] [2019-10-13 21:40:25,769 INFO L94 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-13 21:40:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:25,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:40:25,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:40:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:40:25,955 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:40:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:40:26,017 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:40:26,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-13 21:40:26,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096931695] [2019-10-13 21:40:26,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:26,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:26,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:26,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:40:26,020 INFO L87 Difference]: Start difference. First operand 1265 states and 1814 transitions. Second operand 3 states. [2019-10-13 21:40:26,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:26,427 INFO L93 Difference]: Finished difference Result 1719 states and 2530 transitions. [2019-10-13 21:40:26,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:26,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-10-13 21:40:26,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:26,442 INFO L225 Difference]: With dead ends: 1719 [2019-10-13 21:40:26,442 INFO L226 Difference]: Without dead ends: 1717 [2019-10-13 21:40:26,444 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 224 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:26,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2019-10-13 21:40:26,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1567. [2019-10-13 21:40:26,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2019-10-13 21:40:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2285 transitions. [2019-10-13 21:40:26,523 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2285 transitions. Word has length 113 [2019-10-13 21:40:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:26,525 INFO L462 AbstractCegarLoop]: Abstraction has 1567 states and 2285 transitions. [2019-10-13 21:40:26,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2285 transitions. [2019-10-13 21:40:26,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 21:40:26,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:26,531 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, 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] [2019-10-13 21:40:26,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:40:26,735 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:26,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:26,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1955114107, now seen corresponding path program 1 times [2019-10-13 21:40:26,735 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:26,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371800288] [2019-10-13 21:40:26,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:26,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:26,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 59 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:26,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371800288] [2019-10-13 21:40:26,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75991663] [2019-10-13 21:40:26,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:40:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:26,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:40:26,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:40:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 59 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:26,950 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:40:27,025 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 59 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:27,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [66393089] [2019-10-13 21:40:27,060 INFO L162 IcfgInterpreter]: Started Sifa with 81 locations of interest [2019-10-13 21:40:27,060 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:40:27,067 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:40:27,076 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:40:27,077 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:40:27,382 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 96 for LOIs [2019-10-13 21:40:27,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:40:27,826 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:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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:102) 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-10-13 21:40:27,832 INFO L168 Benchmark]: Toolchain (without parser) took 10619.78 ms. Allocated memory was 138.4 MB in the beginning and 382.2 MB in the end (delta: 243.8 MB). Free memory was 101.7 MB in the beginning and 236.0 MB in the end (delta: -134.4 MB). Peak memory consumption was 109.4 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:27,833 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.5 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:27,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 828.48 ms. Allocated memory was 138.4 MB in the beginning and 203.9 MB in the end (delta: 65.5 MB). Free memory was 101.4 MB in the beginning and 169.7 MB in the end (delta: -68.2 MB). Peak memory consumption was 35.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:27,835 INFO L168 Benchmark]: Boogie Preprocessor took 118.30 ms. Allocated memory is still 203.9 MB. Free memory was 169.7 MB in the beginning and 164.8 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:27,837 INFO L168 Benchmark]: RCFGBuilder took 2054.25 ms. Allocated memory was 203.9 MB in the beginning and 251.1 MB in the end (delta: 47.2 MB). Free memory was 164.8 MB in the beginning and 210.0 MB in the end (delta: -45.2 MB). Peak memory consumption was 118.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:27,838 INFO L168 Benchmark]: TraceAbstraction took 7611.97 ms. Allocated memory was 251.1 MB in the beginning and 382.2 MB in the end (delta: 131.1 MB). Free memory was 208.2 MB in the beginning and 236.0 MB in the end (delta: -27.9 MB). Peak memory consumption was 103.2 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:27,842 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.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 828.48 ms. Allocated memory was 138.4 MB in the beginning and 203.9 MB in the end (delta: 65.5 MB). Free memory was 101.4 MB in the beginning and 169.7 MB in the end (delta: -68.2 MB). Peak memory consumption was 35.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.30 ms. Allocated memory is still 203.9 MB. Free memory was 169.7 MB in the beginning and 164.8 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2054.25 ms. Allocated memory was 203.9 MB in the beginning and 251.1 MB in the end (delta: 47.2 MB). Free memory was 164.8 MB in the beginning and 210.0 MB in the end (delta: -45.2 MB). Peak memory consumption was 118.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7611.97 ms. Allocated memory was 251.1 MB in the beginning and 382.2 MB in the end (delta: 131.1 MB). Free memory was 208.2 MB in the beginning and 236.0 MB in the end (delta: -27.9 MB). Peak memory consumption was 103.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true;: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...