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/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 22:57:48,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:57:48,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:57:48,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:57:48,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:57:48,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:57:48,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:57:48,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:57:48,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:57:48,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:57:48,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:57:48,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:57:48,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:57:48,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:57:48,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:57:48,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:57:48,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:57:48,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:57:48,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:57:48,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:57:48,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:57:48,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:57:48,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:57:48,817 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:57:48,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:57:48,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:57:48,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:57:48,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:57:48,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:57:48,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:57:48,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:57:48,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:57:48,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:57:48,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:57:48,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:57:48,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:57:48,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:57:48,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:57:48,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:57:48,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:57:48,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:57:48,829 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 22:57:48,849 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:57:48,849 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:57:48,852 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:57:48,852 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:57:48,852 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:57:48,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:57:48,853 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:57:48,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:57:48,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:57:48,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:57:48,854 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:57:48,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:57:48,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:57:48,855 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:57:48,855 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:57:48,856 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:57:48,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:57:48,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:57:48,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:57:48,857 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:57:48,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:57:48,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:57:48,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:57:48,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:57:48,858 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:57:48,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:57:48,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:57:48,858 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:57:48,859 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 22:57:49,121 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:57:49,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:57:49,138 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:57:49,140 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:57:49,140 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:57:49,141 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-10-13 22:57:49,204 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead3cc818/ad2afaa16f404a1c8d3d7d2895c0083d/FLAGb733afca9 [2019-10-13 22:57:49,702 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:57:49,703 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-10-13 22:57:49,715 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead3cc818/ad2afaa16f404a1c8d3d7d2895c0083d/FLAGb733afca9 [2019-10-13 22:57:50,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead3cc818/ad2afaa16f404a1c8d3d7d2895c0083d [2019-10-13 22:57:50,081 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:57:50,082 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:57:50,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:57:50,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:57:50,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:57:50,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:57:50" (1/1) ... [2019-10-13 22:57:50,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5014cfc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:50, skipping insertion in model container [2019-10-13 22:57:50,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:57:50" (1/1) ... [2019-10-13 22:57:50,100 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:57:50,124 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:57:50,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:57:50,327 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:57:50,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:57:50,482 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:57:50,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:50 WrapperNode [2019-10-13 22:57:50,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:57:50,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:57:50,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:57:50,484 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:57:50,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:50" (1/1) ... [2019-10-13 22:57:50,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:50" (1/1) ... [2019-10-13 22:57:50,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:50" (1/1) ... [2019-10-13 22:57:50,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:50" (1/1) ... [2019-10-13 22:57:50,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:50" (1/1) ... [2019-10-13 22:57:50,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:50" (1/1) ... [2019-10-13 22:57:50,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:50" (1/1) ... [2019-10-13 22:57:50,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:57:50,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:57:50,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:57:50,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:57:50,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:50" (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 22:57:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:57:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:57:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:57:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:57:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 22:57:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 22:57:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-13 22:57:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:57:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 22:57:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 22:57:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 22:57:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:57:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:57:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 22:57:51,006 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:57:51,006 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 22:57:51,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:57:51 BoogieIcfgContainer [2019-10-13 22:57:51,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:57:51,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:57:51,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:57:51,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:57:51,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:57:50" (1/3) ... [2019-10-13 22:57:51,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9705e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:57:51, skipping insertion in model container [2019-10-13 22:57:51,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:50" (2/3) ... [2019-10-13 22:57:51,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9705e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:57:51, skipping insertion in model container [2019-10-13 22:57:51,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:57:51" (3/3) ... [2019-10-13 22:57:51,016 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2019-10-13 22:57:51,027 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:57:51,035 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-13 22:57:51,045 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-13 22:57:51,067 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:57:51,067 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:57:51,067 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:57:51,067 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:57:51,067 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:57:51,068 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:57:51,068 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:57:51,068 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:57:51,084 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-10-13 22:57:51,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 22:57:51,089 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:51,090 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:51,092 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:51,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:51,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2043100231, now seen corresponding path program 1 times [2019-10-13 22:57:51,105 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:51,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006078720] [2019-10-13 22:57:51,106 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:51,106 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:51,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:51,304 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 22:57:51,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006078720] [2019-10-13 22:57:51,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:51,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:57:51,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637100432] [2019-10-13 22:57:51,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:57:51,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:51,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:57:51,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:57:51,333 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2019-10-13 22:57:51,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:51,385 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-10-13 22:57:51,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:57:51,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 22:57:51,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:51,399 INFO L225 Difference]: With dead ends: 55 [2019-10-13 22:57:51,399 INFO L226 Difference]: Without dead ends: 33 [2019-10-13 22:57:51,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 22:57:51,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-13 22:57:51,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-10-13 22:57:51,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-13 22:57:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-10-13 22:57:51,451 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 12 [2019-10-13 22:57:51,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:51,452 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-10-13 22:57:51,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:57:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-10-13 22:57:51,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 22:57:51,453 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:51,453 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:51,454 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:51,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:51,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1071190840, now seen corresponding path program 1 times [2019-10-13 22:57:51,455 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:51,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782078480] [2019-10-13 22:57:51,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:51,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:51,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:51,549 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 22:57:51,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782078480] [2019-10-13 22:57:51,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:51,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:57:51,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951727559] [2019-10-13 22:57:51,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:57:51,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:51,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:57:51,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:57:51,554 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 4 states. [2019-10-13 22:57:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:51,605 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-13 22:57:51,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:57:51,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-13 22:57:51,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:51,607 INFO L225 Difference]: With dead ends: 52 [2019-10-13 22:57:51,607 INFO L226 Difference]: Without dead ends: 50 [2019-10-13 22:57:51,609 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:57:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-13 22:57:51,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 33. [2019-10-13 22:57:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 22:57:51,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-10-13 22:57:51,618 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 13 [2019-10-13 22:57:51,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:51,618 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-10-13 22:57:51,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:57:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-10-13 22:57:51,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 22:57:51,619 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:51,620 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:51,620 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:51,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:51,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1006514579, now seen corresponding path program 1 times [2019-10-13 22:57:51,621 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:51,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997775588] [2019-10-13 22:57:51,621 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:51,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:51,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:51,664 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 22:57:51,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997775588] [2019-10-13 22:57:51,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:51,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:57:51,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497227252] [2019-10-13 22:57:51,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:57:51,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:51,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:57:51,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:57:51,667 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2019-10-13 22:57:51,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:51,720 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2019-10-13 22:57:51,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:57:51,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 22:57:51,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:51,722 INFO L225 Difference]: With dead ends: 61 [2019-10-13 22:57:51,722 INFO L226 Difference]: Without dead ends: 40 [2019-10-13 22:57:51,723 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 22:57:51,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-13 22:57:51,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-10-13 22:57:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 22:57:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-13 22:57:51,730 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 13 [2019-10-13 22:57:51,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:51,730 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-13 22:57:51,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:57:51,730 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-13 22:57:51,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 22:57:51,731 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:51,731 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:51,732 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:51,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:51,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1210971472, now seen corresponding path program 1 times [2019-10-13 22:57:51,733 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:51,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637050733] [2019-10-13 22:57:51,733 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:51,733 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:51,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:51,799 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 22:57:51,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637050733] [2019-10-13 22:57:51,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:51,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:57:51,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040770610] [2019-10-13 22:57:51,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:57:51,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:51,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:57:51,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:57:51,806 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2019-10-13 22:57:51,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:51,854 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-10-13 22:57:51,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:57:51,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 22:57:51,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:51,856 INFO L225 Difference]: With dead ends: 55 [2019-10-13 22:57:51,856 INFO L226 Difference]: Without dead ends: 34 [2019-10-13 22:57:51,857 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 22:57:51,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-13 22:57:51,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-10-13 22:57:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-13 22:57:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-10-13 22:57:51,868 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 14 [2019-10-13 22:57:51,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:51,868 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-10-13 22:57:51,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:57:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-10-13 22:57:51,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 22:57:51,869 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:51,869 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:51,870 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:51,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:51,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1694409031, now seen corresponding path program 1 times [2019-10-13 22:57:51,871 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:51,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259475463] [2019-10-13 22:57:51,871 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:51,871 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:51,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:52,965 WARN L191 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 89 [2019-10-13 22:57:53,344 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 73 [2019-10-13 22:57:53,370 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 22:57:53,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259475463] [2019-10-13 22:57:53,371 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:53,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 22:57:53,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696324517] [2019-10-13 22:57:53,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 22:57:53,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:53,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 22:57:53,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-13 22:57:53,374 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 9 states. [2019-10-13 22:57:53,594 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 42 [2019-10-13 22:57:53,776 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 46 [2019-10-13 22:57:53,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:53,841 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-10-13 22:57:53,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 22:57:53,845 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-10-13 22:57:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:53,845 INFO L225 Difference]: With dead ends: 46 [2019-10-13 22:57:53,846 INFO L226 Difference]: Without dead ends: 30 [2019-10-13 22:57:53,846 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-10-13 22:57:53,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-13 22:57:53,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-13 22:57:53,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-13 22:57:53,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-10-13 22:57:53,852 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 19 [2019-10-13 22:57:53,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:53,852 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-10-13 22:57:53,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 22:57:53,853 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-10-13 22:57:53,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 22:57:53,853 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:53,853 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] [2019-10-13 22:57:53,854 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:53,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:53,854 INFO L82 PathProgramCache]: Analyzing trace with hash 336204734, now seen corresponding path program 1 times [2019-10-13 22:57:53,855 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:53,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995540483] [2019-10-13 22:57:53,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:53,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:53,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:53,906 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 22:57:53,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995540483] [2019-10-13 22:57:53,907 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:53,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 22:57:53,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443439307] [2019-10-13 22:57:53,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 22:57:53,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:53,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 22:57:53,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:57:53,911 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 6 states. [2019-10-13 22:57:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:53,983 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-10-13 22:57:53,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 22:57:53,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-13 22:57:53,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:53,984 INFO L225 Difference]: With dead ends: 43 [2019-10-13 22:57:53,985 INFO L226 Difference]: Without dead ends: 41 [2019-10-13 22:57:53,985 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-13 22:57:53,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-13 22:57:53,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2019-10-13 22:57:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-13 22:57:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-10-13 22:57:53,991 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 20 [2019-10-13 22:57:53,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:53,991 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-10-13 22:57:53,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 22:57:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-10-13 22:57:53,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 22:57:53,992 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:53,992 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:53,993 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:53,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:53,993 INFO L82 PathProgramCache]: Analyzing trace with hash -608232998, now seen corresponding path program 1 times [2019-10-13 22:57:53,993 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:53,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573719335] [2019-10-13 22:57:53,994 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:53,994 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:53,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:54,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:54,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573719335] [2019-10-13 22:57:54,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799226903] [2019-10-13 22:57:54,402 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 22:57:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:54,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 22:57:54,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:57:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:54,651 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:57:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:56,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1786598077] [2019-10-13 22:57:56,813 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-13 22:57:56,814 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:57:56,825 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:57:56,834 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:57:56,834 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:57:56,991 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-13 22:57:57,968 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 19 for LOIs [2019-10-13 22:57:57,990 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:57:57,990 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:57:57,990 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 288#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_136~0)| ~__return_136~0)) [2019-10-13 22:57:57,991 INFO L193 IcfgInterpreter]: Reachable states at location L141 satisfy 63#(and (= 0 |old(~__tmp_155_0~0)|) (= 0 |#NULL.base|) (= (store |old(#length)| |main_~#main__array~0.base| 400000) |#length|) (<= main_~main__loop_entered~0 0) (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (= |#valid| (store |old(#valid)| |main_~#main__array~0.base| 1)) (<= ~__return_main~0 0) (< (mod main_~main__index2~0 4294967296) 100000) (<= 0 |#NULL.offset|) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (= 1 main_~main____CPAchecker_TMP_0~0) (<= 0 ~__tmp_155_0~0) (<= 0 |old(~__tmp_155_0~0)|) (< |main_~#main__array~0.base| |#StackHeapBarrier|) (not (= 0 |main_~#main__array~0.base|)) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (<= 0 main_~main__loop_entered~0) (<= ~__tmp_155_0~0 0) (= main_~main__loop_entered~0 0) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (< (mod main_~main__index1~0 4294967296) 100000) (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-13 22:57:57,992 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 82#(and (<= main_~main__loop_entered~0 0) (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 1 ~__tmp_155_0~0) (<= 0 |#NULL.base|) (<= 1 main_~__tmp_1~0) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 |old(~__tmp_155_0~0)|) (= |old(~__tmp_155_0~0)| 0) (<= ~__tmp_155_0~0 1) (= |#NULL.base| 0) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (<= 0 main_~main__loop_entered~0) (= main_~main__loop_entered~0 0) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (<= main_~__tmp_1~0 1) (= main_~__tmp_1~0 1) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-13 22:57:57,993 INFO L193 IcfgInterpreter]: Reachable states at location L24 satisfy 53#(and (= 0 |old(~__tmp_155_0~0)|) (= 0 |#NULL.base|) (= (store |old(#length)| |main_~#main__array~0.base| 400000) |#length|) (<= main_~main__loop_entered~0 0) (<= ~__return_136~0 0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (= |#valid| (store |old(#valid)| |main_~#main__array~0.base| 1)) (<= ~__return_main~0 0) (< (mod main_~main__index2~0 4294967296) 100000) (<= 0 |#NULL.offset|) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (<= 0 ~__tmp_155_0~0) (<= 0 |old(~__tmp_155_0~0)|) (< |main_~#main__array~0.base| |#StackHeapBarrier|) (not (= 0 |main_~#main__array~0.base|)) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (<= 0 main_~main__loop_entered~0) (<= ~__tmp_155_0~0 0) (= main_~main__loop_entered~0 0) (<= 0 ~__return_136~0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) (< (mod main_~main__index1~0 4294967296) 100000) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-13 22:57:57,994 INFO L193 IcfgInterpreter]: Reachable states at location L35 satisfy 68#(and (= 0 |old(~__tmp_155_0~0)|) (= 0 |#NULL.base|) (= (store |old(#length)| |main_~#main__array~0.base| 400000) |#length|) (<= main_~main__loop_entered~0 0) (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= 1 main_~__tmp_1~0) (= |#valid| (store |old(#valid)| |main_~#main__array~0.base| 1)) (<= ~__return_main~0 0) (< (mod main_~main__index2~0 4294967296) 100000) (<= 0 |#NULL.offset|) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (= 1 main_~main____CPAchecker_TMP_0~0) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 ~__tmp_155_0~0) (<= 0 |old(~__tmp_155_0~0)|) (< |main_~#main__array~0.base| |#StackHeapBarrier|) (not (= 0 |main_~#main__array~0.base|)) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (<= 0 main_~main__loop_entered~0) (<= ~__tmp_155_0~0 0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~main__loop_entered~0 0) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (= main_~__tmp_1~0 main_~main____CPAchecker_TMP_0~0) (<= main_~__tmp_1~0 1) (< (mod main_~main__index1~0 4294967296) 100000) (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-13 22:57:57,994 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 58#(and (= 0 |old(~__tmp_155_0~0)|) (= 0 |#NULL.base|) (= (store |old(#length)| |main_~#main__array~0.base| 400000) |#length|) (<= main_~main__loop_entered~0 0) (<= ~__return_136~0 0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (= |#valid| (store |old(#valid)| |main_~#main__array~0.base| 1)) (<= ~__return_main~0 0) (< (mod main_~main__index2~0 4294967296) 100000) (<= 0 |#NULL.offset|) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (<= 0 ~__tmp_155_0~0) (<= 0 |old(~__tmp_155_0~0)|) (< |main_~#main__array~0.base| |#StackHeapBarrier|) (not (= 0 |main_~#main__array~0.base|)) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (<= 0 main_~main__loop_entered~0) (<= ~__tmp_155_0~0 0) (= main_~main__loop_entered~0 0) (<= 0 ~__return_136~0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (< (mod main_~main__index1~0 4294967296) 100000) (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-13 22:57:57,995 INFO L193 IcfgInterpreter]: Reachable states at location L16 satisfy 38#(and (= 0 |old(~__tmp_155_0~0)|) (= 0 |#NULL.base|) (= (store |old(#length)| |main_~#main__array~0.base| 400000) |#length|) (<= main_~main__loop_entered~0 0) (<= ~__return_136~0 0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (= |#valid| (store |old(#valid)| |main_~#main__array~0.base| 1)) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (<= 0 ~__tmp_155_0~0) (<= 0 |old(~__tmp_155_0~0)|) (< |main_~#main__array~0.base| |#StackHeapBarrier|) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (not (= 0 |main_~#main__array~0.base|)) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (<= 0 main_~main__loop_entered~0) (<= ~__tmp_155_0~0 0) (= main_~main__loop_entered~0 0) (<= 0 ~__return_136~0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-13 22:57:57,995 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= ~__return_136~0 0) (<= 0 |#NULL.base|) (<= ~__tmp_155_0~0 0) (<= 0 ~__return_main~0) (= ~__tmp_155_0~0 0) (<= 0 ~__return_136~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 ~__tmp_155_0~0) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0) (= ~__return_136~0 0)) [2019-10-13 22:57:57,995 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |old(~__tmp_155_0~0)|) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= ~__return_136~0 0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__tmp_155_0~0 0) (<= 0 ~__return_136~0) (<= ~__return_main~0 0) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 ~__tmp_155_0~0) (= |#valid| |old(#valid)|) (<= 0 |old(~__tmp_155_0~0)|) (= |#NULL.offset| 0) (= ~__return_main~0 0) (= |old(#length)| |#length|) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-13 22:57:57,996 INFO L193 IcfgInterpreter]: Reachable states at location mainErr2ASSERT_VIOLATIONERROR_FUNCTION satisfy 279#(and (< (mod main_~main__index2~0 4294967296) (mod main_~main__index1~0 4294967296)) (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 1 ~__tmp_155_0~0) (<= main_~__VERIFIER_assert__cond~2 0) (<= 0 |#NULL.base|) (<= 1 main_~__tmp_1~0) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (= main_~__tmp_3~0 main_~__VERIFIER_assert__cond~2) (= main_~__VERIFIER_assert__cond~2 0) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 |old(~__tmp_155_0~0)|) (= |old(~__tmp_155_0~0)| 0) (<= ~__tmp_155_0~0 1) (<= 0 main_~__VERIFIER_assert__cond~2) (<= 0 main_~__tmp_3~0) (= |#NULL.base| 0) (<= main_~main__loop_entered~0 1) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (= main_~main__loop_entered~0 1) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (= main_~__tmp_3~0 (ite (= (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (ite (<= (mod main_~main__index1~0 4294967296) 2147483647) (mod main_~main__index1~0 4294967296) (+ (mod main_~main__index1~0 4294967296) (- 4294967296))) 4) |main_~#main__array~0.offset|)) 4294967296) (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (ite (<= (mod main_~main__index2~0 4294967296) 2147483647) (mod main_~main__index2~0 4294967296) (+ (mod main_~main__index2~0 4294967296) (- 4294967296))) 4) |main_~#main__array~0.offset|)) 4294967296)) 1 0)) (<= main_~__tmp_1~0 1) (= main_~__tmp_1~0 1) (<= main_~__tmp_3~0 0) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= 1 main_~main__loop_entered~0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-13 22:57:57,996 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 293#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= ~__return_136~0 0) (<= 0 |#NULL.base|) (<= ~__tmp_155_0~0 0) (<= 0 ~__return_main~0) (= ~__tmp_155_0~0 0) (<= 0 ~__return_136~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (<= 0 ~__tmp_155_0~0) (= |#NULL.offset| 0) (= ~__return_main~0 0) (= ~__return_136~0 0)) [2019-10-13 22:57:57,996 INFO L193 IcfgInterpreter]: Reachable states at location L102 satisfy 269#(and (< (mod main_~main__index2~0 4294967296) (mod main_~main__index1~0 4294967296)) (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 1 ~__tmp_155_0~0) (<= 0 |#NULL.base|) (<= 1 main_~__tmp_1~0) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (= main_~__tmp_3~0 main_~__VERIFIER_assert__cond~2) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 |old(~__tmp_155_0~0)|) (= |old(~__tmp_155_0~0)| 0) (<= ~__tmp_155_0~0 1) (<= 0 main_~__VERIFIER_assert__cond~2) (<= 0 main_~__tmp_3~0) (= |#NULL.base| 0) (<= main_~main__loop_entered~0 1) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (= main_~main__loop_entered~0 1) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (= main_~__tmp_3~0 (ite (= (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (ite (<= (mod main_~main__index1~0 4294967296) 2147483647) (mod main_~main__index1~0 4294967296) (+ (mod main_~main__index1~0 4294967296) (- 4294967296))) 4) |main_~#main__array~0.offset|)) 4294967296) (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (ite (<= (mod main_~main__index2~0 4294967296) 2147483647) (mod main_~main__index2~0 4294967296) (+ (mod main_~main__index2~0 4294967296) (- 4294967296))) 4) |main_~#main__array~0.offset|)) 4294967296)) 1 0)) (<= main_~__tmp_3~0 1) (<= main_~__tmp_1~0 1) (= main_~__tmp_1~0 1) (<= main_~__VERIFIER_assert__cond~2 1) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= 1 main_~main__loop_entered~0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-13 22:57:57,997 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:57:57,997 INFO L193 IcfgInterpreter]: Reachable states at location L92 satisfy 100#(and (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 1 ~__tmp_155_0~0) (<= 0 |#NULL.base|) (<= 1 main_~__tmp_1~0) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 |old(~__tmp_155_0~0)|) (= |old(~__tmp_155_0~0)| 0) (<= ~__tmp_155_0~0 1) (= |#NULL.base| 0) (<= main_~main__loop_entered~0 1) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (= main_~main__loop_entered~0 1) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (<= main_~__tmp_1~0 1) (= main_~__tmp_1~0 1) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= 1 main_~main__loop_entered~0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-13 22:57:57,997 INFO L193 IcfgInterpreter]: Reachable states at location L167 satisfy 284#(and (< (mod main_~main__index2~0 4294967296) (mod main_~main__index1~0 4294967296)) (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 1 ~__tmp_155_0~0) (<= 0 |#NULL.base|) (<= 1 main_~__tmp_1~0) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (= main_~__tmp_3~0 main_~__VERIFIER_assert__cond~2) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 |old(~__tmp_155_0~0)|) (= |old(~__tmp_155_0~0)| 0) (<= ~__tmp_155_0~0 1) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= 0 main_~__VERIFIER_assert__cond~2) (<= 0 main_~__tmp_3~0) (= |#NULL.base| 0) (<= main_~main__loop_entered~0 1) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (= main_~main__loop_entered~0 1) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (= main_~__tmp_3~0 (ite (= (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (ite (<= (mod main_~main__index1~0 4294967296) 2147483647) (mod main_~main__index1~0 4294967296) (+ (mod main_~main__index1~0 4294967296) (- 4294967296))) 4) |main_~#main__array~0.offset|)) 4294967296) (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (ite (<= (mod main_~main__index2~0 4294967296) 2147483647) (mod main_~main__index2~0 4294967296) (+ (mod main_~main__index2~0 4294967296) (- 4294967296))) 4) |main_~#main__array~0.offset|)) 4294967296)) 1 0)) (<= main_~__tmp_3~0 1) (<= main_~__tmp_1~0 1) (= main_~__tmp_1~0 1) (<= main_~__VERIFIER_assert__cond~2 1) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= 1 main_~main__loop_entered~0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-13 22:57:57,998 INFO L193 IcfgInterpreter]: Reachable states at location L114 satisfy 264#(and (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 1 ~__tmp_155_0~0) (<= 0 |#NULL.base|) (<= 1 main_~__tmp_1~0) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 |old(~__tmp_155_0~0)|) (= |old(~__tmp_155_0~0)| 0) (<= ~__tmp_155_0~0 1) (= |#NULL.base| 0) (<= main_~main__loop_entered~0 1) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (= main_~main__loop_entered~0 1) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (<= main_~__tmp_1~0 1) (= main_~__tmp_1~0 1) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= 1 main_~main__loop_entered~0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-13 22:57:57,999 INFO L193 IcfgInterpreter]: Reachable states at location L104 satisfy 274#(and (< (mod main_~main__index2~0 4294967296) (mod main_~main__index1~0 4294967296)) (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 1 ~__tmp_155_0~0) (<= main_~__VERIFIER_assert__cond~2 0) (<= 0 |#NULL.base|) (<= 1 main_~__tmp_1~0) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (= main_~__tmp_3~0 main_~__VERIFIER_assert__cond~2) (= main_~__VERIFIER_assert__cond~2 0) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 |old(~__tmp_155_0~0)|) (= |old(~__tmp_155_0~0)| 0) (<= ~__tmp_155_0~0 1) (<= 0 main_~__VERIFIER_assert__cond~2) (<= 0 main_~__tmp_3~0) (= |#NULL.base| 0) (<= main_~main__loop_entered~0 1) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (= main_~main__loop_entered~0 1) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (= main_~__tmp_3~0 (ite (= (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (ite (<= (mod main_~main__index1~0 4294967296) 2147483647) (mod main_~main__index1~0 4294967296) (+ (mod main_~main__index1~0 4294967296) (- 4294967296))) 4) |main_~#main__array~0.offset|)) 4294967296) (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (ite (<= (mod main_~main__index2~0 4294967296) 2147483647) (mod main_~main__index2~0 4294967296) (+ (mod main_~main__index2~0 4294967296) (- 4294967296))) 4) |main_~#main__array~0.offset|)) 4294967296)) 1 0)) (<= main_~__tmp_1~0 1) (= main_~__tmp_1~0 1) (<= main_~__tmp_3~0 0) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= 1 main_~main__loop_entered~0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-13 22:57:57,999 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 43#(and (= 0 |old(~__tmp_155_0~0)|) (= 0 |#NULL.base|) (= (store |old(#length)| |main_~#main__array~0.base| 400000) |#length|) (<= main_~main__loop_entered~0 0) (<= ~__return_136~0 0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (= |#valid| (store |old(#valid)| |main_~#main__array~0.base| 1)) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (<= 0 ~__tmp_155_0~0) (<= 0 |old(~__tmp_155_0~0)|) (< |main_~#main__array~0.base| |#StackHeapBarrier|) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (not (= 0 |main_~#main__array~0.base|)) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (<= 0 main_~main__loop_entered~0) (<= ~__tmp_155_0~0 0) (= main_~main__loop_entered~0 0) (<= 0 ~__return_136~0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (< (mod main_~main__index1~0 4294967296) 100000) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-13 22:57:58,000 INFO L193 IcfgInterpreter]: Reachable states at location L52 satisfy 91#(and (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 1 ~__tmp_155_0~0) (<= 0 |#NULL.base|) (<= 1 main_~__tmp_1~0) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 |old(~__tmp_155_0~0)|) (= |old(~__tmp_155_0~0)| 0) (<= ~__tmp_155_0~0 1) (= |#NULL.base| 0) (<= main_~main__loop_entered~0 1) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (= main_~main__loop_entered~0 1) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (<= main_~__tmp_1~0 1) (= main_~__tmp_1~0 1) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= 1 main_~main__loop_entered~0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-13 22:57:58,000 INFO L193 IcfgInterpreter]: Reachable states at location L74 satisfy 73#(and (= 0 |old(~__tmp_155_0~0)|) (= 0 |#NULL.base|) (= (store |old(#length)| |main_~#main__array~0.base| 400000) |#length|) (<= main_~main__loop_entered~0 0) (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 1 ~__tmp_155_0~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= 1 main_~__tmp_1~0) (= |#valid| (store |old(#valid)| |main_~#main__array~0.base| 1)) (<= ~__return_main~0 0) (< (mod main_~main__index2~0 4294967296) 100000) (<= 0 |#NULL.offset|) (not (= main_~__VERIFIER_assert__cond~0 0)) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (= 1 main_~main____CPAchecker_TMP_0~0) (<= main_~__VERIFIER_assert__cond~0 1) (= ~__tmp_155_0~0 main_~main____CPAchecker_TMP_0~0) (<= 0 |old(~__tmp_155_0~0)|) (<= ~__tmp_155_0~0 1) (< |main_~#main__array~0.base| |#StackHeapBarrier|) (not (= 0 |main_~#main__array~0.base|)) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (<= 0 main_~main__loop_entered~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~main__loop_entered~0 0) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (= main_~__tmp_1~0 main_~main____CPAchecker_TMP_0~0) (<= main_~__tmp_1~0 1) (< (mod main_~main__index1~0 4294967296) 100000) (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-13 22:57:58,000 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 48#(and (= 0 |old(~__tmp_155_0~0)|) (= 0 |#NULL.base|) (= (store |old(#length)| |main_~#main__array~0.base| 400000) |#length|) (<= main_~main__loop_entered~0 0) (<= ~__return_136~0 0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (= |#valid| (store |old(#valid)| |main_~#main__array~0.base| 1)) (<= ~__return_main~0 0) (< (mod main_~main__index2~0 4294967296) 100000) (<= 0 |#NULL.offset|) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (<= 0 ~__tmp_155_0~0) (<= 0 |old(~__tmp_155_0~0)|) (< |main_~#main__array~0.base| |#StackHeapBarrier|) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (not (= 0 |main_~#main__array~0.base|)) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (<= 0 main_~main__loop_entered~0) (<= ~__tmp_155_0~0 0) (= main_~main__loop_entered~0 0) (<= 0 ~__return_136~0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (< (mod main_~main__index1~0 4294967296) 100000) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-13 22:57:58,209 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-10-13 22:57:58,591 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-10-13 22:57:58,761 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-10-13 22:57:59,002 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-10-13 22:57:59,249 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-10-13 22:57:59,493 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-10-13 22:57:59,710 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-10-13 22:58:01,975 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-10-13 22:58:02,437 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-10-13 22:58:02,656 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-10-13 22:58:02,658 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:58:02,659 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4, 16] total 25 [2019-10-13 22:58:02,659 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783987656] [2019-10-13 22:58:02,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 22:58:02,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:02,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 22:58:02,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2019-10-13 22:58:02,662 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 25 states. [2019-10-13 22:58:12,252 WARN L191 SmtUtils]: Spent 6.75 s on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-10-13 22:58:19,135 WARN L191 SmtUtils]: Spent 5.83 s on a formula simplification that was a NOOP. DAG size: 70 [2019-10-13 22:58:21,338 WARN L191 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 72 [2019-10-13 22:58:23,731 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2019-10-13 22:58:32,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:32,975 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-10-13 22:58:32,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-13 22:58:32,976 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 22 [2019-10-13 22:58:32,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:32,976 INFO L225 Difference]: With dead ends: 41 [2019-10-13 22:58:32,977 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 22:58:32,978 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=163, Invalid=828, Unknown=1, NotChecked=0, Total=992 [2019-10-13 22:58:32,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 22:58:32,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 22:58:32,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 22:58:32,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 22:58:32,978 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-10-13 22:58:32,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:32,979 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 22:58:32,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 22:58:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 22:58:32,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 22:58:33,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:58:33,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.