/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 00:33:27,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 00:33:27,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 00:33:27,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 00:33:27,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 00:33:27,310 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 00:33:27,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 00:33:27,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 00:33:27,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 00:33:27,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 00:33:27,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 00:33:27,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 00:33:27,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 00:33:27,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 00:33:27,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 00:33:27,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 00:33:27,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 00:33:27,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 00:33:27,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 00:33:27,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 00:33:27,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 00:33:27,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 00:33:27,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 00:33:27,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 00:33:27,335 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 00:33:27,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 00:33:27,336 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 00:33:27,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 00:33:27,337 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 00:33:27,338 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 00:33:27,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 00:33:27,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 00:33:27,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 00:33:27,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 00:33:27,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 00:33:27,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 00:33:27,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 00:33:27,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 00:33:27,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 00:33:27,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 00:33:27,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 00:33:27,346 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 00:33:27,363 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 00:33:27,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 00:33:27,364 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 00:33:27,364 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 00:33:27,364 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 00:33:27,364 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 00:33:27,365 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 00:33:27,365 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 00:33:27,365 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 00:33:27,365 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 00:33:27,366 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 00:33:27,366 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 00:33:27,366 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 00:33:27,366 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 00:33:27,367 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 00:33:27,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 00:33:27,368 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 00:33:27,368 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 00:33:27,368 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 00:33:27,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 00:33:27,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 00:33:27,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 00:33:27,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 00:33:27,369 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 00:33:27,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 00:33:27,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 00:33:27,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 00:33:27,370 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 00:33:27,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 00:33:27,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 00:33:27,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 00:33:27,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 00:33:27,373 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 00:33:27,373 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 00:33:27,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 00:33:27,373 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 00:33:27,375 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 00:33:27,375 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 00:33:27,667 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 00:33:27,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 00:33:27,682 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 00:33:27,684 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 00:33:27,684 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 00:33:27,685 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1-1.i [2019-11-24 00:33:27,743 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6c3ce405/c188c95f73d84314accca2e1e162e374/FLAG70e967d21 [2019-11-24 00:33:28,267 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 00:33:28,268 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1-1.i [2019-11-24 00:33:28,283 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6c3ce405/c188c95f73d84314accca2e1e162e374/FLAG70e967d21 [2019-11-24 00:33:28,568 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6c3ce405/c188c95f73d84314accca2e1e162e374 [2019-11-24 00:33:28,576 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 00:33:28,578 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 00:33:28,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 00:33:28,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 00:33:28,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 00:33:28,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:33:28" (1/1) ... [2019-11-24 00:33:28,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56400103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:28, skipping insertion in model container [2019-11-24 00:33:28,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:33:28" (1/1) ... [2019-11-24 00:33:28,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 00:33:28,660 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 00:33:29,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:33:29,102 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 00:33:29,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:33:29,208 INFO L208 MainTranslator]: Completed translation [2019-11-24 00:33:29,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:29 WrapperNode [2019-11-24 00:33:29,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 00:33:29,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 00:33:29,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 00:33:29,210 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 00:33:29,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:29" (1/1) ... [2019-11-24 00:33:29,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:29" (1/1) ... [2019-11-24 00:33:29,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 00:33:29,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 00:33:29,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 00:33:29,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 00:33:29,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:29" (1/1) ... [2019-11-24 00:33:29,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:29" (1/1) ... [2019-11-24 00:33:29,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:29" (1/1) ... [2019-11-24 00:33:29,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:29" (1/1) ... [2019-11-24 00:33:29,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:29" (1/1) ... [2019-11-24 00:33:29,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:29" (1/1) ... [2019-11-24 00:33:29,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:29" (1/1) ... [2019-11-24 00:33:29,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 00:33:29,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 00:33:29,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 00:33:29,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 00:33:29,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:29" (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-11-24 00:33:29,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 00:33:29,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 00:33:29,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 00:33:29,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 00:33:29,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 00:33:29,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 00:33:29,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 00:33:29,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 00:33:30,304 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 00:33:30,305 INFO L284 CfgBuilder]: Removed 21 assume(true) statements. [2019-11-24 00:33:30,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:33:30 BoogieIcfgContainer [2019-11-24 00:33:30,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 00:33:30,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 00:33:30,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 00:33:30,310 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 00:33:30,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:33:28" (1/3) ... [2019-11-24 00:33:30,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff4caaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:33:30, skipping insertion in model container [2019-11-24 00:33:30,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:29" (2/3) ... [2019-11-24 00:33:30,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff4caaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:33:30, skipping insertion in model container [2019-11-24 00:33:30,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:33:30" (3/3) ... [2019-11-24 00:33:30,313 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2019-11-24 00:33:30,321 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 00:33:30,329 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-11-24 00:33:30,337 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-24 00:33:30,359 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 00:33:30,360 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 00:33:30,360 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 00:33:30,360 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 00:33:30,360 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 00:33:30,360 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 00:33:30,360 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 00:33:30,361 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 00:33:30,375 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-11-24 00:33:30,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-24 00:33:30,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:33:30,383 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-24 00:33:30,384 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:33:30,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:33:30,389 INFO L82 PathProgramCache]: Analyzing trace with hash 203576989, now seen corresponding path program 1 times [2019-11-24 00:33:30,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:33:30,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421427468] [2019-11-24 00:33:30,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:33:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:33:30,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421427468] [2019-11-24 00:33:30,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:33:30,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:33:30,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054577957] [2019-11-24 00:33:30,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 00:33:30,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:33:30,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 00:33:30,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 00:33:30,555 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2019-11-24 00:33:30,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:33:30,576 INFO L93 Difference]: Finished difference Result 81 states and 131 transitions. [2019-11-24 00:33:30,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 00:33:30,578 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-24 00:33:30,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:33:30,586 INFO L225 Difference]: With dead ends: 81 [2019-11-24 00:33:30,586 INFO L226 Difference]: Without dead ends: 39 [2019-11-24 00:33:30,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 00:33:30,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-24 00:33:30,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-24 00:33:30,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-24 00:33:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-11-24 00:33:30,623 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 5 [2019-11-24 00:33:30,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:33:30,623 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-24 00:33:30,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 00:33:30,624 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-11-24 00:33:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-24 00:33:30,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:33:30,625 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-24 00:33:30,625 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:33:30,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:33:30,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1958512255, now seen corresponding path program 1 times [2019-11-24 00:33:30,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:33:30,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209553583] [2019-11-24 00:33:30,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:33:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:33:30,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209553583] [2019-11-24 00:33:30,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:33:30,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 00:33:30,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047446332] [2019-11-24 00:33:30,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 00:33:30,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:33:30,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 00:33:30,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 00:33:30,790 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2019-11-24 00:33:31,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:33:31,093 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-11-24 00:33:31,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 00:33:31,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-24 00:33:31,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:33:31,096 INFO L225 Difference]: With dead ends: 39 [2019-11-24 00:33:31,096 INFO L226 Difference]: Without dead ends: 37 [2019-11-24 00:33:31,097 INFO L630 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-11-24 00:33:31,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-24 00:33:31,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-24 00:33:31,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-24 00:33:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-11-24 00:33:31,103 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 6 [2019-11-24 00:33:31,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:33:31,103 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-11-24 00:33:31,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 00:33:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-11-24 00:33:31,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-24 00:33:31,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:33:31,104 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-24 00:33:31,105 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:33:31,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:33:31,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1953024847, now seen corresponding path program 1 times [2019-11-24 00:33:31,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:33:31,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100161790] [2019-11-24 00:33:31,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:33:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:31,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:33:31,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100161790] [2019-11-24 00:33:31,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:33:31,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:33:31,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689220395] [2019-11-24 00:33:31,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 00:33:31,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:33:31,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 00:33:31,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 00:33:31,182 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2019-11-24 00:33:31,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:33:31,385 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-11-24 00:33:31,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 00:33:31,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-24 00:33:31,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:33:31,386 INFO L225 Difference]: With dead ends: 40 [2019-11-24 00:33:31,386 INFO L226 Difference]: Without dead ends: 36 [2019-11-24 00:33:31,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-24 00:33:31,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-24 00:33:31,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-11-24 00:33:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-24 00:33:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-11-24 00:33:31,392 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 6 [2019-11-24 00:33:31,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:33:31,392 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-24 00:33:31,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 00:33:31,393 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-11-24 00:33:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 00:33:31,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:33:31,393 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:33:31,394 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:33:31,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:33:31,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1088186010, now seen corresponding path program 1 times [2019-11-24 00:33:31,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:33:31,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968202843] [2019-11-24 00:33:31,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:33:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:33:31,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968202843] [2019-11-24 00:33:31,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:33:31,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 00:33:31,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000503929] [2019-11-24 00:33:31,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 00:33:31,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:33:31,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 00:33:31,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 00:33:31,552 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 4 states. [2019-11-24 00:33:32,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:33:32,069 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-11-24 00:33:32,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 00:33:32,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-24 00:33:32,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:33:32,070 INFO L225 Difference]: With dead ends: 33 [2019-11-24 00:33:32,071 INFO L226 Difference]: Without dead ends: 31 [2019-11-24 00:33:32,071 INFO L630 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-11-24 00:33:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-24 00:33:32,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-24 00:33:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-24 00:33:32,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-11-24 00:33:32,076 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 9 [2019-11-24 00:33:32,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:33:32,076 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-11-24 00:33:32,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 00:33:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-11-24 00:33:32,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 00:33:32,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:33:32,078 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:33:32,078 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:33:32,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:33:32,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1354743889, now seen corresponding path program 1 times [2019-11-24 00:33:32,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:33:32,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741393402] [2019-11-24 00:33:32,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:33:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:32,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:33:32,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741393402] [2019-11-24 00:33:32,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:33:32,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 00:33:32,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923301064] [2019-11-24 00:33:32,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 00:33:32,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:33:32,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 00:33:32,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:33:32,207 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 5 states. [2019-11-24 00:33:32,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:33:32,686 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-11-24 00:33:32,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 00:33:32,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-24 00:33:32,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:33:32,687 INFO L225 Difference]: With dead ends: 56 [2019-11-24 00:33:32,687 INFO L226 Difference]: Without dead ends: 54 [2019-11-24 00:33:32,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 00:33:32,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-24 00:33:32,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-11-24 00:33:32,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-24 00:33:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-11-24 00:33:32,694 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 9 [2019-11-24 00:33:32,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:33:32,694 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-11-24 00:33:32,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 00:33:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-11-24 00:33:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 00:33:32,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:33:32,695 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:33:32,696 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:33:32,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:33:32,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1743206058, now seen corresponding path program 1 times [2019-11-24 00:33:32,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:33:32,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719691524] [2019-11-24 00:33:32,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:33:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:33:32,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719691524] [2019-11-24 00:33:32,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:33:32,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 00:33:32,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375868467] [2019-11-24 00:33:32,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 00:33:32,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:33:32,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 00:33:32,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:33:32,775 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 5 states. [2019-11-24 00:33:33,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:33:33,066 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2019-11-24 00:33:33,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 00:33:33,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-24 00:33:33,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:33:33,068 INFO L225 Difference]: With dead ends: 53 [2019-11-24 00:33:33,068 INFO L226 Difference]: Without dead ends: 41 [2019-11-24 00:33:33,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 00:33:33,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-24 00:33:33,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-11-24 00:33:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-24 00:33:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-11-24 00:33:33,074 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2019-11-24 00:33:33,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:33:33,075 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-11-24 00:33:33,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 00:33:33,075 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-11-24 00:33:33,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 00:33:33,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:33:33,076 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:33:33,076 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:33:33,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:33:33,077 INFO L82 PathProgramCache]: Analyzing trace with hash -282967061, now seen corresponding path program 1 times [2019-11-24 00:33:33,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:33:33,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303697621] [2019-11-24 00:33:33,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:33:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:33:33,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303697621] [2019-11-24 00:33:33,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485656840] [2019-11-24 00:33:33,124 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-11-24 00:33:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:33,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-24 00:33:33,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:33:33,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:33:33,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:33:33,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:33:33,252 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-11-24 00:33:33,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:33:33,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:33:33,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:33:33,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:33:33,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:33:33,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-11-24 00:33:33,297 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:33:33,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:33:33,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:33:33,309 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:36 [2019-11-24 00:33:33,365 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-24 00:33:33,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:33:33,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:33:33,380 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:33:33,381 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-24 00:33:33,381 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:33:33,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:33:33,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:33:33,387 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-11-24 00:33:33,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:33:33,391 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:33:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:33:33,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [527313753] [2019-11-24 00:33:33,428 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-11-24 00:33:33,429 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 00:33:33,435 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 00:33:33,442 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 00:33:33,443 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 00:33:33,807 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 00:33:34,211 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-11-24 00:33:34,546 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-11-24 00:33:34,809 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2019-11-24 00:33:34,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-24 00:33:34,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4, 4] total 11 [2019-11-24 00:33:34,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6693285] [2019-11-24 00:33:34,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 00:33:34,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:33:34,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 00:33:34,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-24 00:33:34,846 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 7 states. [2019-11-24 00:33:35,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:33:35,743 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-24 00:33:35,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 00:33:35,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-11-24 00:33:35,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:33:35,745 INFO L225 Difference]: With dead ends: 58 [2019-11-24 00:33:35,745 INFO L226 Difference]: Without dead ends: 35 [2019-11-24 00:33:35,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-24 00:33:35,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-24 00:33:35,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-24 00:33:35,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-24 00:33:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-11-24 00:33:35,750 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 16 [2019-11-24 00:33:35,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:33:35,750 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-11-24 00:33:35,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 00:33:35,751 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-11-24 00:33:35,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 00:33:35,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:33:35,751 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:33:35,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:33:35,960 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:33:35,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:33:35,960 INFO L82 PathProgramCache]: Analyzing trace with hash -78338206, now seen corresponding path program 1 times [2019-11-24 00:33:35,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:33:35,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248101805] [2019-11-24 00:33:35,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:33:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:36,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:33:36,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248101805] [2019-11-24 00:33:36,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992073209] [2019-11-24 00:33:36,172 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-11-24 00:33:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:36,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-24 00:33:36,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:33:42,498 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= 0 |ULTIMATE.start_main_#t~malloc2.base|) [2019-11-24 00:33:44,506 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= 0 |ULTIMATE.start_main_#t~malloc2.base|)