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/Problem03_label29.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:41:44,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:41:44,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:41:44,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:41:44,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:41:44,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:41:44,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:41:44,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:41:44,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:41:44,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:41:44,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:41:44,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:41:44,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:41:44,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:41:44,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:41:44,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:41:44,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:41:44,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:41:44,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:41:44,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:41:44,938 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:41:44,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:41:44,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:41:44,941 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:41:44,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:41:44,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:41:44,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:41:44,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:41:44,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:41:44,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:41:44,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:41:44,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:41:44,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:41:44,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:41:44,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:41:44,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:41:44,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:41:44,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:41:44,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:41:44,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:41:44,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:41:44,953 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:41:44,967 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:41:44,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:41:44,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:41:44,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:41:44,969 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:41:44,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:41:44,969 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:41:44,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:41:44,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:41:44,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:41:44,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:41:44,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:41:44,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:41:44,972 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:41:44,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:41:44,972 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:41:44,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:41:44,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:41:44,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:41:44,973 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:41:44,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:41:44,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:41:44,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:41:44,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:41:44,974 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:41:44,974 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:41:44,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:41:44,974 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:41:44,975 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:41:45,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:41:45,295 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:41:45,299 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:41:45,301 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:41:45,301 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:41:45,302 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label29.c [2019-10-13 21:41:45,378 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5929c472b/a35e1a9ec2df4e75bc91e4eff75b9c59/FLAG1a276e82d [2019-10-13 21:41:46,031 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:41:46,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label29.c [2019-10-13 21:41:46,056 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5929c472b/a35e1a9ec2df4e75bc91e4eff75b9c59/FLAG1a276e82d [2019-10-13 21:41:46,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5929c472b/a35e1a9ec2df4e75bc91e4eff75b9c59 [2019-10-13 21:41:46,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:41:46,269 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:41:46,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:41:46,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:41:46,274 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:41:46,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:41:46" (1/1) ... [2019-10-13 21:41:46,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b5e6bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:46, skipping insertion in model container [2019-10-13 21:41:46,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:41:46" (1/1) ... [2019-10-13 21:41:46,287 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:41:46,356 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:41:47,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:41:47,170 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:41:47,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:41:47,485 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:41:47,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:47 WrapperNode [2019-10-13 21:41:47,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:41:47,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:41:47,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:41:47,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:41:47,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:47" (1/1) ... [2019-10-13 21:41:47,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:47" (1/1) ... [2019-10-13 21:41:47,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:47" (1/1) ... [2019-10-13 21:41:47,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:47" (1/1) ... [2019-10-13 21:41:47,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:47" (1/1) ... [2019-10-13 21:41:47,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:47" (1/1) ... [2019-10-13 21:41:47,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:47" (1/1) ... [2019-10-13 21:41:47,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:41:47,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:41:47,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:41:47,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:41:47,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:47" (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:41:47,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:41:47,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:41:47,753 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 21:41:47,753 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:41:47,754 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 21:41:47,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:41:47,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:41:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:41:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:41:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:41:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:41:50,737 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:41:50,737 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:41:50,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:41:50 BoogieIcfgContainer [2019-10-13 21:41:50,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:41:50,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:41:50,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:41:50,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:41:50,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:41:46" (1/3) ... [2019-10-13 21:41:50,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b6a749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:41:50, skipping insertion in model container [2019-10-13 21:41:50,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:47" (2/3) ... [2019-10-13 21:41:50,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b6a749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:41:50, skipping insertion in model container [2019-10-13 21:41:50,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:41:50" (3/3) ... [2019-10-13 21:41:50,758 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label29.c [2019-10-13 21:41:50,771 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:41:50,783 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:41:50,795 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:41:50,830 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:41:50,831 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:41:50,831 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:41:50,831 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:41:50,831 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:41:50,831 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:41:50,831 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:41:50,832 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:41:50,869 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-10-13 21:41:50,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:41:50,882 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:50,883 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:50,885 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:50,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:50,890 INFO L82 PathProgramCache]: Analyzing trace with hash 136472614, now seen corresponding path program 1 times [2019-10-13 21:41:50,899 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:50,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998160264] [2019-10-13 21:41:50,899 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:50,900 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:50,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:51,702 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:41:51,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998160264] [2019-10-13 21:41:51,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:51,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:41:51,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113206907] [2019-10-13 21:41:51,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:41:51,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:51,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:41:51,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:41:51,732 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2019-10-13 21:41:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:52,872 INFO L93 Difference]: Finished difference Result 462 states and 886 transitions. [2019-10-13 21:41:52,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:41:52,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-13 21:41:52,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:52,893 INFO L225 Difference]: With dead ends: 462 [2019-10-13 21:41:52,893 INFO L226 Difference]: Without dead ends: 301 [2019-10-13 21:41:52,898 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:41:52,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-13 21:41:52,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-10-13 21:41:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-13 21:41:52,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 564 transitions. [2019-10-13 21:41:52,977 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 564 transitions. Word has length 149 [2019-10-13 21:41:52,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:52,979 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 564 transitions. [2019-10-13 21:41:52,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:41:52,979 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 564 transitions. [2019-10-13 21:41:52,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 21:41:52,985 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:52,986 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:41:52,986 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:52,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:52,987 INFO L82 PathProgramCache]: Analyzing trace with hash 558842557, now seen corresponding path program 1 times [2019-10-13 21:41:52,987 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:52,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893397497] [2019-10-13 21:41:52,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:52,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:52,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:53,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:53,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893397497] [2019-10-13 21:41:53,176 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:53,177 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:41:53,177 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253969963] [2019-10-13 21:41:53,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:41:53,179 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:53,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:41:53,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:41:53,180 INFO L87 Difference]: Start difference. First operand 301 states and 564 transitions. Second operand 6 states. [2019-10-13 21:41:54,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:54,649 INFO L93 Difference]: Finished difference Result 929 states and 1794 transitions. [2019-10-13 21:41:54,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:41:54,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2019-10-13 21:41:54,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:54,658 INFO L225 Difference]: With dead ends: 929 [2019-10-13 21:41:54,659 INFO L226 Difference]: Without dead ends: 633 [2019-10-13 21:41:54,662 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:41:54,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-13 21:41:54,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 603. [2019-10-13 21:41:54,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-13 21:41:54,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1113 transitions. [2019-10-13 21:41:54,741 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1113 transitions. Word has length 158 [2019-10-13 21:41:54,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:54,741 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1113 transitions. [2019-10-13 21:41:54,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:41:54,741 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1113 transitions. [2019-10-13 21:41:54,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:41:54,754 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:54,755 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:41:54,755 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:54,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:54,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1532429294, now seen corresponding path program 1 times [2019-10-13 21:41:54,756 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:54,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118503076] [2019-10-13 21:41:54,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:54,757 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:54,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:55,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:55,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118503076] [2019-10-13 21:41:55,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:55,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:41:55,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826412744] [2019-10-13 21:41:55,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:41:55,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:55,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:41:55,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:41:55,058 INFO L87 Difference]: Start difference. First operand 603 states and 1113 transitions. Second operand 3 states. [2019-10-13 21:41:56,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:56,050 INFO L93 Difference]: Finished difference Result 1795 states and 3387 transitions. [2019-10-13 21:41:56,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:41:56,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-13 21:41:56,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:56,059 INFO L225 Difference]: With dead ends: 1795 [2019-10-13 21:41:56,059 INFO L226 Difference]: Without dead ends: 1197 [2019-10-13 21:41:56,062 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:41:56,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-10-13 21:41:56,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2019-10-13 21:41:56,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-10-13 21:41:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 2199 transitions. [2019-10-13 21:41:56,113 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 2199 transitions. Word has length 161 [2019-10-13 21:41:56,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:56,113 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 2199 transitions. [2019-10-13 21:41:56,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:41:56,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 2199 transitions. [2019-10-13 21:41:56,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-13 21:41:56,119 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:56,119 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:41:56,119 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:56,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:56,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1521645618, now seen corresponding path program 1 times [2019-10-13 21:41:56,120 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:56,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028462533] [2019-10-13 21:41:56,121 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:56,121 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:56,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:41:56,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028462533] [2019-10-13 21:41:56,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750740130] [2019-10-13 21:41:56,273 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:41:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:56,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:41:56,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:41:56,771 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 21:41:56,771 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:41:56,903 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:41:56,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:41:56,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-10-13 21:41:56,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163351764] [2019-10-13 21:41:56,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:41:56,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:56,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:41:56,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:41:56,906 INFO L87 Difference]: Start difference. First operand 1197 states and 2199 transitions. Second operand 5 states. [2019-10-13 21:41:58,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:58,313 INFO L93 Difference]: Finished difference Result 3665 states and 7306 transitions. [2019-10-13 21:41:58,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:41:58,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2019-10-13 21:41:58,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:58,333 INFO L225 Difference]: With dead ends: 3665 [2019-10-13 21:41:58,334 INFO L226 Difference]: Without dead ends: 2473 [2019-10-13 21:41:58,338 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 337 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:41:58,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2019-10-13 21:41:58,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2419. [2019-10-13 21:41:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2419 states. [2019-10-13 21:41:58,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 4339 transitions. [2019-10-13 21:41:58,436 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 4339 transitions. Word has length 171 [2019-10-13 21:41:58,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:58,437 INFO L462 AbstractCegarLoop]: Abstraction has 2419 states and 4339 transitions. [2019-10-13 21:41:58,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:41:58,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 4339 transitions. [2019-10-13 21:41:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-13 21:41:58,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:58,448 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:41:58,653 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:41:58,653 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:58,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:58,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1881797470, now seen corresponding path program 1 times [2019-10-13 21:41:58,655 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:58,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878643797] [2019-10-13 21:41:58,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:58,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:58,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:58,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878643797] [2019-10-13 21:41:58,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46832576] [2019-10-13 21:41:58,787 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:41:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:59,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-13 21:41:59,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:41:59,132 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:41:59,133 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:41:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:41:59,384 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:41:59,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-13 21:41:59,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851913836] [2019-10-13 21:41:59,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:41:59,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:59,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:41:59,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:41:59,388 INFO L87 Difference]: Start difference. First operand 2419 states and 4339 transitions. Second operand 5 states. [2019-10-13 21:41:59,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:59,912 INFO L93 Difference]: Finished difference Result 7257 states and 13232 transitions. [2019-10-13 21:41:59,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:41:59,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-10-13 21:41:59,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:59,955 INFO L225 Difference]: With dead ends: 7257 [2019-10-13 21:41:59,955 INFO L226 Difference]: Without dead ends: 4843 [2019-10-13 21:41:59,965 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 350 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:41:59,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4843 states. [2019-10-13 21:42:00,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4843 to 4835. [2019-10-13 21:42:00,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4835 states. [2019-10-13 21:42:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4835 states to 4835 states and 8834 transitions. [2019-10-13 21:42:00,190 INFO L78 Accepts]: Start accepts. Automaton has 4835 states and 8834 transitions. Word has length 179 [2019-10-13 21:42:00,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:00,191 INFO L462 AbstractCegarLoop]: Abstraction has 4835 states and 8834 transitions. [2019-10-13 21:42:00,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:42:00,191 INFO L276 IsEmpty]: Start isEmpty. Operand 4835 states and 8834 transitions. [2019-10-13 21:42:00,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-13 21:42:00,217 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:00,218 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:42:00,423 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:42:00,424 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:00,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:00,425 INFO L82 PathProgramCache]: Analyzing trace with hash 2106578126, now seen corresponding path program 1 times [2019-10-13 21:42:00,425 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:00,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897236243] [2019-10-13 21:42:00,426 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:00,426 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:00,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:42:00,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897236243] [2019-10-13 21:42:00,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198823303] [2019-10-13 21:42:00,572 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:42:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:00,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:42:00,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:42:00,851 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-13 21:42:00,852 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:42:01,022 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-13 21:42:01,022 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:42:01,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-13 21:42:01,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400990548] [2019-10-13 21:42:01,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:42:01,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:01,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:42:01,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:42:01,034 INFO L87 Difference]: Start difference. First operand 4835 states and 8834 transitions. Second operand 3 states. [2019-10-13 21:42:02,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:02,005 INFO L93 Difference]: Finished difference Result 14282 states and 26830 transitions. [2019-10-13 21:42:02,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:42:02,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-10-13 21:42:02,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:02,082 INFO L225 Difference]: With dead ends: 14282 [2019-10-13 21:42:02,083 INFO L226 Difference]: Without dead ends: 9452 [2019-10-13 21:42:02,106 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 372 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:42:02,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9452 states. [2019-10-13 21:42:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9452 to 9452. [2019-10-13 21:42:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9452 states. [2019-10-13 21:42:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9452 states to 9452 states and 17601 transitions. [2019-10-13 21:42:02,508 INFO L78 Accepts]: Start accepts. Automaton has 9452 states and 17601 transitions. Word has length 187 [2019-10-13 21:42:02,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:02,510 INFO L462 AbstractCegarLoop]: Abstraction has 9452 states and 17601 transitions. [2019-10-13 21:42:02,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:42:02,510 INFO L276 IsEmpty]: Start isEmpty. Operand 9452 states and 17601 transitions. [2019-10-13 21:42:02,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-13 21:42:02,546 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:02,546 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:42:02,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:42:02,752 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:02,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:02,753 INFO L82 PathProgramCache]: Analyzing trace with hash 267570982, now seen corresponding path program 1 times [2019-10-13 21:42:02,754 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:02,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631986370] [2019-10-13 21:42:02,754 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:02,754 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:02,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 51 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 21:42:03,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631986370] [2019-10-13 21:42:03,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482895569] [2019-10-13 21:42:03,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:42:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:03,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:42:03,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:42:03,407 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 21:42:03,408 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:42:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 51 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 21:42:03,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1655074538] [2019-10-13 21:42:03,558 INFO L162 IcfgInterpreter]: Started Sifa with 153 locations of interest [2019-10-13 21:42:03,559 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:42:03,566 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:42:03,576 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:42:03,576 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:42:04,530 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 210 for LOIs [2019-10-13 21:42:04,648 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 210 [2019-10-13 21:42:04,888 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 298 [2019-10-13 21:42:05,133 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2019-10-13 21:42:05,421 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 310 [2019-10-13 21:42:05,754 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 278 [2019-10-13 21:42:06,200 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:42:06,201 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.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:42:06,207 INFO L168 Benchmark]: Toolchain (without parser) took 19937.77 ms. Allocated memory was 146.3 MB in the beginning and 700.4 MB in the end (delta: 554.2 MB). Free memory was 97.5 MB in the beginning and 548.6 MB in the end (delta: -451.1 MB). Peak memory consumption was 103.1 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:06,208 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 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:42:06,209 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1215.64 ms. Allocated memory was 146.3 MB in the beginning and 207.1 MB in the end (delta: 60.8 MB). Free memory was 97.2 MB in the beginning and 125.0 MB in the end (delta: -27.8 MB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:06,210 INFO L168 Benchmark]: Boogie Preprocessor took 194.94 ms. Allocated memory is still 207.1 MB. Free memory was 125.0 MB in the beginning and 113.4 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:06,211 INFO L168 Benchmark]: RCFGBuilder took 3061.10 ms. Allocated memory was 207.1 MB in the beginning and 303.0 MB in the end (delta: 95.9 MB). Free memory was 113.4 MB in the beginning and 229.9 MB in the end (delta: -116.5 MB). Peak memory consumption was 76.8 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:06,212 INFO L168 Benchmark]: TraceAbstraction took 15461.61 ms. Allocated memory was 303.0 MB in the beginning and 700.4 MB in the end (delta: 397.4 MB). Free memory was 229.9 MB in the beginning and 548.6 MB in the end (delta: -318.7 MB). Peak memory consumption was 78.7 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:06,221 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.26 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1215.64 ms. Allocated memory was 146.3 MB in the beginning and 207.1 MB in the end (delta: 60.8 MB). Free memory was 97.2 MB in the beginning and 125.0 MB in the end (delta: -27.8 MB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 194.94 ms. Allocated memory is still 207.1 MB. Free memory was 125.0 MB in the beginning and 113.4 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3061.10 ms. Allocated memory was 207.1 MB in the beginning and 303.0 MB in the end (delta: 95.9 MB). Free memory was 113.4 MB in the beginning and 229.9 MB in the end (delta: -116.5 MB). Peak memory consumption was 76.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15461.61 ms. Allocated memory was 303.0 MB in the beginning and 700.4 MB in the end (delta: 397.4 MB). Free memory was 229.9 MB in the beginning and 548.6 MB in the end (delta: -318.7 MB). Peak memory consumption was 78.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true;: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...