/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:05:31,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:05:31,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:05:31,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:05:31,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:05:31,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:05:31,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:05:31,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:05:31,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:05:31,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:05:31,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:05:31,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:05:31,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:05:31,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:05:31,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:05:31,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:05:31,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:05:31,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:05:31,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:05:31,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:05:31,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:05:31,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:05:31,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:05:31,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:05:31,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:05:31,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:05:31,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:05:31,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:05:31,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:05:31,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:05:31,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:05:31,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:05:31,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:05:31,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:05:31,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:05:31,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:05:31,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:05:31,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:05:31,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:05:31,429 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:05:31,430 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:05:31,431 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-11-07 01:05:31,451 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:05:31,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:05:31,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:05:31,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:05:31,454 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:05:31,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:05:31,455 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:05:31,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:05:31,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:05:31,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:05:31,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:05:31,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:05:31,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:05:31,457 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:05:31,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:05:31,458 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:05:31,458 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:05:31,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:05:31,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:05:31,458 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:05:31,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:05:31,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:05:31,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:05:31,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:05:31,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:05:31,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:05:31,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:05:31,460 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:05:31,460 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 01:05:31,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:05:31,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:05:31,736 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:05:31,737 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:05:31,738 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:05:31,739 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-11-07 01:05:31,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba77f442/ee50673947ed4b828dfa5dee1a009bed/FLAGeffae681a [2019-11-07 01:05:32,321 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:05:32,322 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-11-07 01:05:32,339 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba77f442/ee50673947ed4b828dfa5dee1a009bed/FLAGeffae681a [2019-11-07 01:05:32,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba77f442/ee50673947ed4b828dfa5dee1a009bed [2019-11-07 01:05:32,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:05:32,693 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:05:32,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:05:32,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:05:32,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:05:32,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:32" (1/1) ... [2019-11-07 01:05:32,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34de45d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:32, skipping insertion in model container [2019-11-07 01:05:32,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:32" (1/1) ... [2019-11-07 01:05:32,708 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:05:32,750 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:05:33,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:05:33,029 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:05:33,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:05:33,213 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:05:33,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:33 WrapperNode [2019-11-07 01:05:33,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:05:33,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:05:33,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:05:33,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:05:33,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:33" (1/1) ... [2019-11-07 01:05:33,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:33" (1/1) ... [2019-11-07 01:05:33,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:33" (1/1) ... [2019-11-07 01:05:33,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:33" (1/1) ... [2019-11-07 01:05:33,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:33" (1/1) ... [2019-11-07 01:05:33,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:33" (1/1) ... [2019-11-07 01:05:33,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:33" (1/1) ... [2019-11-07 01:05:33,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:05:33,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:05:33,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:05:33,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:05:33,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:33" (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-07 01:05:33,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:05:33,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:05:33,320 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:05:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:05:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:05:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:05:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-07 01:05:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:05:33,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:05:33,321 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:05:33,321 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:05:33,321 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:05:33,321 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:05:33,321 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:05:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:05:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:05:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:05:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:05:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:05:33,942 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:05:33,942 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:05:33,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:33 BoogieIcfgContainer [2019-11-07 01:05:33,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:05:33,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:05:33,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:05:33,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:05:33,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:05:32" (1/3) ... [2019-11-07 01:05:33,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553be8f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:33, skipping insertion in model container [2019-11-07 01:05:33,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:33" (2/3) ... [2019-11-07 01:05:33,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553be8f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:33, skipping insertion in model container [2019-11-07 01:05:33,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:33" (3/3) ... [2019-11-07 01:05:33,953 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-11-07 01:05:33,965 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:05:33,981 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:05:33,991 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:05:34,024 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:05:34,025 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:05:34,025 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:05:34,025 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:05:34,025 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:05:34,025 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:05:34,025 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:05:34,026 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:05:34,042 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-11-07 01:05:34,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-07 01:05:34,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:34,050 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:34,052 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:34,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:34,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1555775493, now seen corresponding path program 1 times [2019-11-07 01:05:34,066 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:34,067 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234994549] [2019-11-07 01:05:34,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:34,419 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-07 01:05:34,420 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234994549] [2019-11-07 01:05:34,421 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:34,421 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:34,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637311324] [2019-11-07 01:05:34,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:34,431 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:34,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:34,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:34,449 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2019-11-07 01:05:34,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:34,534 INFO L93 Difference]: Finished difference Result 197 states and 307 transitions. [2019-11-07 01:05:34,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:34,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-07 01:05:34,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:34,550 INFO L225 Difference]: With dead ends: 197 [2019-11-07 01:05:34,551 INFO L226 Difference]: Without dead ends: 126 [2019-11-07 01:05:34,555 INFO L630 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-11-07 01:05:34,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-07 01:05:34,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-11-07 01:05:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-07 01:05:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2019-11-07 01:05:34,604 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 182 transitions. Word has length 41 [2019-11-07 01:05:34,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:34,604 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 182 transitions. [2019-11-07 01:05:34,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:34,605 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 182 transitions. [2019-11-07 01:05:34,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-07 01:05:34,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:34,607 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:34,607 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:34,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:34,608 INFO L82 PathProgramCache]: Analyzing trace with hash 477079428, now seen corresponding path program 1 times [2019-11-07 01:05:34,608 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:34,608 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843517113] [2019-11-07 01:05:34,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:34,766 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-07 01:05:34,767 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843517113] [2019-11-07 01:05:34,767 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:34,767 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:34,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381019577] [2019-11-07 01:05:34,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:34,773 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:34,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:34,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:34,774 INFO L87 Difference]: Start difference. First operand 124 states and 182 transitions. Second operand 3 states. [2019-11-07 01:05:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:34,857 INFO L93 Difference]: Finished difference Result 292 states and 446 transitions. [2019-11-07 01:05:34,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:34,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-07 01:05:34,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:34,863 INFO L225 Difference]: With dead ends: 292 [2019-11-07 01:05:34,863 INFO L226 Difference]: Without dead ends: 192 [2019-11-07 01:05:34,867 INFO L630 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-11-07 01:05:34,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-07 01:05:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2019-11-07 01:05:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-07 01:05:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 285 transitions. [2019-11-07 01:05:34,916 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 285 transitions. Word has length 42 [2019-11-07 01:05:34,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:34,917 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 285 transitions. [2019-11-07 01:05:34,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:34,921 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 285 transitions. [2019-11-07 01:05:34,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-07 01:05:34,923 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:34,925 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:34,925 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:34,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:34,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1738555772, now seen corresponding path program 1 times [2019-11-07 01:05:34,926 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:34,926 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704977179] [2019-11-07 01:05:34,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:35,083 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-07 01:05:35,084 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704977179] [2019-11-07 01:05:35,084 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:35,084 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:05:35,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580686130] [2019-11-07 01:05:35,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:05:35,088 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:35,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:05:35,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:35,091 INFO L87 Difference]: Start difference. First operand 190 states and 285 transitions. Second operand 5 states. [2019-11-07 01:05:35,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:35,253 INFO L93 Difference]: Finished difference Result 854 states and 1329 transitions. [2019-11-07 01:05:35,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:05:35,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-07 01:05:35,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:35,260 INFO L225 Difference]: With dead ends: 854 [2019-11-07 01:05:35,260 INFO L226 Difference]: Without dead ends: 688 [2019-11-07 01:05:35,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:05:35,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2019-11-07 01:05:35,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 354. [2019-11-07 01:05:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-11-07 01:05:35,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 537 transitions. [2019-11-07 01:05:35,311 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 537 transitions. Word has length 43 [2019-11-07 01:05:35,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:35,311 INFO L462 AbstractCegarLoop]: Abstraction has 354 states and 537 transitions. [2019-11-07 01:05:35,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:05:35,312 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 537 transitions. [2019-11-07 01:05:35,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-07 01:05:35,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:35,314 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:35,314 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:35,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:35,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1920813121, now seen corresponding path program 1 times [2019-11-07 01:05:35,315 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:35,315 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927713876] [2019-11-07 01:05:35,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:35,469 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-07 01:05:35,470 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927713876] [2019-11-07 01:05:35,470 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:35,470 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:05:35,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280959916] [2019-11-07 01:05:35,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:05:35,471 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:35,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:05:35,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:35,472 INFO L87 Difference]: Start difference. First operand 354 states and 537 transitions. Second operand 5 states. [2019-11-07 01:05:35,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:35,609 INFO L93 Difference]: Finished difference Result 1232 states and 1892 transitions. [2019-11-07 01:05:35,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:05:35,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-07 01:05:35,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:35,616 INFO L225 Difference]: With dead ends: 1232 [2019-11-07 01:05:35,617 INFO L226 Difference]: Without dead ends: 902 [2019-11-07 01:05:35,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:35,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2019-11-07 01:05:35,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 898. [2019-11-07 01:05:35,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 898 states. [2019-11-07 01:05:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1369 transitions. [2019-11-07 01:05:35,686 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1369 transitions. Word has length 44 [2019-11-07 01:05:35,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:35,687 INFO L462 AbstractCegarLoop]: Abstraction has 898 states and 1369 transitions. [2019-11-07 01:05:35,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:05:35,687 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1369 transitions. [2019-11-07 01:05:35,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-07 01:05:35,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:35,689 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:35,690 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:35,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:35,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1112409250, now seen corresponding path program 1 times [2019-11-07 01:05:35,690 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:35,691 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510970190] [2019-11-07 01:05:35,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:35,754 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-07 01:05:35,754 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510970190] [2019-11-07 01:05:35,755 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:35,755 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:35,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061144648] [2019-11-07 01:05:35,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:35,756 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:35,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:35,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:35,757 INFO L87 Difference]: Start difference. First operand 898 states and 1369 transitions. Second operand 3 states. [2019-11-07 01:05:35,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:35,891 INFO L93 Difference]: Finished difference Result 2334 states and 3555 transitions. [2019-11-07 01:05:35,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:35,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-07 01:05:35,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:35,900 INFO L225 Difference]: With dead ends: 2334 [2019-11-07 01:05:35,901 INFO L226 Difference]: Without dead ends: 1460 [2019-11-07 01:05:35,903 INFO L630 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-11-07 01:05:35,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2019-11-07 01:05:35,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1458. [2019-11-07 01:05:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2019-11-07 01:05:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 2185 transitions. [2019-11-07 01:05:36,001 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 2185 transitions. Word has length 46 [2019-11-07 01:05:36,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:36,001 INFO L462 AbstractCegarLoop]: Abstraction has 1458 states and 2185 transitions. [2019-11-07 01:05:36,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:36,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 2185 transitions. [2019-11-07 01:05:36,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-07 01:05:36,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:36,005 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:36,005 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:36,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:36,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1926406488, now seen corresponding path program 1 times [2019-11-07 01:05:36,006 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:36,006 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758552860] [2019-11-07 01:05:36,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:36,119 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-07 01:05:36,119 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758552860] [2019-11-07 01:05:36,119 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:36,119 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:05:36,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855105052] [2019-11-07 01:05:36,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:05:36,120 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:36,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:05:36,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:05:36,123 INFO L87 Difference]: Start difference. First operand 1458 states and 2185 transitions. Second operand 6 states. [2019-11-07 01:05:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:36,631 INFO L93 Difference]: Finished difference Result 5648 states and 8476 transitions. [2019-11-07 01:05:36,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:05:36,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-11-07 01:05:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:36,655 INFO L225 Difference]: With dead ends: 5648 [2019-11-07 01:05:36,655 INFO L226 Difference]: Without dead ends: 4214 [2019-11-07 01:05:36,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:05:36,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4214 states. [2019-11-07 01:05:36,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4214 to 4210. [2019-11-07 01:05:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4210 states. [2019-11-07 01:05:37,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 6281 transitions. [2019-11-07 01:05:37,015 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 6281 transitions. Word has length 46 [2019-11-07 01:05:37,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:37,018 INFO L462 AbstractCegarLoop]: Abstraction has 4210 states and 6281 transitions. [2019-11-07 01:05:37,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:05:37,023 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 6281 transitions. [2019-11-07 01:05:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-07 01:05:37,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:37,025 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:37,025 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:37,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:37,025 INFO L82 PathProgramCache]: Analyzing trace with hash -742396141, now seen corresponding path program 1 times [2019-11-07 01:05:37,031 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:37,032 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475373490] [2019-11-07 01:05:37,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:37,127 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-07 01:05:37,129 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475373490] [2019-11-07 01:05:37,129 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:37,129 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:05:37,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357209982] [2019-11-07 01:05:37,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:05:37,130 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:37,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:05:37,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:37,131 INFO L87 Difference]: Start difference. First operand 4210 states and 6281 transitions. Second operand 5 states. [2019-11-07 01:05:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:37,806 INFO L93 Difference]: Finished difference Result 8684 states and 12826 transitions. [2019-11-07 01:05:37,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:05:37,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-07 01:05:37,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:37,861 INFO L225 Difference]: With dead ends: 8684 [2019-11-07 01:05:37,861 INFO L226 Difference]: Without dead ends: 8682 [2019-11-07 01:05:37,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:05:37,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8682 states. [2019-11-07 01:05:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8682 to 4498. [2019-11-07 01:05:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4498 states. [2019-11-07 01:05:38,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4498 states to 4498 states and 6569 transitions. [2019-11-07 01:05:38,350 INFO L78 Accepts]: Start accepts. Automaton has 4498 states and 6569 transitions. Word has length 46 [2019-11-07 01:05:38,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:38,350 INFO L462 AbstractCegarLoop]: Abstraction has 4498 states and 6569 transitions. [2019-11-07 01:05:38,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:05:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 4498 states and 6569 transitions. [2019-11-07 01:05:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 01:05:38,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:38,352 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:38,352 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:38,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:38,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1529824191, now seen corresponding path program 1 times [2019-11-07 01:05:38,353 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:38,353 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282301875] [2019-11-07 01:05:38,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:38,419 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-07 01:05:38,420 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282301875] [2019-11-07 01:05:38,420 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:38,420 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:38,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824936834] [2019-11-07 01:05:38,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:38,421 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:38,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:38,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:38,422 INFO L87 Difference]: Start difference. First operand 4498 states and 6569 transitions. Second operand 3 states. [2019-11-07 01:05:38,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:38,863 INFO L93 Difference]: Finished difference Result 10814 states and 15783 transitions. [2019-11-07 01:05:38,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:38,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-07 01:05:38,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:38,904 INFO L225 Difference]: With dead ends: 10814 [2019-11-07 01:05:38,904 INFO L226 Difference]: Without dead ends: 6340 [2019-11-07 01:05:38,917 INFO L630 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-11-07 01:05:38,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6340 states. [2019-11-07 01:05:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6340 to 6278. [2019-11-07 01:05:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6278 states. [2019-11-07 01:05:39,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6278 states to 6278 states and 9057 transitions. [2019-11-07 01:05:39,496 INFO L78 Accepts]: Start accepts. Automaton has 6278 states and 9057 transitions. Word has length 47 [2019-11-07 01:05:39,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:39,496 INFO L462 AbstractCegarLoop]: Abstraction has 6278 states and 9057 transitions. [2019-11-07 01:05:39,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 6278 states and 9057 transitions. [2019-11-07 01:05:39,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-07 01:05:39,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:39,500 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:39,500 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:39,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:39,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1418257868, now seen corresponding path program 1 times [2019-11-07 01:05:39,501 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:39,501 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789132994] [2019-11-07 01:05:39,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:39,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:39,604 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789132994] [2019-11-07 01:05:39,604 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274149388] [2019-11-07 01:05:39,604 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-07 01:05:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:39,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-07 01:05:39,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:05:39,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:39,924 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:05:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:39,999 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1454764555] [2019-11-07 01:05:40,009 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 66 [2019-11-07 01:05:40,079 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:05:40,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:05:40,204 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:05:40,368 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-07 01:05:40,371 INFO L272 AbstractInterpreter]: Visited 52 different actions 90 times. Merged at 25 different actions 32 times. Never widened. Performed 377 root evaluator evaluations with a maximum evaluation depth of 5. Performed 377 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 94 variables. [2019-11-07 01:05:40,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:40,376 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-07 01:05:40,583 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 83.19% of their original sizes. [2019-11-07 01:05:40,583 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-07 01:05:42,047 INFO L553 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2019-11-07 01:05:42,047 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-07 01:05:42,048 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:05:42,048 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [7, 7, 7] total 45 [2019-11-07 01:05:42,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133857456] [2019-11-07 01:05:42,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-07 01:05:42,050 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:42,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-07 01:05:42,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-07 01:05:42,051 INFO L87 Difference]: Start difference. First operand 6278 states and 9057 transitions. Second operand 36 states. [2019-11-07 01:05:42,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 01:05:42,253 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:05:42,254 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at least one of both input predicates is unknown: 67654#true or 68225#(and (<= ~id2~0 127) (= ~mode1~0 1) (= (+ ~p1_new~0 1) 0) (= (+ ~nomsg~0 1) 0) (<= 0 main_~node2____CPAchecker_TMP_0~0) (<= ~send3~0 127) (<= main_~node2____CPAchecker_TMP_0~0 127) (<= ~id3~0 127) (<= 0 ~id3~0) (<= 0 ~id2~0) (= ~st1~0 0) (= (+ ~p3_new~0 1) 0) (= ~st3~0 0) (= ~st2~0 0) (<= 0 ~send3~0)) ([#1{~id2~0 = [0;127]; ~st3~0 = [0;0]; ~mode1~0 = [1;1]; ~p3_new~0 = [-1;-1]; ~p1_new~0 = [-1;-1]; ~st1~0 = [0;0]; ~nomsg~0 = [-1;-1]; ~st2~0 = [0;0]; main_~node2____CPAchecker_TMP_0~0 = [0;127]; ~send3~0 = [0;127]; ~id3~0 = [0;127]; }]) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$CoverageRelation.isCovered(PredicateUnifier.java:593) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.SdHoareTripleChecker$CheckHelper.check(SdHoareTripleChecker.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.SdHoareTripleChecker.checkCall(SdHoareTripleChecker.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.checkCall(EfficientHoareTripleChecker.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkCall(CachingHoareTripleChecker.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$CallSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:403) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.callSuccessors(TotalizeNwa.java:260) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.callSuccessors(ComplementDeterministicNwa.java:131) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.callSuccessors(ProductNwa.java:252) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.callSuccessors(ProductNwa.java:244) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addCallsAndSuccessors(NestedWordAutomatonReachableStates.java:1089) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:969) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-07 01:05:42,260 INFO L168 Benchmark]: Toolchain (without parser) took 9566.46 ms. Allocated memory was 144.2 MB in the beginning and 446.7 MB in the end (delta: 302.5 MB). Free memory was 100.4 MB in the beginning and 120.1 MB in the end (delta: -19.7 MB). Peak memory consumption was 282.8 MB. Max. memory is 7.1 GB. [2019-11-07 01:05:42,261 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 144.2 MB. Free memory was 119.3 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 01:05:42,262 INFO L168 Benchmark]: CACSL2BoogieTranslator took 519.37 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 100.2 MB in the beginning and 177.8 MB in the end (delta: -77.6 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2019-11-07 01:05:42,263 INFO L168 Benchmark]: Boogie Preprocessor took 47.69 ms. Allocated memory is still 201.9 MB. Free memory was 177.8 MB in the beginning and 175.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-11-07 01:05:42,264 INFO L168 Benchmark]: RCFGBuilder took 675.93 ms. Allocated memory is still 201.9 MB. Free memory was 175.7 MB in the beginning and 140.3 MB in the end (delta: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 7.1 GB. [2019-11-07 01:05:42,265 INFO L168 Benchmark]: TraceAbstraction took 8313.17 ms. Allocated memory was 201.9 MB in the beginning and 446.7 MB in the end (delta: 244.8 MB). Free memory was 140.3 MB in the beginning and 120.1 MB in the end (delta: 20.2 MB). Peak memory consumption was 265.0 MB. Max. memory is 7.1 GB. [2019-11-07 01:05:42,269 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 144.2 MB. Free memory was 119.3 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 519.37 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 100.2 MB in the beginning and 177.8 MB in the end (delta: -77.6 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.69 ms. Allocated memory is still 201.9 MB. Free memory was 177.8 MB in the beginning and 175.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 675.93 ms. Allocated memory is still 201.9 MB. Free memory was 175.7 MB in the beginning and 140.3 MB in the end (delta: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8313.17 ms. Allocated memory was 201.9 MB in the beginning and 446.7 MB in the end (delta: 244.8 MB). Free memory was 140.3 MB in the beginning and 120.1 MB in the end (delta: 20.2 MB). Peak memory consumption was 265.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: at least one of both input predicates is unknown: 67654#true or 68225#(and (<= ~id2~0 127) (= ~mode1~0 1) (= (+ ~p1_new~0 1) 0) (= (+ ~nomsg~0 1) 0) (<= 0 main_~node2____CPAchecker_TMP_0~0) (<= ~send3~0 127) (<= main_~node2____CPAchecker_TMP_0~0 127) (<= ~id3~0 127) (<= 0 ~id3~0) (<= 0 ~id2~0) (= ~st1~0 0) (= (+ ~p3_new~0 1) 0) (= ~st3~0 0) (= ~st2~0 0) (<= 0 ~send3~0)) ([#1{~id2~0 = [0;127]; ~st3~0 = [0;0]; ~mode1~0 = [1;1]; ~p3_new~0 = [-1;-1]; ~p1_new~0 = [-1;-1]; ~st1~0 = [0;0]; ~nomsg~0 = [-1;-1]; ~st2~0 = [0;0]; main_~node2____CPAchecker_TMP_0~0 = [0;127]; ~send3~0 = [0;127]; ~id3~0 = [0;127]; }]) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at least one of both input predicates is unknown: 67654#true or 68225#(and (<= ~id2~0 127) (= ~mode1~0 1) (= (+ ~p1_new~0 1) 0) (= (+ ~nomsg~0 1) 0) (<= 0 main_~node2____CPAchecker_TMP_0~0) (<= ~send3~0 127) (<= main_~node2____CPAchecker_TMP_0~0 127) (<= ~id3~0 127) (<= 0 ~id3~0) (<= 0 ~id2~0) (= ~st1~0 0) (= (+ ~p3_new~0 1) 0) (= ~st3~0 0) (= ~st2~0 0) (<= 0 ~send3~0)) ([#1{~id2~0 = [0;127]; ~st3~0 = [0;0]; ~mode1~0 = [1;1]; ~p3_new~0 = [-1;-1]; ~p1_new~0 = [-1;-1]; ~st1~0 = [0;0]; ~nomsg~0 = [-1;-1]; ~st2~0 = [0;0]; main_~node2____CPAchecker_TMP_0~0 = [0;127]; ~send3~0 = [0;127]; ~id3~0 = [0;127]; }]): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$CoverageRelation.isCovered(PredicateUnifier.java:593) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...