/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/podwr001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:36:23,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:36:23,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:36:23,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:36:23,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:36:23,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:36:23,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:36:23,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:36:23,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:36:23,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:36:23,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:36:23,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:36:23,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:36:23,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:36:23,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:36:23,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:36:23,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:36:23,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:36:23,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:36:23,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:36:23,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:36:23,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:36:23,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:36:23,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:36:23,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:36:23,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:36:23,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:36:23,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:36:23,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:36:23,226 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:36:23,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:36:23,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:36:23,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:36:23,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:36:23,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:36:23,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:36:23,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:36:23,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:36:23,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:36:23,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:36:23,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:36:23,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:36:23,261 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:36:23,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:36:23,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:36:23,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:36:23,264 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:36:23,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:36:23,264 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:36:23,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:36:23,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:36:23,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:36:23,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:36:23,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:36:23,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:36:23,267 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:36:23,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:36:23,267 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:36:23,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:36:23,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:36:23,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:36:23,268 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:36:23,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:36:23,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:36:23,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:36:23,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:36:23,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:36:23,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:36:23,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:36:23,270 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:36:23,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:36:23,270 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:36:23,271 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:36:23,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:36:23,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:36:23,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:36:23,573 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:36:23,573 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:36:23,574 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_power.opt.i [2019-12-27 17:36:23,655 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90c1765e0/aed4c067372a422e933d8a22c3cb7c29/FLAG6e7421920 [2019-12-27 17:36:24,277 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:36:24,278 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_power.opt.i [2019-12-27 17:36:24,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90c1765e0/aed4c067372a422e933d8a22c3cb7c29/FLAG6e7421920 [2019-12-27 17:36:24,482 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90c1765e0/aed4c067372a422e933d8a22c3cb7c29 [2019-12-27 17:36:24,494 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:36:24,496 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:36:24,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:36:24,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:36:24,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:36:24,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:36:24" (1/1) ... [2019-12-27 17:36:24,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8a5782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:24, skipping insertion in model container [2019-12-27 17:36:24,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:36:24" (1/1) ... [2019-12-27 17:36:24,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:36:24,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:36:25,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:36:25,126 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:36:25,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:36:25,305 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:36:25,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:25 WrapperNode [2019-12-27 17:36:25,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:36:25,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:36:25,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:36:25,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:36:25,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:25" (1/1) ... [2019-12-27 17:36:25,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:25" (1/1) ... [2019-12-27 17:36:25,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:36:25,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:36:25,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:36:25,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:36:25,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:25" (1/1) ... [2019-12-27 17:36:25,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:25" (1/1) ... [2019-12-27 17:36:25,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:25" (1/1) ... [2019-12-27 17:36:25,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:25" (1/1) ... [2019-12-27 17:36:25,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:25" (1/1) ... [2019-12-27 17:36:25,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:25" (1/1) ... [2019-12-27 17:36:25,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:25" (1/1) ... [2019-12-27 17:36:25,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:36:25,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:36:25,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:36:25,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:36:25,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:25" (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-12-27 17:36:25,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:36:25,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:36:25,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:36:25,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:36:25,479 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:36:25,480 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:36:25,480 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:36:25,480 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:36:25,480 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:36:25,480 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:36:25,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:36:25,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:36:25,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:36:25,483 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:36:26,270 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:36:26,271 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:36:26,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:36:26 BoogieIcfgContainer [2019-12-27 17:36:26,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:36:26,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:36:26,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:36:26,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:36:26,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:36:24" (1/3) ... [2019-12-27 17:36:26,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da1fa3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:36:26, skipping insertion in model container [2019-12-27 17:36:26,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:25" (2/3) ... [2019-12-27 17:36:26,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da1fa3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:36:26, skipping insertion in model container [2019-12-27 17:36:26,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:36:26" (3/3) ... [2019-12-27 17:36:26,282 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr001_power.opt.i [2019-12-27 17:36:26,293 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:36:26,293 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:36:26,301 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:36:26,302 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:36:26,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,346 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,346 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,347 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,347 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,347 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,383 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,383 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,411 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,413 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,423 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,423 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,423 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,425 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,425 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:26,442 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 17:36:26,463 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:36:26,463 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:36:26,464 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:36:26,464 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:36:26,464 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:36:26,464 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:36:26,464 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:36:26,464 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:36:26,482 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 17:36:26,484 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 17:36:26,594 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 17:36:26,594 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:36:26,612 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:36:26,635 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 17:36:26,694 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 17:36:26,694 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:36:26,702 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:36:26,723 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 17:36:26,725 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:36:31,918 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 17:36:32,058 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 17:36:32,641 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-27 17:36:32,642 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 17:36:32,646 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-27 17:36:56,211 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-27 17:36:56,213 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-27 17:36:56,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:36:56,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:36:56,219 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:36:56,220 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:36:56,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:36:56,226 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-27 17:36:56,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:36:56,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575508153] [2019-12-27 17:36:56,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:36:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:36:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:36:56,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575508153] [2019-12-27 17:36:56,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:36:56,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:36:56,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1292437180] [2019-12-27 17:36:56,493 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:36:56,497 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:36:56,506 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:36:56,507 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:36:56,509 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:36:56,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:36:56,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:36:56,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:36:56,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:36:56,523 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-27 17:37:00,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:00,117 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-27 17:37:00,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:37:00,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:37:00,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:01,012 INFO L225 Difference]: With dead ends: 125570 [2019-12-27 17:37:01,012 INFO L226 Difference]: Without dead ends: 111010 [2019-12-27 17:37:01,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-27 17:37:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-27 17:37:10,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-27 17:37:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-27 17:37:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-27 17:37:10,985 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-27 17:37:10,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:10,986 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-27 17:37:10,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:37:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-27 17:37:10,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:37:10,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:10,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:10,990 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:10,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:10,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-27 17:37:10,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:10,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406330420] [2019-12-27 17:37:10,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:11,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406330420] [2019-12-27 17:37:11,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:11,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:37:11,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1145344119] [2019-12-27 17:37:11,124 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:11,125 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:11,128 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:37:11,128 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:11,128 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:37:11,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:37:11,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:11,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:37:11,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:37:11,131 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-27 17:37:16,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:16,428 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-27 17:37:16,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:37:16,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:37:16,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:17,023 INFO L225 Difference]: With dead ends: 172646 [2019-12-27 17:37:17,023 INFO L226 Difference]: Without dead ends: 172548 [2019-12-27 17:37:17,024 INFO L631 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-12-27 17:37:23,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-27 17:37:26,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-27 17:37:26,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-27 17:37:34,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-27 17:37:34,890 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-27 17:37:34,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:34,890 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-27 17:37:34,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:37:34,890 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-27 17:37:34,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:37:34,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:34,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:34,898 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:34,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:34,898 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-27 17:37:34,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:34,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532359105] [2019-12-27 17:37:34,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:34,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532359105] [2019-12-27 17:37:34,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:34,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:37:34,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1281039314] [2019-12-27 17:37:34,978 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:34,979 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:34,982 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 17:37:34,982 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:34,982 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:37:34,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:37:34,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:34,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:37:34,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:37:34,984 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-27 17:37:35,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:35,141 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-27 17:37:35,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:37:35,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 17:37:35,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:35,198 INFO L225 Difference]: With dead ends: 34208 [2019-12-27 17:37:35,198 INFO L226 Difference]: Without dead ends: 34208 [2019-12-27 17:37:35,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 17:37:35,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-27 17:37:35,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-27 17:37:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-27 17:37:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-27 17:37:35,938 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-27 17:37:35,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:35,939 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-27 17:37:35,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:37:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-27 17:37:35,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:37:35,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:35,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:35,943 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:35,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:35,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-27 17:37:35,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:35,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761926801] [2019-12-27 17:37:35,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:36,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:36,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761926801] [2019-12-27 17:37:36,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:36,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:37:36,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [260945276] [2019-12-27 17:37:36,003 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:36,007 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:36,010 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:37:36,010 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:36,011 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:37:36,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:37:36,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:36,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:37:36,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:37:36,012 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-27 17:37:36,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:36,236 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-27 17:37:36,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:37:36,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 17:37:36,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:36,329 INFO L225 Difference]: With dead ends: 51809 [2019-12-27 17:37:36,329 INFO L226 Difference]: Without dead ends: 51809 [2019-12-27 17:37:36,330 INFO L631 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-12-27 17:37:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-27 17:37:37,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-27 17:37:37,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-27 17:37:40,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-27 17:37:40,398 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-27 17:37:40,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:40,399 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-27 17:37:40,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:37:40,399 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-27 17:37:40,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:37:40,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:40,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:40,402 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:40,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:40,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-27 17:37:40,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:40,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989510148] [2019-12-27 17:37:40,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:40,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989510148] [2019-12-27 17:37:40,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:40,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:37:40,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [541651969] [2019-12-27 17:37:40,488 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:40,490 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:40,493 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:37:40,493 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:40,493 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:37:40,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:37:40,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:40,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:37:40,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:37:40,494 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-27 17:37:41,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:41,156 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-27 17:37:41,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:37:41,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 17:37:41,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:41,244 INFO L225 Difference]: With dead ends: 53507 [2019-12-27 17:37:41,245 INFO L226 Difference]: Without dead ends: 53507 [2019-12-27 17:37:41,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:37:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-27 17:37:41,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-27 17:37:41,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-27 17:37:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-27 17:37:42,076 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-27 17:37:42,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:42,076 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-27 17:37:42,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:37:42,076 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-27 17:37:42,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 17:37:42,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:42,089 INFO L411 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] [2019-12-27 17:37:42,090 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:42,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:42,090 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-27 17:37:42,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:42,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266990228] [2019-12-27 17:37:42,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:42,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266990228] [2019-12-27 17:37:42,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:42,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:37:42,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [965851724] [2019-12-27 17:37:42,188 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:42,193 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:42,199 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 17:37:42,199 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:42,241 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:37:42,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:37:42,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:42,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:37:42,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:37:42,242 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 7 states. [2019-12-27 17:37:43,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:43,638 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-27 17:37:43,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:37:43,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 17:37:43,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:43,761 INFO L225 Difference]: With dead ends: 66834 [2019-12-27 17:37:43,761 INFO L226 Difference]: Without dead ends: 66820 [2019-12-27 17:37:43,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:37:44,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-27 17:37:44,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-27 17:37:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-27 17:37:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-27 17:37:44,681 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-27 17:37:44,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:44,681 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-27 17:37:44,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:37:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-27 17:37:44,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:37:44,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:44,700 INFO L411 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] [2019-12-27 17:37:44,700 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:44,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:44,700 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-27 17:37:44,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:44,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067404065] [2019-12-27 17:37:44,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:44,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:44,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067404065] [2019-12-27 17:37:44,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:44,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:37:44,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1180391944] [2019-12-27 17:37:44,776 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:44,780 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:44,791 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 17:37:44,791 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:44,805 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:37:44,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:37:44,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:44,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:37:44,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:37:44,807 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 5 states. [2019-12-27 17:37:44,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:44,911 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-27 17:37:44,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:37:44,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 17:37:44,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:44,943 INFO L225 Difference]: With dead ends: 18127 [2019-12-27 17:37:44,943 INFO L226 Difference]: Without dead ends: 18127 [2019-12-27 17:37:44,944 INFO L631 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-12-27 17:37:45,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-27 17:37:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-27 17:37:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-27 17:37:45,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-27 17:37:45,227 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-27 17:37:45,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:45,227 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-27 17:37:45,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:37:45,227 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-27 17:37:45,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:37:45,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:45,241 INFO L411 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] [2019-12-27 17:37:45,241 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:45,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:45,242 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-27 17:37:45,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:45,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526216064] [2019-12-27 17:37:45,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:45,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526216064] [2019-12-27 17:37:45,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:45,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:37:45,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [303486785] [2019-12-27 17:37:45,329 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:45,333 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:45,465 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:37:45,465 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:45,465 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:37:45,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:37:45,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:45,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:37:45,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:37:45,466 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-27 17:37:46,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:46,153 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-27 17:37:46,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:37:46,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 17:37:46,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:46,218 INFO L225 Difference]: With dead ends: 25206 [2019-12-27 17:37:46,219 INFO L226 Difference]: Without dead ends: 25206 [2019-12-27 17:37:46,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:37:46,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-27 17:37:46,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-27 17:37:46,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-27 17:37:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-27 17:37:46,822 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-27 17:37:46,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:46,822 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-27 17:37:46,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:37:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-27 17:37:46,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:37:46,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:46,854 INFO L411 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] [2019-12-27 17:37:46,855 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:46,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:46,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-27 17:37:46,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:46,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693736607] [2019-12-27 17:37:46,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:46,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:46,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693736607] [2019-12-27 17:37:46,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:46,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:37:46,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [468969840] [2019-12-27 17:37:46,944 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:46,949 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:46,960 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 17:37:46,960 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:46,978 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:37:46,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:37:46,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:46,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:37:46,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:37:46,979 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 8 states. [2019-12-27 17:37:48,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:48,331 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-27 17:37:48,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:37:48,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 17:37:48,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:48,372 INFO L225 Difference]: With dead ends: 28185 [2019-12-27 17:37:48,372 INFO L226 Difference]: Without dead ends: 28185 [2019-12-27 17:37:48,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-12-27 17:37:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-27 17:37:48,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-27 17:37:48,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-27 17:37:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-27 17:37:48,741 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-27 17:37:48,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:48,741 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-27 17:37:48,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:37:48,741 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-27 17:37:48,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 17:37:48,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:48,769 INFO L411 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] [2019-12-27 17:37:48,770 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:48,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:48,770 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-27 17:37:48,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:48,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365993602] [2019-12-27 17:37:48,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:48,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365993602] [2019-12-27 17:37:48,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:48,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:37:48,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1822541596] [2019-12-27 17:37:48,847 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:48,854 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:48,908 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 287 transitions. [2019-12-27 17:37:48,909 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:48,951 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:37:48,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:37:48,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:48,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:37:48,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:37:48,953 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 7 states. [2019-12-27 17:37:49,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:49,101 INFO L93 Difference]: Finished difference Result 18279 states and 57074 transitions. [2019-12-27 17:37:49,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:37:49,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-27 17:37:49,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:49,141 INFO L225 Difference]: With dead ends: 18279 [2019-12-27 17:37:49,141 INFO L226 Difference]: Without dead ends: 18279 [2019-12-27 17:37:49,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:37:49,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18279 states. [2019-12-27 17:37:49,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18279 to 17698. [2019-12-27 17:37:49,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17698 states. [2019-12-27 17:37:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17698 states to 17698 states and 55505 transitions. [2019-12-27 17:37:49,616 INFO L78 Accepts]: Start accepts. Automaton has 17698 states and 55505 transitions. Word has length 39 [2019-12-27 17:37:49,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:49,616 INFO L462 AbstractCegarLoop]: Abstraction has 17698 states and 55505 transitions. [2019-12-27 17:37:49,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:37:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 17698 states and 55505 transitions. [2019-12-27 17:37:49,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:37:49,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:49,641 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:49,641 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:49,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:49,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2116688157, now seen corresponding path program 1 times [2019-12-27 17:37:49,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:49,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359043503] [2019-12-27 17:37:49,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:49,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359043503] [2019-12-27 17:37:49,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:49,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:37:49,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1270532482] [2019-12-27 17:37:49,766 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:49,791 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:49,998 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 313 transitions. [2019-12-27 17:37:49,998 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:50,010 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:37:50,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:37:50,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:50,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:37:50,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:37:50,011 INFO L87 Difference]: Start difference. First operand 17698 states and 55505 transitions. Second operand 7 states. [2019-12-27 17:37:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:50,535 INFO L93 Difference]: Finished difference Result 48537 states and 151835 transitions. [2019-12-27 17:37:50,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:37:50,536 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 17:37:50,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:50,602 INFO L225 Difference]: With dead ends: 48537 [2019-12-27 17:37:50,602 INFO L226 Difference]: Without dead ends: 38006 [2019-12-27 17:37:50,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:37:50,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38006 states. [2019-12-27 17:37:51,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38006 to 21047. [2019-12-27 17:37:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21047 states. [2019-12-27 17:37:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21047 states to 21047 states and 66538 transitions. [2019-12-27 17:37:51,091 INFO L78 Accepts]: Start accepts. Automaton has 21047 states and 66538 transitions. Word has length 64 [2019-12-27 17:37:51,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:51,092 INFO L462 AbstractCegarLoop]: Abstraction has 21047 states and 66538 transitions. [2019-12-27 17:37:51,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:37:51,092 INFO L276 IsEmpty]: Start isEmpty. Operand 21047 states and 66538 transitions. [2019-12-27 17:37:51,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:37:51,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:51,117 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:51,117 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:51,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:51,117 INFO L82 PathProgramCache]: Analyzing trace with hash -978914267, now seen corresponding path program 2 times [2019-12-27 17:37:51,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:51,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52964240] [2019-12-27 17:37:51,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:51,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52964240] [2019-12-27 17:37:51,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:51,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:37:51,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1684848267] [2019-12-27 17:37:51,222 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:51,249 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:51,606 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 326 transitions. [2019-12-27 17:37:51,607 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:51,665 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:37:51,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:37:51,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:51,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:37:51,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:37:51,668 INFO L87 Difference]: Start difference. First operand 21047 states and 66538 transitions. Second operand 10 states. [2019-12-27 17:37:53,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:53,992 INFO L93 Difference]: Finished difference Result 67378 states and 209411 transitions. [2019-12-27 17:37:53,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 17:37:53,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 17:37:53,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:54,098 INFO L225 Difference]: With dead ends: 67378 [2019-12-27 17:37:54,098 INFO L226 Difference]: Without dead ends: 49917 [2019-12-27 17:37:54,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:37:54,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49917 states. [2019-12-27 17:37:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49917 to 24743. [2019-12-27 17:37:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24743 states. [2019-12-27 17:37:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24743 states to 24743 states and 78318 transitions. [2019-12-27 17:37:54,696 INFO L78 Accepts]: Start accepts. Automaton has 24743 states and 78318 transitions. Word has length 64 [2019-12-27 17:37:54,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:54,696 INFO L462 AbstractCegarLoop]: Abstraction has 24743 states and 78318 transitions. [2019-12-27 17:37:54,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:37:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 24743 states and 78318 transitions. [2019-12-27 17:37:54,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:37:54,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:54,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:54,731 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:54,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:54,731 INFO L82 PathProgramCache]: Analyzing trace with hash -423923923, now seen corresponding path program 3 times [2019-12-27 17:37:54,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:54,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702489164] [2019-12-27 17:37:54,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:54,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702489164] [2019-12-27 17:37:54,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:54,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:37:54,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [171263545] [2019-12-27 17:37:54,824 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:54,843 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:55,155 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 267 transitions. [2019-12-27 17:37:55,156 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:55,177 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:37:55,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:37:55,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:55,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:37:55,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:37:55,178 INFO L87 Difference]: Start difference. First operand 24743 states and 78318 transitions. Second operand 9 states. [2019-12-27 17:37:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:56,368 INFO L93 Difference]: Finished difference Result 83473 states and 258770 transitions. [2019-12-27 17:37:56,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 17:37:56,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 17:37:56,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:56,483 INFO L225 Difference]: With dead ends: 83473 [2019-12-27 17:37:56,483 INFO L226 Difference]: Without dead ends: 76594 [2019-12-27 17:37:56,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:37:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76594 states. [2019-12-27 17:37:57,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76594 to 24923. [2019-12-27 17:37:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24923 states. [2019-12-27 17:37:57,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24923 states to 24923 states and 79050 transitions. [2019-12-27 17:37:57,306 INFO L78 Accepts]: Start accepts. Automaton has 24923 states and 79050 transitions. Word has length 64 [2019-12-27 17:37:57,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:57,306 INFO L462 AbstractCegarLoop]: Abstraction has 24923 states and 79050 transitions. [2019-12-27 17:37:57,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:37:57,307 INFO L276 IsEmpty]: Start isEmpty. Operand 24923 states and 79050 transitions. [2019-12-27 17:37:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:37:57,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:57,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:57,351 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:57,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:57,351 INFO L82 PathProgramCache]: Analyzing trace with hash -314768521, now seen corresponding path program 4 times [2019-12-27 17:37:57,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:57,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510833831] [2019-12-27 17:37:57,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:57,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510833831] [2019-12-27 17:37:57,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:57,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:37:57,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [623406042] [2019-12-27 17:37:57,441 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:57,461 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:57,957 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 277 states and 500 transitions. [2019-12-27 17:37:57,957 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:57,973 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:37:57,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:37:57,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:57,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:37:57,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:37:57,974 INFO L87 Difference]: Start difference. First operand 24923 states and 79050 transitions. Second operand 4 states. [2019-12-27 17:37:58,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:58,322 INFO L93 Difference]: Finished difference Result 29331 states and 90024 transitions. [2019-12-27 17:37:58,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:37:58,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 17:37:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:58,366 INFO L225 Difference]: With dead ends: 29331 [2019-12-27 17:37:58,366 INFO L226 Difference]: Without dead ends: 29331 [2019-12-27 17:37:58,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:37:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29331 states. [2019-12-27 17:37:58,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29331 to 19827. [2019-12-27 17:37:58,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19827 states. [2019-12-27 17:37:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19827 states to 19827 states and 61272 transitions. [2019-12-27 17:37:58,742 INFO L78 Accepts]: Start accepts. Automaton has 19827 states and 61272 transitions. Word has length 64 [2019-12-27 17:37:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:58,743 INFO L462 AbstractCegarLoop]: Abstraction has 19827 states and 61272 transitions. [2019-12-27 17:37:58,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:37:58,743 INFO L276 IsEmpty]: Start isEmpty. Operand 19827 states and 61272 transitions. [2019-12-27 17:37:58,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:37:58,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:58,764 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:58,765 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:37:58,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:58,765 INFO L82 PathProgramCache]: Analyzing trace with hash 231413698, now seen corresponding path program 1 times [2019-12-27 17:37:58,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:58,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924081596] [2019-12-27 17:37:58,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:58,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:37:58,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924081596] [2019-12-27 17:37:58,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:58,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:37:58,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1333602315] [2019-12-27 17:37:58,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:58,852 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:59,069 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 318 transitions. [2019-12-27 17:37:59,069 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:59,070 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:37:59,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:37:59,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:59,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:37:59,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:37:59,071 INFO L87 Difference]: Start difference. First operand 19827 states and 61272 transitions. Second operand 3 states. [2019-12-27 17:37:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:59,291 INFO L93 Difference]: Finished difference Result 24197 states and 74265 transitions. [2019-12-27 17:37:59,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:37:59,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 17:37:59,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:59,343 INFO L225 Difference]: With dead ends: 24197 [2019-12-27 17:37:59,343 INFO L226 Difference]: Without dead ends: 24197 [2019-12-27 17:37:59,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:37:59,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24197 states. [2019-12-27 17:37:59,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24197 to 21036. [2019-12-27 17:37:59,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21036 states. [2019-12-27 17:37:59,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21036 states to 21036 states and 65069 transitions. [2019-12-27 17:37:59,978 INFO L78 Accepts]: Start accepts. Automaton has 21036 states and 65069 transitions. Word has length 65 [2019-12-27 17:37:59,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:59,978 INFO L462 AbstractCegarLoop]: Abstraction has 21036 states and 65069 transitions. [2019-12-27 17:37:59,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:37:59,978 INFO L276 IsEmpty]: Start isEmpty. Operand 21036 states and 65069 transitions. [2019-12-27 17:38:00,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:38:00,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:00,181 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:38:00,181 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:38:00,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:00,182 INFO L82 PathProgramCache]: Analyzing trace with hash 198410648, now seen corresponding path program 1 times [2019-12-27 17:38:00,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:00,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159208488] [2019-12-27 17:38:00,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:00,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:38:00,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159208488] [2019-12-27 17:38:00,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:00,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:38:00,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1683895525] [2019-12-27 17:38:00,282 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:00,326 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:00,556 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 289 transitions. [2019-12-27 17:38:00,557 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:00,557 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:38:00,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:38:00,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:00,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:38:00,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:38:00,559 INFO L87 Difference]: Start difference. First operand 21036 states and 65069 transitions. Second operand 4 states. [2019-12-27 17:38:00,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:00,696 INFO L93 Difference]: Finished difference Result 24621 states and 75632 transitions. [2019-12-27 17:38:00,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:38:00,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 17:38:00,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:00,731 INFO L225 Difference]: With dead ends: 24621 [2019-12-27 17:38:00,731 INFO L226 Difference]: Without dead ends: 24621 [2019-12-27 17:38:00,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:38:00,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24621 states. [2019-12-27 17:38:01,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24621 to 21144. [2019-12-27 17:38:01,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21144 states. [2019-12-27 17:38:01,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21144 states to 21144 states and 65300 transitions. [2019-12-27 17:38:01,079 INFO L78 Accepts]: Start accepts. Automaton has 21144 states and 65300 transitions. Word has length 66 [2019-12-27 17:38:01,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:01,079 INFO L462 AbstractCegarLoop]: Abstraction has 21144 states and 65300 transitions. [2019-12-27 17:38:01,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:38:01,079 INFO L276 IsEmpty]: Start isEmpty. Operand 21144 states and 65300 transitions. [2019-12-27 17:38:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:38:01,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:01,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:38:01,103 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:38:01,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:01,103 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-27 17:38:01,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:01,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969593682] [2019-12-27 17:38:01,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:38:01,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969593682] [2019-12-27 17:38:01,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:01,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:38:01,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1714176732] [2019-12-27 17:38:01,288 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:01,308 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:01,472 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 321 transitions. [2019-12-27 17:38:01,472 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:01,609 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:38:01,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:38:01,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:01,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:38:01,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:38:01,611 INFO L87 Difference]: Start difference. First operand 21144 states and 65300 transitions. Second operand 12 states. [2019-12-27 17:38:04,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:04,286 INFO L93 Difference]: Finished difference Result 38488 states and 118451 transitions. [2019-12-27 17:38:04,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 17:38:04,286 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 17:38:04,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:04,332 INFO L225 Difference]: With dead ends: 38488 [2019-12-27 17:38:04,332 INFO L226 Difference]: Without dead ends: 30672 [2019-12-27 17:38:04,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2019-12-27 17:38:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30672 states. [2019-12-27 17:38:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30672 to 21745. [2019-12-27 17:38:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21745 states. [2019-12-27 17:38:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21745 states to 21745 states and 67061 transitions. [2019-12-27 17:38:04,747 INFO L78 Accepts]: Start accepts. Automaton has 21745 states and 67061 transitions. Word has length 66 [2019-12-27 17:38:04,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:04,747 INFO L462 AbstractCegarLoop]: Abstraction has 21745 states and 67061 transitions. [2019-12-27 17:38:04,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:38:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 21745 states and 67061 transitions. [2019-12-27 17:38:04,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:38:04,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:04,774 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:38:04,774 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:38:04,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:04,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1421968206, now seen corresponding path program 2 times [2019-12-27 17:38:04,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:04,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508438872] [2019-12-27 17:38:04,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:04,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:38:04,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508438872] [2019-12-27 17:38:04,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:04,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:38:04,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1188953194] [2019-12-27 17:38:04,958 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:04,977 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:05,191 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 340 transitions. [2019-12-27 17:38:05,192 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:05,332 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 17:38:05,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:38:05,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:05,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:38:05,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:38:05,334 INFO L87 Difference]: Start difference. First operand 21745 states and 67061 transitions. Second operand 13 states. [2019-12-27 17:38:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:08,403 INFO L93 Difference]: Finished difference Result 45951 states and 140703 transitions. [2019-12-27 17:38:08,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 17:38:08,404 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-27 17:38:08,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:08,689 INFO L225 Difference]: With dead ends: 45951 [2019-12-27 17:38:08,689 INFO L226 Difference]: Without dead ends: 39991 [2019-12-27 17:38:08,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2019-12-27 17:38:08,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39991 states. [2019-12-27 17:38:09,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39991 to 22197. [2019-12-27 17:38:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22197 states. [2019-12-27 17:38:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22197 states to 22197 states and 68309 transitions. [2019-12-27 17:38:09,154 INFO L78 Accepts]: Start accepts. Automaton has 22197 states and 68309 transitions. Word has length 66 [2019-12-27 17:38:09,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:09,155 INFO L462 AbstractCegarLoop]: Abstraction has 22197 states and 68309 transitions. [2019-12-27 17:38:09,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:38:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand 22197 states and 68309 transitions. [2019-12-27 17:38:09,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:38:09,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:09,179 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:38:09,179 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:38:09,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:09,179 INFO L82 PathProgramCache]: Analyzing trace with hash 765284024, now seen corresponding path program 3 times [2019-12-27 17:38:09,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:09,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597402505] [2019-12-27 17:38:09,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:38:09,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597402505] [2019-12-27 17:38:09,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:09,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:38:09,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1822396835] [2019-12-27 17:38:09,343 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:09,360 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:09,584 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 301 states and 616 transitions. [2019-12-27 17:38:09,584 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:09,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:38:09,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:38:10,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-27 17:38:10,424 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 17:38:10,426 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 17:38:10,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 17:38:10,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:10,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 17:38:10,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:38:10,428 INFO L87 Difference]: Start difference. First operand 22197 states and 68309 transitions. Second operand 19 states. [2019-12-27 17:38:14,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:14,059 INFO L93 Difference]: Finished difference Result 34983 states and 107283 transitions. [2019-12-27 17:38:14,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 17:38:14,059 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-12-27 17:38:14,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:14,100 INFO L225 Difference]: With dead ends: 34983 [2019-12-27 17:38:14,100 INFO L226 Difference]: Without dead ends: 31500 [2019-12-27 17:38:14,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2019-12-27 17:38:14,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31500 states. [2019-12-27 17:38:14,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31500 to 21765. [2019-12-27 17:38:14,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21765 states. [2019-12-27 17:38:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21765 states to 21765 states and 66977 transitions. [2019-12-27 17:38:14,516 INFO L78 Accepts]: Start accepts. Automaton has 21765 states and 66977 transitions. Word has length 66 [2019-12-27 17:38:14,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:14,516 INFO L462 AbstractCegarLoop]: Abstraction has 21765 states and 66977 transitions. [2019-12-27 17:38:14,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 17:38:14,516 INFO L276 IsEmpty]: Start isEmpty. Operand 21765 states and 66977 transitions. [2019-12-27 17:38:14,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:38:14,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:14,539 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:38:14,540 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:38:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:14,540 INFO L82 PathProgramCache]: Analyzing trace with hash 53330666, now seen corresponding path program 4 times [2019-12-27 17:38:14,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:14,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645616979] [2019-12-27 17:38:14,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:38:14,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645616979] [2019-12-27 17:38:14,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:14,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:38:14,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [492329012] [2019-12-27 17:38:14,698 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:14,713 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:14,922 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 323 transitions. [2019-12-27 17:38:14,923 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:15,112 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:38:15,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:38:15,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:15,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:38:15,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:38:15,113 INFO L87 Difference]: Start difference. First operand 21765 states and 66977 transitions. Second operand 14 states. [2019-12-27 17:38:17,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:17,957 INFO L93 Difference]: Finished difference Result 36536 states and 111333 transitions. [2019-12-27 17:38:17,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 17:38:17,957 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 17:38:17,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:18,001 INFO L225 Difference]: With dead ends: 36536 [2019-12-27 17:38:18,001 INFO L226 Difference]: Without dead ends: 31852 [2019-12-27 17:38:18,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:38:18,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31852 states. [2019-12-27 17:38:18,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31852 to 21989. [2019-12-27 17:38:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21989 states. [2019-12-27 17:38:18,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21989 states to 21989 states and 67561 transitions. [2019-12-27 17:38:18,681 INFO L78 Accepts]: Start accepts. Automaton has 21989 states and 67561 transitions. Word has length 66 [2019-12-27 17:38:18,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:18,682 INFO L462 AbstractCegarLoop]: Abstraction has 21989 states and 67561 transitions. [2019-12-27 17:38:18,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:38:18,682 INFO L276 IsEmpty]: Start isEmpty. Operand 21989 states and 67561 transitions. [2019-12-27 17:38:18,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:38:18,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:18,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:38:18,705 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:38:18,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:18,705 INFO L82 PathProgramCache]: Analyzing trace with hash 791396238, now seen corresponding path program 5 times [2019-12-27 17:38:18,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:18,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820560603] [2019-12-27 17:38:18,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:38:18,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820560603] [2019-12-27 17:38:18,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:18,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:38:18,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [64594255] [2019-12-27 17:38:18,873 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:18,886 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:19,135 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 305 states and 635 transitions. [2019-12-27 17:38:19,135 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:19,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:38:19,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:38:19,425 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 17:38:19,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 17:38:19,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:19,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 17:38:19,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:38:19,426 INFO L87 Difference]: Start difference. First operand 21989 states and 67561 transitions. Second operand 19 states. [2019-12-27 17:38:25,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:25,209 INFO L93 Difference]: Finished difference Result 68522 states and 207755 transitions. [2019-12-27 17:38:25,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-27 17:38:25,210 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-12-27 17:38:25,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:25,293 INFO L225 Difference]: With dead ends: 68522 [2019-12-27 17:38:25,294 INFO L226 Difference]: Without dead ends: 65485 [2019-12-27 17:38:25,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=476, Invalid=2946, Unknown=0, NotChecked=0, Total=3422 [2019-12-27 17:38:25,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65485 states. [2019-12-27 17:38:25,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65485 to 21855. [2019-12-27 17:38:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21855 states. [2019-12-27 17:38:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21855 states to 21855 states and 67213 transitions. [2019-12-27 17:38:25,877 INFO L78 Accepts]: Start accepts. Automaton has 21855 states and 67213 transitions. Word has length 66 [2019-12-27 17:38:25,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:25,877 INFO L462 AbstractCegarLoop]: Abstraction has 21855 states and 67213 transitions. [2019-12-27 17:38:25,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 17:38:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 21855 states and 67213 transitions. [2019-12-27 17:38:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:38:25,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:25,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:38:25,898 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:38:25,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:25,899 INFO L82 PathProgramCache]: Analyzing trace with hash -315236056, now seen corresponding path program 6 times [2019-12-27 17:38:25,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:25,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498624460] [2019-12-27 17:38:25,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:26,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:38:26,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498624460] [2019-12-27 17:38:26,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:26,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:38:26,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [491930121] [2019-12-27 17:38:26,076 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:26,094 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:26,301 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 276 states and 559 transitions. [2019-12-27 17:38:26,301 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:26,512 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 17:38:26,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 17:38:26,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:26,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 17:38:26,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-12-27 17:38:26,513 INFO L87 Difference]: Start difference. First operand 21855 states and 67213 transitions. Second operand 17 states. [2019-12-27 17:38:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:32,056 INFO L93 Difference]: Finished difference Result 54892 states and 162263 transitions. [2019-12-27 17:38:32,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-27 17:38:32,056 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-27 17:38:32,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:32,125 INFO L225 Difference]: With dead ends: 54892 [2019-12-27 17:38:32,125 INFO L226 Difference]: Without dead ends: 54572 [2019-12-27 17:38:32,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=655, Invalid=3767, Unknown=0, NotChecked=0, Total=4422 [2019-12-27 17:38:32,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54572 states. [2019-12-27 17:38:32,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54572 to 26564. [2019-12-27 17:38:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26564 states. [2019-12-27 17:38:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26564 states to 26564 states and 81182 transitions. [2019-12-27 17:38:32,727 INFO L78 Accepts]: Start accepts. Automaton has 26564 states and 81182 transitions. Word has length 66 [2019-12-27 17:38:32,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:32,727 INFO L462 AbstractCegarLoop]: Abstraction has 26564 states and 81182 transitions. [2019-12-27 17:38:32,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 17:38:32,727 INFO L276 IsEmpty]: Start isEmpty. Operand 26564 states and 81182 transitions. [2019-12-27 17:38:32,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:38:32,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:32,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:38:32,756 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:38:32,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:32,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1354348786, now seen corresponding path program 7 times [2019-12-27 17:38:32,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:32,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240267642] [2019-12-27 17:38:32,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:32,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:38:32,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240267642] [2019-12-27 17:38:32,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:32,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:38:32,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [183143674] [2019-12-27 17:38:32,825 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:32,838 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:33,181 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 297 states and 608 transitions. [2019-12-27 17:38:33,182 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:33,183 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:38:33,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:38:33,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:33,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:38:33,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:38:33,185 INFO L87 Difference]: Start difference. First operand 26564 states and 81182 transitions. Second operand 3 states. [2019-12-27 17:38:33,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:33,325 INFO L93 Difference]: Finished difference Result 26564 states and 81181 transitions. [2019-12-27 17:38:33,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:38:33,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 17:38:33,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:33,376 INFO L225 Difference]: With dead ends: 26564 [2019-12-27 17:38:33,376 INFO L226 Difference]: Without dead ends: 26564 [2019-12-27 17:38:33,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:38:33,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26564 states. [2019-12-27 17:38:34,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26564 to 22211. [2019-12-27 17:38:34,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22211 states. [2019-12-27 17:38:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22211 states to 22211 states and 68660 transitions. [2019-12-27 17:38:34,083 INFO L78 Accepts]: Start accepts. Automaton has 22211 states and 68660 transitions. Word has length 66 [2019-12-27 17:38:34,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:34,083 INFO L462 AbstractCegarLoop]: Abstraction has 22211 states and 68660 transitions. [2019-12-27 17:38:34,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:38:34,084 INFO L276 IsEmpty]: Start isEmpty. Operand 22211 states and 68660 transitions. [2019-12-27 17:38:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:38:34,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:34,108 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:38:34,108 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:38:34,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:34,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1857250972, now seen corresponding path program 1 times [2019-12-27 17:38:34,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:34,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587735979] [2019-12-27 17:38:34,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:38:34,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587735979] [2019-12-27 17:38:34,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:34,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 17:38:34,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [279232141] [2019-12-27 17:38:34,604 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:34,613 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:34,823 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 277 states and 560 transitions. [2019-12-27 17:38:34,823 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:35,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:38:35,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:38:35,640 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 17:38:35,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 17:38:35,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:35,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 17:38:35,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1067, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 17:38:35,641 INFO L87 Difference]: Start difference. First operand 22211 states and 68660 transitions. Second operand 35 states. [2019-12-27 17:38:41,476 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-27 17:39:15,208 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-12-27 17:39:27,482 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2019-12-27 17:39:54,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:39:54,428 INFO L93 Difference]: Finished difference Result 148926 states and 440732 transitions. [2019-12-27 17:39:54,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 508 states. [2019-12-27 17:39:54,428 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-12-27 17:39:54,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:39:54,535 INFO L225 Difference]: With dead ends: 148926 [2019-12-27 17:39:54,535 INFO L226 Difference]: Without dead ends: 85147 [2019-12-27 17:39:54,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 90 SyntacticMatches, 21 SemanticMatches, 516 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120654 ImplicationChecksByTransitivity, 32.0s TimeCoverageRelationStatistics Valid=22082, Invalid=245724, Unknown=0, NotChecked=0, Total=267806 [2019-12-27 17:39:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85147 states. [2019-12-27 17:39:55,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85147 to 30328. [2019-12-27 17:39:55,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30328 states. [2019-12-27 17:39:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30328 states to 30328 states and 91624 transitions. [2019-12-27 17:39:55,438 INFO L78 Accepts]: Start accepts. Automaton has 30328 states and 91624 transitions. Word has length 67 [2019-12-27 17:39:55,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:39:55,438 INFO L462 AbstractCegarLoop]: Abstraction has 30328 states and 91624 transitions. [2019-12-27 17:39:55,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-27 17:39:55,439 INFO L276 IsEmpty]: Start isEmpty. Operand 30328 states and 91624 transitions. [2019-12-27 17:39:55,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:39:55,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:39:55,480 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:39:55,480 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:39:55,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:39:55,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1823504856, now seen corresponding path program 2 times [2019-12-27 17:39:55,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:39:55,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239132526] [2019-12-27 17:39:55,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:39:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:39:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:39:55,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239132526] [2019-12-27 17:39:55,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:39:55,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:39:55,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [501698392] [2019-12-27 17:39:55,685 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:39:55,699 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:39:56,068 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 303 states and 621 transitions. [2019-12-27 17:39:56,069 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:39:56,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:39:56,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:39:56,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:39:56,922 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 17:39:56,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 17:39:56,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:39:56,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 17:39:56,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-12-27 17:39:56,923 INFO L87 Difference]: Start difference. First operand 30328 states and 91624 transitions. Second operand 21 states. [2019-12-27 17:40:03,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:03,518 INFO L93 Difference]: Finished difference Result 48986 states and 145518 transitions. [2019-12-27 17:40:03,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 17:40:03,519 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-27 17:40:03,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:03,585 INFO L225 Difference]: With dead ends: 48986 [2019-12-27 17:40:03,586 INFO L226 Difference]: Without dead ends: 43902 [2019-12-27 17:40:03,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=279, Invalid=1443, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 17:40:03,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43902 states. [2019-12-27 17:40:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43902 to 29912. [2019-12-27 17:40:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29912 states. [2019-12-27 17:40:04,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29912 states to 29912 states and 90430 transitions. [2019-12-27 17:40:04,169 INFO L78 Accepts]: Start accepts. Automaton has 29912 states and 90430 transitions. Word has length 67 [2019-12-27 17:40:04,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:04,170 INFO L462 AbstractCegarLoop]: Abstraction has 29912 states and 90430 transitions. [2019-12-27 17:40:04,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 17:40:04,170 INFO L276 IsEmpty]: Start isEmpty. Operand 29912 states and 90430 transitions. [2019-12-27 17:40:04,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:40:04,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:04,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:04,201 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:04,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:04,201 INFO L82 PathProgramCache]: Analyzing trace with hash -715209700, now seen corresponding path program 3 times [2019-12-27 17:40:04,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:04,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797388001] [2019-12-27 17:40:04,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:40:04,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797388001] [2019-12-27 17:40:04,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:04,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:40:04,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1871892122] [2019-12-27 17:40:04,386 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:04,396 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:04,837 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 295 states and 607 transitions. [2019-12-27 17:40:04,837 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:05,027 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 17:40:05,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 17:40:05,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:05,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 17:40:05,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:40:05,028 INFO L87 Difference]: Start difference. First operand 29912 states and 90430 transitions. Second operand 18 states. Received shutdown request... [2019-12-27 17:40:07,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 17:40:07,631 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 17:40:07,635 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 17:40:07,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:40:07 BasicIcfg [2019-12-27 17:40:07,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:40:07,637 INFO L168 Benchmark]: Toolchain (without parser) took 223141.50 ms. Allocated memory was 138.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.1 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 17:40:07,638 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 17:40:07,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.02 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.9 MB in the beginning and 156.5 MB in the end (delta: -54.6 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-12-27 17:40:07,639 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.70 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:40:07,639 INFO L168 Benchmark]: Boogie Preprocessor took 49.30 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:40:07,640 INFO L168 Benchmark]: RCFGBuilder took 852.41 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 101.2 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:40:07,640 INFO L168 Benchmark]: TraceAbstraction took 221361.63 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.2 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 17:40:07,643 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.17 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 806.02 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.9 MB in the beginning and 156.5 MB in the end (delta: -54.6 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.70 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.30 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 852.41 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 101.2 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 221361.63 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.2 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (29912states) and FLOYD_HOARE automaton (currently 47 states, 18 states before enhancement),while ReachableStatesComputation was computing reachable states (3512 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (29912states) and FLOYD_HOARE automaton (currently 47 states, 18 states before enhancement),while ReachableStatesComputation was computing reachable states (3512 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: TIMEOUT, OverallTime: 221.1s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 133.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8089 SDtfs, 14439 SDslu, 46282 SDs, 0 SdLazy, 73899 SolverSat, 1688 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 65.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1234 GetRequests, 222 SyntacticMatches, 58 SemanticMatches, 954 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124252 ImplicationChecksByTransitivity, 41.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158936occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 44.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 373250 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1255 NumberOfCodeBlocks, 1255 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1229 ConstructedInterpolants, 0 QuantifiedInterpolants, 279851 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown