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_label30.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:41:44,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:41:44,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:41:44,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:41:44,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:41:44,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:41:44,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:41:44,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:41:44,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:41:44,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:41:44,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:41:44,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:41:44,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:41:44,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:41:44,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:41:44,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:41:44,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:41:44,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:41:44,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:41:44,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:41:44,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:41:44,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:41:44,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:41:44,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:41:44,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:41:44,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:41:44,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:41:44,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:41:44,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:41:44,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:41:44,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:41:44,999 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:41:45,000 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:41:45,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:41:45,002 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:41:45,002 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:41:45,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:41:45,003 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:41:45,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:41:45,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:41:45,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:41:45,006 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:45,019 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:41:45,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:41:45,021 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:41:45,021 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:41:45,021 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:41:45,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:41:45,022 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:41:45,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:41:45,022 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:41:45,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:41:45,023 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:41:45,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:41:45,023 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:41:45,023 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:41:45,023 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:41:45,023 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:41:45,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:41:45,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:41:45,024 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:41:45,024 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:41:45,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:41:45,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:41:45,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:41:45,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:41:45,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:41:45,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:41:45,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:41:45,026 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:41:45,026 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,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:41:45,383 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:41:45,387 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:41:45,389 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:41:45,389 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:41:45,390 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label30.c [2019-10-13 21:41:45,453 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd528d7f0/f9c659565af2433a98744e8e75dd6a34/FLAG3876d67f9 [2019-10-13 21:41:46,082 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:41:46,083 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label30.c [2019-10-13 21:41:46,104 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd528d7f0/f9c659565af2433a98744e8e75dd6a34/FLAG3876d67f9 [2019-10-13 21:41:46,312 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd528d7f0/f9c659565af2433a98744e8e75dd6a34 [2019-10-13 21:41:46,323 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:41:46,324 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:41:46,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:41:46,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:41:46,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:41:46,330 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,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae3ae2b 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,334 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,341 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:41:46,428 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:41:47,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:41:47,225 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:41:47,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:41:47,479 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:41:47,480 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,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:41:47,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:41:47,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:41:47,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:41:47,500 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,501 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,530 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,531 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,617 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,648 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,661 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,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:41:47,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:41:47,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:41:47,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:41:47,672 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,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:41:47,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:41:47,728 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 21:41:47,728 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:41:47,728 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 21:41:47,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:41:47,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:41:47,729 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:41:47,729 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:41:47,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:41:47,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:41:50,841 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:41:50,842 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:41:50,843 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,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:41:50,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:41:50,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:41:50,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:41:50,849 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,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ad5031 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,851 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,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ad5031 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,852 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,854 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label30.c [2019-10-13 21:41:50,867 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:41:50,877 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:41:50,890 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:41:50,920 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:41:50,920 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:41:50,921 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:41:50,921 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:41:50,921 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:41:50,921 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:41:50,921 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:41:50,921 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:41:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-10-13 21:41:50,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:41:50,959 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:50,960 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,962 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:50,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:50,968 INFO L82 PathProgramCache]: Analyzing trace with hash 136471846, now seen corresponding path program 1 times [2019-10-13 21:41:50,978 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:50,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336238181] [2019-10-13 21:41:50,979 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:50,979 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:50,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:51,644 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,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336238181] [2019-10-13 21:41:51,646 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:51,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:41:51,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255411611] [2019-10-13 21:41:51,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:41:51,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:51,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:41:51,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:41:51,671 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2019-10-13 21:41:52,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:52,850 INFO L93 Difference]: Finished difference Result 462 states and 886 transitions. [2019-10-13 21:41:52,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:41:52,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-13 21:41:52,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:52,871 INFO L225 Difference]: With dead ends: 462 [2019-10-13 21:41:52,871 INFO L226 Difference]: Without dead ends: 301 [2019-10-13 21:41:52,876 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,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-13 21:41:52,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-10-13 21:41:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-13 21:41:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 564 transitions. [2019-10-13 21:41:52,968 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 564 transitions. Word has length 149 [2019-10-13 21:41:52,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:52,970 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 564 transitions. [2019-10-13 21:41:52,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:41:52,970 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 564 transitions. [2019-10-13 21:41:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 21:41:52,974 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:52,975 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,975 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:52,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:52,975 INFO L82 PathProgramCache]: Analyzing trace with hash 558841789, now seen corresponding path program 1 times [2019-10-13 21:41:52,976 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:52,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100410358] [2019-10-13 21:41:52,976 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:52,976 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:52,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:53,197 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,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100410358] [2019-10-13 21:41:53,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:53,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:41:53,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342759024] [2019-10-13 21:41:53,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:41:53,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:53,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:41:53,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:41:53,203 INFO L87 Difference]: Start difference. First operand 301 states and 564 transitions. Second operand 6 states. [2019-10-13 21:41:54,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:54,719 INFO L93 Difference]: Finished difference Result 929 states and 1794 transitions. [2019-10-13 21:41:54,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:41:54,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2019-10-13 21:41:54,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:54,728 INFO L225 Difference]: With dead ends: 929 [2019-10-13 21:41:54,728 INFO L226 Difference]: Without dead ends: 633 [2019-10-13 21:41:54,731 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,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-13 21:41:54,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 603. [2019-10-13 21:41:54,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-13 21:41:54,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1113 transitions. [2019-10-13 21:41:54,789 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1113 transitions. Word has length 158 [2019-10-13 21:41:54,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:54,790 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1113 transitions. [2019-10-13 21:41:54,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:41:54,790 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1113 transitions. [2019-10-13 21:41:54,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:41:54,795 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:54,795 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,795 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:54,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:54,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1532430062, now seen corresponding path program 1 times [2019-10-13 21:41:54,796 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:54,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19159442] [2019-10-13 21:41:54,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:54,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:54,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:55,106 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,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19159442] [2019-10-13 21:41:55,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:55,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:41:55,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096242920] [2019-10-13 21:41:55,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:41:55,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:55,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:41:55,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:41:55,110 INFO L87 Difference]: Start difference. First operand 603 states and 1113 transitions. Second operand 3 states. [2019-10-13 21:41:56,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:56,094 INFO L93 Difference]: Finished difference Result 1793 states and 3375 transitions. [2019-10-13 21:41:56,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:41:56,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-13 21:41:56,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:56,107 INFO L225 Difference]: With dead ends: 1793 [2019-10-13 21:41:56,107 INFO L226 Difference]: Without dead ends: 1195 [2019-10-13 21:41:56,110 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,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-10-13 21:41:56,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1195. [2019-10-13 21:41:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1195 states. [2019-10-13 21:41:56,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 2084 transitions. [2019-10-13 21:41:56,168 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 2084 transitions. Word has length 161 [2019-10-13 21:41:56,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:56,169 INFO L462 AbstractCegarLoop]: Abstraction has 1195 states and 2084 transitions. [2019-10-13 21:41:56,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:41:56,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2084 transitions. [2019-10-13 21:41:56,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-13 21:41:56,177 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:56,177 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, 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] [2019-10-13 21:41:56,178 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:56,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:56,178 INFO L82 PathProgramCache]: Analyzing trace with hash -627082077, now seen corresponding path program 1 times [2019-10-13 21:41:56,178 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:56,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897214840] [2019-10-13 21:41:56,179 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:56,179 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:56,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:56,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897214840] [2019-10-13 21:41:56,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:56,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:41:56,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094926677] [2019-10-13 21:41:56,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:41:56,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:56,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:41:56,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:41:56,453 INFO L87 Difference]: Start difference. First operand 1195 states and 2084 transitions. Second operand 3 states. [2019-10-13 21:41:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:57,466 INFO L93 Difference]: Finished difference Result 3569 states and 6416 transitions. [2019-10-13 21:41:57,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:41:57,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-10-13 21:41:57,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:57,485 INFO L225 Difference]: With dead ends: 3569 [2019-10-13 21:41:57,486 INFO L226 Difference]: Without dead ends: 2379 [2019-10-13 21:41:57,490 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:57,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2019-10-13 21:41:57,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2379. [2019-10-13 21:41:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2379 states. [2019-10-13 21:41:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 4177 transitions. [2019-10-13 21:41:57,582 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 4177 transitions. Word has length 181 [2019-10-13 21:41:57,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:57,583 INFO L462 AbstractCegarLoop]: Abstraction has 2379 states and 4177 transitions. [2019-10-13 21:41:57,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:41:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 4177 transitions. [2019-10-13 21:41:57,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-13 21:41:57,593 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:57,593 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:41:57,594 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:57,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:57,594 INFO L82 PathProgramCache]: Analyzing trace with hash 938383816, now seen corresponding path program 1 times [2019-10-13 21:41:57,594 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:57,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969665072] [2019-10-13 21:41:57,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:57,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:57,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:57,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969665072] [2019-10-13 21:41:57,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:57,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:41:57,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359142083] [2019-10-13 21:41:57,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:41:57,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:57,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:41:57,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:41:57,879 INFO L87 Difference]: Start difference. First operand 2379 states and 4177 transitions. Second operand 6 states. [2019-10-13 21:41:59,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:59,262 INFO L93 Difference]: Finished difference Result 6011 states and 11153 transitions. [2019-10-13 21:41:59,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:41:59,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2019-10-13 21:41:59,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:59,295 INFO L225 Difference]: With dead ends: 6011 [2019-10-13 21:41:59,295 INFO L226 Difference]: Without dead ends: 3637 [2019-10-13 21:41:59,301 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:41:59,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2019-10-13 21:41:59,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3607. [2019-10-13 21:41:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3607 states. [2019-10-13 21:41:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3607 states to 3607 states and 6391 transitions. [2019-10-13 21:41:59,442 INFO L78 Accepts]: Start accepts. Automaton has 3607 states and 6391 transitions. Word has length 207 [2019-10-13 21:41:59,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:59,442 INFO L462 AbstractCegarLoop]: Abstraction has 3607 states and 6391 transitions. [2019-10-13 21:41:59,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:41:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3607 states and 6391 transitions. [2019-10-13 21:41:59,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-13 21:41:59,456 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:59,456 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 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] [2019-10-13 21:41:59,456 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:59,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:59,457 INFO L82 PathProgramCache]: Analyzing trace with hash -853528908, now seen corresponding path program 1 times [2019-10-13 21:41:59,457 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:59,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119906163] [2019-10-13 21:41:59,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:59,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:59,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 74 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:59,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119906163] [2019-10-13 21:41:59,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509377356] [2019-10-13 21:41:59,789 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:42:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:00,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 21:42:00,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:42:00,301 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 21:42:00,301 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:42:00,507 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 64 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:42:00,508 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:42:00,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-13 21:42:00,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004902424] [2019-10-13 21:42:00,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:42:00,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:00,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:42:00,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:42:00,513 INFO L87 Difference]: Start difference. First operand 3607 states and 6391 transitions. Second operand 5 states. [2019-10-13 21:42:01,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:01,938 INFO L93 Difference]: Finished difference Result 9793 states and 18332 transitions. [2019-10-13 21:42:01,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:42:01,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2019-10-13 21:42:01,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:01,989 INFO L225 Difference]: With dead ends: 9793 [2019-10-13 21:42:01,989 INFO L226 Difference]: Without dead ends: 6191 [2019-10-13 21:42:02,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:42:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6191 states. [2019-10-13 21:42:02,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6191 to 6121. [2019-10-13 21:42:02,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6121 states. [2019-10-13 21:42:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 10956 transitions. [2019-10-13 21:42:02,412 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 10956 transitions. Word has length 219 [2019-10-13 21:42:02,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:02,412 INFO L462 AbstractCegarLoop]: Abstraction has 6121 states and 10956 transitions. [2019-10-13 21:42:02,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:42:02,412 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 10956 transitions. [2019-10-13 21:42:02,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-13 21:42:02,450 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:02,450 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:42:02,657 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:42:02,657 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:02,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:02,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1798011981, now seen corresponding path program 1 times [2019-10-13 21:42:02,659 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:02,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992462611] [2019-10-13 21:42:02,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:02,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:02,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 102 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:42:02,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992462611] [2019-10-13 21:42:02,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350228261] [2019-10-13 21:42:02,909 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:42:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:03,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:42:03,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:42:03,278 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-13 21:42:03,278 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:42:03,384 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 102 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:42:03,384 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:42:03,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-10-13 21:42:03,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715047694] [2019-10-13 21:42:03,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:42:03,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:42:03,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:42:03,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:42:03,386 INFO L87 Difference]: Start difference. First operand 6121 states and 10956 transitions. Second operand 5 states. [2019-10-13 21:42:04,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:42:04,868 INFO L93 Difference]: Finished difference Result 16347 states and 30478 transitions. [2019-10-13 21:42:04,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:42:04,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 257 [2019-10-13 21:42:04,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:42:04,942 INFO L225 Difference]: With dead ends: 16347 [2019-10-13 21:42:04,943 INFO L226 Difference]: Without dead ends: 10231 [2019-10-13 21:42:04,967 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 509 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:42:04,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10231 states. [2019-10-13 21:42:05,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10231 to 10139. [2019-10-13 21:42:05,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10139 states. [2019-10-13 21:42:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10139 states to 10139 states and 17607 transitions. [2019-10-13 21:42:05,361 INFO L78 Accepts]: Start accepts. Automaton has 10139 states and 17607 transitions. Word has length 257 [2019-10-13 21:42:05,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:42:05,362 INFO L462 AbstractCegarLoop]: Abstraction has 10139 states and 17607 transitions. [2019-10-13 21:42:05,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:42:05,362 INFO L276 IsEmpty]: Start isEmpty. Operand 10139 states and 17607 transitions. [2019-10-13 21:42:05,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-10-13 21:42:05,409 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:42:05,410 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:42:05,616 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:42:05,616 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:42:05,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:42:05,617 INFO L82 PathProgramCache]: Analyzing trace with hash 691493853, now seen corresponding path program 1 times [2019-10-13 21:42:05,617 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:42:05,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090715597] [2019-10-13 21:42:05,618 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:05,618 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:42:05,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:42:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 129 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:42:06,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090715597] [2019-10-13 21:42:06,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693895241] [2019-10-13 21:42:06,019 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:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:42:06,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:42:06,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:42:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 129 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:42:06,453 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:42:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 129 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:42:06,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [148111783] [2019-10-13 21:42:06,641 INFO L162 IcfgInterpreter]: Started Sifa with 153 locations of interest [2019-10-13 21:42:06,641 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:42:06,652 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:42:06,666 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:42:06,666 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:42:07,309 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2019-10-13 21:42:07,630 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 208 for LOIs [2019-10-13 21:42:07,922 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 298 [2019-10-13 21:42:08,214 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2019-10-13 21:42:08,582 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 310 [2019-10-13 21:42:09,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:42:09,513 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:09,520 INFO L168 Benchmark]: Toolchain (without parser) took 23195.64 ms. Allocated memory was 147.3 MB in the beginning and 726.1 MB in the end (delta: 578.8 MB). Free memory was 100.1 MB in the beginning and 375.3 MB in the end (delta: -275.2 MB). Peak memory consumption was 303.6 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:09,521 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 147.3 MB. Free memory was 123.7 MB in the beginning and 123.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-13 21:42:09,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1155.11 ms. Allocated memory was 147.3 MB in the beginning and 207.6 MB in the end (delta: 60.3 MB). Free memory was 99.9 MB in the beginning and 133.0 MB in the end (delta: -33.1 MB). Peak memory consumption was 38.5 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:09,523 INFO L168 Benchmark]: Boogie Preprocessor took 189.27 ms. Allocated memory is still 207.6 MB. Free memory was 133.0 MB in the beginning and 121.9 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:09,524 INFO L168 Benchmark]: RCFGBuilder took 3173.10 ms. Allocated memory was 207.6 MB in the beginning and 302.5 MB in the end (delta: 94.9 MB). Free memory was 121.9 MB in the beginning and 227.0 MB in the end (delta: -105.2 MB). Peak memory consumption was 82.1 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:09,525 INFO L168 Benchmark]: TraceAbstraction took 18673.38 ms. Allocated memory was 302.5 MB in the beginning and 726.1 MB in the end (delta: 423.6 MB). Free memory was 227.0 MB in the beginning and 375.3 MB in the end (delta: -148.3 MB). Peak memory consumption was 275.4 MB. Max. memory is 7.1 GB. [2019-10-13 21:42:09,529 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 147.3 MB. Free memory was 123.7 MB in the beginning and 123.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1155.11 ms. Allocated memory was 147.3 MB in the beginning and 207.6 MB in the end (delta: 60.3 MB). Free memory was 99.9 MB in the beginning and 133.0 MB in the end (delta: -33.1 MB). Peak memory consumption was 38.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 189.27 ms. Allocated memory is still 207.6 MB. Free memory was 133.0 MB in the beginning and 121.9 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3173.10 ms. Allocated memory was 207.6 MB in the beginning and 302.5 MB in the end (delta: 94.9 MB). Free memory was 121.9 MB in the beginning and 227.0 MB in the end (delta: -105.2 MB). Peak memory consumption was 82.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18673.38 ms. Allocated memory was 302.5 MB in the beginning and 726.1 MB in the end (delta: 423.6 MB). Free memory was 227.0 MB in the beginning and 375.3 MB in the end (delta: -148.3 MB). Peak memory consumption was 275.4 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...