/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:41:00,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:41:00,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:41:00,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:41:00,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:41:00,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:41:00,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:41:00,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:41:00,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:41:00,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:41:00,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:41:00,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:41:00,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:41:00,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:41:00,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:41:00,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:41:00,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:41:00,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:41:00,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:41:00,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:41:00,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:41:00,344 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:41:00,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:41:00,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:41:00,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:41:00,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:41:00,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:41:00,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:41:00,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:41:00,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:41:00,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:41:00,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:41:00,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:41:00,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:41:00,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:41:00,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:41:00,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:41:00,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:41:00,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:41:00,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:41:00,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:41:00,359 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:41:00,373 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:41:00,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:41:00,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:41:00,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:41:00,375 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:41:00,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:41:00,375 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:41:00,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:41:00,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:41:00,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:41:00,376 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:41:00,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:41:00,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:41:00,376 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:41:00,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:41:00,377 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:41:00,377 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:41:00,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:41:00,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:41:00,378 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:41:00,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:41:00,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:41:00,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:41:00,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:41:00,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:41:00,379 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:41:00,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:41:00,379 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:41:00,379 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:41:00,380 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:41:00,672 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:41:00,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:41:00,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:41:00,693 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:41:00,694 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:41:00,695 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.opt.i [2019-12-26 23:41:00,759 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38d9dafe3/56c2cdd222884dbe9e5f7d9c05150edc/FLAG1bef5aad4 [2019-12-26 23:41:01,322 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:41:01,323 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_pso.opt.i [2019-12-26 23:41:01,343 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38d9dafe3/56c2cdd222884dbe9e5f7d9c05150edc/FLAG1bef5aad4 [2019-12-26 23:41:01,567 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38d9dafe3/56c2cdd222884dbe9e5f7d9c05150edc [2019-12-26 23:41:01,580 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:41:01,582 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:41:01,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:41:01,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:41:01,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:41:01,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:41:01" (1/1) ... [2019-12-26 23:41:01,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e50f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:01, skipping insertion in model container [2019-12-26 23:41:01,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:41:01" (1/1) ... [2019-12-26 23:41:01,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:41:01,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:41:02,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:41:02,181 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:41:02,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:41:02,320 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:41:02,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:02 WrapperNode [2019-12-26 23:41:02,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:41:02,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:41:02,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:41:02,322 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:41:02,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:02" (1/1) ... [2019-12-26 23:41:02,352 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:02" (1/1) ... [2019-12-26 23:41:02,396 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:41:02,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:41:02,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:41:02,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:41:02,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:02" (1/1) ... [2019-12-26 23:41:02,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:02" (1/1) ... [2019-12-26 23:41:02,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:02" (1/1) ... [2019-12-26 23:41:02,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:02" (1/1) ... [2019-12-26 23:41:02,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:02" (1/1) ... [2019-12-26 23:41:02,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:02" (1/1) ... [2019-12-26 23:41:02,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:02" (1/1) ... [2019-12-26 23:41:02,434 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:41:02,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:41:02,435 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:41:02,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:41:02,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:02" (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-26 23:41:02,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:41:02,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:41:02,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:41:02,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:41:02,511 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:41:02,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:41:02,511 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:41:02,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:41:02,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:41:02,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:41:02,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:41:02,514 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:41:03,241 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:41:03,241 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:41:03,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:41:03 BoogieIcfgContainer [2019-12-26 23:41:03,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:41:03,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:41:03,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:41:03,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:41:03,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:41:01" (1/3) ... [2019-12-26 23:41:03,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432bc1e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:41:03, skipping insertion in model container [2019-12-26 23:41:03,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:02" (2/3) ... [2019-12-26 23:41:03,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432bc1e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:41:03, skipping insertion in model container [2019-12-26 23:41:03,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:41:03" (3/3) ... [2019-12-26 23:41:03,252 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_pso.opt.i [2019-12-26 23:41:03,263 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:41:03,264 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:41:03,272 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:41:03,273 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:41:03,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,309 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,309 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,310 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,310 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,311 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,319 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,319 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,334 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,335 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,335 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,340 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,341 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:03,359 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:41:03,385 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:41:03,385 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:41:03,385 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:41:03,386 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:41:03,386 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:41:03,386 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:41:03,386 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:41:03,386 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:41:03,413 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-26 23:41:03,415 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-26 23:41:03,570 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-26 23:41:03,571 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:41:03,588 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:41:03,601 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-26 23:41:03,663 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-26 23:41:03,663 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:41:03,668 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:41:03,681 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-26 23:41:03,682 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:41:08,609 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-26 23:41:08,735 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46090 [2019-12-26 23:41:08,736 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-26 23:41:08,740 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 91 transitions [2019-12-26 23:41:09,351 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8654 states. [2019-12-26 23:41:09,353 INFO L276 IsEmpty]: Start isEmpty. Operand 8654 states. [2019-12-26 23:41:09,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:41:09,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:09,360 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:41:09,361 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:09,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:09,367 INFO L82 PathProgramCache]: Analyzing trace with hash 722891, now seen corresponding path program 1 times [2019-12-26 23:41:09,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:09,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489342078] [2019-12-26 23:41:09,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:09,613 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-26 23:41:09,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489342078] [2019-12-26 23:41:09,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:09,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:41:09,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577231690] [2019-12-26 23:41:09,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:41:09,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:09,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:41:09,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:41:09,635 INFO L87 Difference]: Start difference. First operand 8654 states. Second operand 3 states. [2019-12-26 23:41:09,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:09,888 INFO L93 Difference]: Finished difference Result 8604 states and 28108 transitions. [2019-12-26 23:41:09,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:41:09,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:41:09,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:09,977 INFO L225 Difference]: With dead ends: 8604 [2019-12-26 23:41:09,977 INFO L226 Difference]: Without dead ends: 8436 [2019-12-26 23:41:09,978 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-26 23:41:10,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8436 states. [2019-12-26 23:41:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8436 to 8436. [2019-12-26 23:41:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8436 states. [2019-12-26 23:41:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 27590 transitions. [2019-12-26 23:41:10,504 INFO L78 Accepts]: Start accepts. Automaton has 8436 states and 27590 transitions. Word has length 3 [2019-12-26 23:41:10,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:10,504 INFO L462 AbstractCegarLoop]: Abstraction has 8436 states and 27590 transitions. [2019-12-26 23:41:10,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:41:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 8436 states and 27590 transitions. [2019-12-26 23:41:10,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:41:10,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:10,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:41:10,508 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:10,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:10,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1596153002, now seen corresponding path program 1 times [2019-12-26 23:41:10,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:10,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619028280] [2019-12-26 23:41:10,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:10,613 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-26 23:41:10,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619028280] [2019-12-26 23:41:10,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:10,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:41:10,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430950706] [2019-12-26 23:41:10,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:41:10,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:10,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:41:10,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:41:10,617 INFO L87 Difference]: Start difference. First operand 8436 states and 27590 transitions. Second operand 4 states. [2019-12-26 23:41:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:10,988 INFO L93 Difference]: Finished difference Result 13130 states and 41153 transitions. [2019-12-26 23:41:10,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:41:10,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:41:10,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:11,064 INFO L225 Difference]: With dead ends: 13130 [2019-12-26 23:41:11,064 INFO L226 Difference]: Without dead ends: 13123 [2019-12-26 23:41:11,065 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-26 23:41:11,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13123 states. [2019-12-26 23:41:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13123 to 11988. [2019-12-26 23:41:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11988 states. [2019-12-26 23:41:12,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11988 states to 11988 states and 38075 transitions. [2019-12-26 23:41:12,177 INFO L78 Accepts]: Start accepts. Automaton has 11988 states and 38075 transitions. Word has length 11 [2019-12-26 23:41:12,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:12,177 INFO L462 AbstractCegarLoop]: Abstraction has 11988 states and 38075 transitions. [2019-12-26 23:41:12,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:41:12,178 INFO L276 IsEmpty]: Start isEmpty. Operand 11988 states and 38075 transitions. [2019-12-26 23:41:12,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:41:12,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:12,181 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:41:12,181 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:12,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:12,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1194917716, now seen corresponding path program 1 times [2019-12-26 23:41:12,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:12,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859410855] [2019-12-26 23:41:12,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:12,253 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-26 23:41:12,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859410855] [2019-12-26 23:41:12,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:12,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:41:12,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639899968] [2019-12-26 23:41:12,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:41:12,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:12,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:41:12,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:41:12,256 INFO L87 Difference]: Start difference. First operand 11988 states and 38075 transitions. Second operand 4 states. [2019-12-26 23:41:12,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:12,509 INFO L93 Difference]: Finished difference Result 14736 states and 46267 transitions. [2019-12-26 23:41:12,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:41:12,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:41:12,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:12,561 INFO L225 Difference]: With dead ends: 14736 [2019-12-26 23:41:12,561 INFO L226 Difference]: Without dead ends: 14736 [2019-12-26 23:41:12,561 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-26 23:41:12,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14736 states. [2019-12-26 23:41:12,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14736 to 13160. [2019-12-26 23:41:12,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13160 states. [2019-12-26 23:41:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13160 states to 13160 states and 41689 transitions. [2019-12-26 23:41:13,002 INFO L78 Accepts]: Start accepts. Automaton has 13160 states and 41689 transitions. Word has length 11 [2019-12-26 23:41:13,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:13,002 INFO L462 AbstractCegarLoop]: Abstraction has 13160 states and 41689 transitions. [2019-12-26 23:41:13,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:41:13,002 INFO L276 IsEmpty]: Start isEmpty. Operand 13160 states and 41689 transitions. [2019-12-26 23:41:13,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 23:41:13,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:13,009 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:41:13,009 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:13,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:13,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1502155024, now seen corresponding path program 1 times [2019-12-26 23:41:13,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:13,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602190772] [2019-12-26 23:41:13,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:13,169 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-26 23:41:13,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602190772] [2019-12-26 23:41:13,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:13,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:41:13,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808469522] [2019-12-26 23:41:13,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:41:13,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:13,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:41:13,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:41:13,177 INFO L87 Difference]: Start difference. First operand 13160 states and 41689 transitions. Second operand 5 states. [2019-12-26 23:41:13,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:13,764 INFO L93 Difference]: Finished difference Result 17572 states and 54523 transitions. [2019-12-26 23:41:13,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:41:13,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-26 23:41:13,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:13,817 INFO L225 Difference]: With dead ends: 17572 [2019-12-26 23:41:13,818 INFO L226 Difference]: Without dead ends: 17565 [2019-12-26 23:41:13,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:41:13,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17565 states. [2019-12-26 23:41:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17565 to 13105. [2019-12-26 23:41:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13105 states. [2019-12-26 23:41:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13105 states to 13105 states and 41426 transitions. [2019-12-26 23:41:14,200 INFO L78 Accepts]: Start accepts. Automaton has 13105 states and 41426 transitions. Word has length 17 [2019-12-26 23:41:14,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:14,200 INFO L462 AbstractCegarLoop]: Abstraction has 13105 states and 41426 transitions. [2019-12-26 23:41:14,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:41:14,200 INFO L276 IsEmpty]: Start isEmpty. Operand 13105 states and 41426 transitions. [2019-12-26 23:41:14,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:41:14,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:14,216 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-26 23:41:14,216 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:14,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:14,216 INFO L82 PathProgramCache]: Analyzing trace with hash 933350131, now seen corresponding path program 1 times [2019-12-26 23:41:14,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:14,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858670052] [2019-12-26 23:41:14,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:14,296 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-26 23:41:14,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858670052] [2019-12-26 23:41:14,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:14,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:41:14,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547263283] [2019-12-26 23:41:14,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:41:14,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:14,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:41:14,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:41:14,299 INFO L87 Difference]: Start difference. First operand 13105 states and 41426 transitions. Second operand 3 states. [2019-12-26 23:41:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:14,489 INFO L93 Difference]: Finished difference Result 16057 states and 50095 transitions. [2019-12-26 23:41:14,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:41:14,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-26 23:41:14,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:14,530 INFO L225 Difference]: With dead ends: 16057 [2019-12-26 23:41:14,531 INFO L226 Difference]: Without dead ends: 16057 [2019-12-26 23:41:14,531 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-26 23:41:14,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16057 states. [2019-12-26 23:41:14,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16057 to 14186. [2019-12-26 23:41:14,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14186 states. [2019-12-26 23:41:14,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14186 states to 14186 states and 44710 transitions. [2019-12-26 23:41:14,958 INFO L78 Accepts]: Start accepts. Automaton has 14186 states and 44710 transitions. Word has length 25 [2019-12-26 23:41:14,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:14,960 INFO L462 AbstractCegarLoop]: Abstraction has 14186 states and 44710 transitions. [2019-12-26 23:41:14,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:41:14,960 INFO L276 IsEmpty]: Start isEmpty. Operand 14186 states and 44710 transitions. [2019-12-26 23:41:14,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:41:14,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:14,975 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-26 23:41:14,975 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:14,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:14,976 INFO L82 PathProgramCache]: Analyzing trace with hash 933194542, now seen corresponding path program 1 times [2019-12-26 23:41:14,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:14,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115080569] [2019-12-26 23:41:14,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:15,067 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-26 23:41:15,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115080569] [2019-12-26 23:41:15,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:15,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:41:15,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645387587] [2019-12-26 23:41:15,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:41:15,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:15,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:41:15,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:41:15,070 INFO L87 Difference]: Start difference. First operand 14186 states and 44710 transitions. Second operand 4 states. [2019-12-26 23:41:15,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:15,113 INFO L93 Difference]: Finished difference Result 2296 states and 5226 transitions. [2019-12-26 23:41:15,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:41:15,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:41:15,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:15,117 INFO L225 Difference]: With dead ends: 2296 [2019-12-26 23:41:15,118 INFO L226 Difference]: Without dead ends: 2019 [2019-12-26 23:41:15,118 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-26 23:41:15,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2019-12-26 23:41:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 2019. [2019-12-26 23:41:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2019-12-26 23:41:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 4460 transitions. [2019-12-26 23:41:15,152 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 4460 transitions. Word has length 25 [2019-12-26 23:41:15,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:15,153 INFO L462 AbstractCegarLoop]: Abstraction has 2019 states and 4460 transitions. [2019-12-26 23:41:15,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:41:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 4460 transitions. [2019-12-26 23:41:15,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 23:41:15,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:15,157 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] [2019-12-26 23:41:15,158 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:15,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:15,158 INFO L82 PathProgramCache]: Analyzing trace with hash -568804126, now seen corresponding path program 1 times [2019-12-26 23:41:15,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:15,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604229028] [2019-12-26 23:41:15,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:15,256 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-26 23:41:15,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604229028] [2019-12-26 23:41:15,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:15,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:41:15,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487734872] [2019-12-26 23:41:15,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:41:15,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:15,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:41:15,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:41:15,258 INFO L87 Difference]: Start difference. First operand 2019 states and 4460 transitions. Second operand 5 states. [2019-12-26 23:41:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:15,301 INFO L93 Difference]: Finished difference Result 416 states and 758 transitions. [2019-12-26 23:41:15,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:41:15,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-26 23:41:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:15,303 INFO L225 Difference]: With dead ends: 416 [2019-12-26 23:41:15,303 INFO L226 Difference]: Without dead ends: 371 [2019-12-26 23:41:15,303 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-26 23:41:15,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-26 23:41:15,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 343. [2019-12-26 23:41:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-26 23:41:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 618 transitions. [2019-12-26 23:41:15,309 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 618 transitions. Word has length 37 [2019-12-26 23:41:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:15,310 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 618 transitions. [2019-12-26 23:41:15,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:41:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 618 transitions. [2019-12-26 23:41:15,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:41:15,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:15,312 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] [2019-12-26 23:41:15,312 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:15,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:15,313 INFO L82 PathProgramCache]: Analyzing trace with hash -506418728, now seen corresponding path program 1 times [2019-12-26 23:41:15,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:15,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575753505] [2019-12-26 23:41:15,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:15,391 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-26 23:41:15,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575753505] [2019-12-26 23:41:15,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:15,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:41:15,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179432116] [2019-12-26 23:41:15,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:41:15,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:15,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:41:15,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:41:15,394 INFO L87 Difference]: Start difference. First operand 343 states and 618 transitions. Second operand 3 states. [2019-12-26 23:41:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:15,406 INFO L93 Difference]: Finished difference Result 331 states and 582 transitions. [2019-12-26 23:41:15,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:41:15,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 23:41:15,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:15,408 INFO L225 Difference]: With dead ends: 331 [2019-12-26 23:41:15,408 INFO L226 Difference]: Without dead ends: 331 [2019-12-26 23:41:15,408 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-26 23:41:15,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-26 23:41:15,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2019-12-26 23:41:15,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-12-26 23:41:15,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 582 transitions. [2019-12-26 23:41:15,413 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 582 transitions. Word has length 52 [2019-12-26 23:41:15,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:15,415 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 582 transitions. [2019-12-26 23:41:15,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:41:15,416 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 582 transitions. [2019-12-26 23:41:15,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 23:41:15,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:15,417 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] [2019-12-26 23:41:15,417 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:15,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:15,418 INFO L82 PathProgramCache]: Analyzing trace with hash -156128935, now seen corresponding path program 1 times [2019-12-26 23:41:15,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:15,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516463589] [2019-12-26 23:41:15,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:15,520 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-26 23:41:15,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516463589] [2019-12-26 23:41:15,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:15,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:41:15,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336048330] [2019-12-26 23:41:15,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:41:15,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:15,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:41:15,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:41:15,522 INFO L87 Difference]: Start difference. First operand 331 states and 582 transitions. Second operand 5 states. [2019-12-26 23:41:15,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:15,699 INFO L93 Difference]: Finished difference Result 487 states and 864 transitions. [2019-12-26 23:41:15,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:41:15,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-26 23:41:15,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:15,701 INFO L225 Difference]: With dead ends: 487 [2019-12-26 23:41:15,701 INFO L226 Difference]: Without dead ends: 487 [2019-12-26 23:41:15,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:41:15,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-12-26 23:41:15,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 422. [2019-12-26 23:41:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-12-26 23:41:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 748 transitions. [2019-12-26 23:41:15,708 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 748 transitions. Word has length 53 [2019-12-26 23:41:15,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:15,708 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 748 transitions. [2019-12-26 23:41:15,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:41:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 748 transitions. [2019-12-26 23:41:15,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 23:41:15,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:15,710 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] [2019-12-26 23:41:15,710 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:15,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:15,711 INFO L82 PathProgramCache]: Analyzing trace with hash -2022513439, now seen corresponding path program 2 times [2019-12-26 23:41:15,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:15,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856142364] [2019-12-26 23:41:15,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:15,850 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-26 23:41:15,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856142364] [2019-12-26 23:41:15,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:15,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:41:15,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778054848] [2019-12-26 23:41:15,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:41:15,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:15,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:41:15,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:41:15,852 INFO L87 Difference]: Start difference. First operand 422 states and 748 transitions. Second operand 5 states. [2019-12-26 23:41:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:16,022 INFO L93 Difference]: Finished difference Result 511 states and 903 transitions. [2019-12-26 23:41:16,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:41:16,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-26 23:41:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:16,023 INFO L225 Difference]: With dead ends: 511 [2019-12-26 23:41:16,023 INFO L226 Difference]: Without dead ends: 511 [2019-12-26 23:41:16,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:41:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-12-26 23:41:16,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 429. [2019-12-26 23:41:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-26 23:41:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 761 transitions. [2019-12-26 23:41:16,030 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 761 transitions. Word has length 53 [2019-12-26 23:41:16,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:16,031 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 761 transitions. [2019-12-26 23:41:16,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:41:16,031 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 761 transitions. [2019-12-26 23:41:16,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 23:41:16,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:16,033 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] [2019-12-26 23:41:16,033 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:16,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:16,033 INFO L82 PathProgramCache]: Analyzing trace with hash -681731879, now seen corresponding path program 3 times [2019-12-26 23:41:16,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:16,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555538337] [2019-12-26 23:41:16,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:16,139 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-26 23:41:16,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555538337] [2019-12-26 23:41:16,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:16,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:41:16,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618142144] [2019-12-26 23:41:16,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:41:16,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:16,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:41:16,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:41:16,142 INFO L87 Difference]: Start difference. First operand 429 states and 761 transitions. Second operand 6 states. [2019-12-26 23:41:16,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:16,222 INFO L93 Difference]: Finished difference Result 687 states and 1216 transitions. [2019-12-26 23:41:16,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:41:16,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-26 23:41:16,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:16,223 INFO L225 Difference]: With dead ends: 687 [2019-12-26 23:41:16,223 INFO L226 Difference]: Without dead ends: 309 [2019-12-26 23:41:16,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:41:16,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-12-26 23:41:16,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2019-12-26 23:41:16,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-12-26 23:41:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 552 transitions. [2019-12-26 23:41:16,229 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 552 transitions. Word has length 53 [2019-12-26 23:41:16,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:16,229 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 552 transitions. [2019-12-26 23:41:16,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:41:16,229 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 552 transitions. [2019-12-26 23:41:16,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 23:41:16,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:16,230 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] [2019-12-26 23:41:16,231 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:16,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:16,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1828454951, now seen corresponding path program 4 times [2019-12-26 23:41:16,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:16,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108543421] [2019-12-26 23:41:16,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:16,432 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-26 23:41:16,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108543421] [2019-12-26 23:41:16,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:16,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:41:16,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032514404] [2019-12-26 23:41:16,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:41:16,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:16,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:41:16,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:41:16,435 INFO L87 Difference]: Start difference. First operand 309 states and 552 transitions. Second operand 9 states. [2019-12-26 23:41:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:16,912 INFO L93 Difference]: Finished difference Result 396 states and 665 transitions. [2019-12-26 23:41:16,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:41:16,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-26 23:41:16,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:16,913 INFO L225 Difference]: With dead ends: 396 [2019-12-26 23:41:16,913 INFO L226 Difference]: Without dead ends: 396 [2019-12-26 23:41:16,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:41:16,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-12-26 23:41:16,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 249. [2019-12-26 23:41:16,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-12-26 23:41:16,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 421 transitions. [2019-12-26 23:41:16,917 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 421 transitions. Word has length 53 [2019-12-26 23:41:16,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:16,917 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 421 transitions. [2019-12-26 23:41:16,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:41:16,917 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 421 transitions. [2019-12-26 23:41:16,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 23:41:16,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:16,918 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] [2019-12-26 23:41:16,918 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:16,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:16,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1114856101, now seen corresponding path program 5 times [2019-12-26 23:41:16,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:16,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873838013] [2019-12-26 23:41:16,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:16,976 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-26 23:41:16,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873838013] [2019-12-26 23:41:16,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:16,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:41:16,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429485217] [2019-12-26 23:41:16,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:41:16,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:16,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:41:16,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:41:16,978 INFO L87 Difference]: Start difference. First operand 249 states and 421 transitions. Second operand 3 states. [2019-12-26 23:41:17,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:17,015 INFO L93 Difference]: Finished difference Result 249 states and 420 transitions. [2019-12-26 23:41:17,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:41:17,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-26 23:41:17,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:17,016 INFO L225 Difference]: With dead ends: 249 [2019-12-26 23:41:17,016 INFO L226 Difference]: Without dead ends: 249 [2019-12-26 23:41:17,016 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-26 23:41:17,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-12-26 23:41:17,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 206. [2019-12-26 23:41:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-12-26 23:41:17,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2019-12-26 23:41:17,020 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 53 [2019-12-26 23:41:17,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:17,020 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2019-12-26 23:41:17,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:41:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2019-12-26 23:41:17,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:41:17,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:17,021 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] [2019-12-26 23:41:17,022 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:17,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:17,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1034362442, now seen corresponding path program 1 times [2019-12-26 23:41:17,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:17,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904809797] [2019-12-26 23:41:17,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:17,257 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-26 23:41:17,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904809797] [2019-12-26 23:41:17,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:17,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:41:17,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190309871] [2019-12-26 23:41:17,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 23:41:17,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:17,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 23:41:17,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:41:17,260 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 13 states. [2019-12-26 23:41:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:17,661 INFO L93 Difference]: Finished difference Result 373 states and 621 transitions. [2019-12-26 23:41:17,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 23:41:17,662 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-26 23:41:17,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:17,663 INFO L225 Difference]: With dead ends: 373 [2019-12-26 23:41:17,663 INFO L226 Difference]: Without dead ends: 340 [2019-12-26 23:41:17,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:41:17,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-12-26 23:41:17,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 306. [2019-12-26 23:41:17,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-12-26 23:41:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 518 transitions. [2019-12-26 23:41:17,669 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 518 transitions. Word has length 54 [2019-12-26 23:41:17,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:17,669 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 518 transitions. [2019-12-26 23:41:17,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 23:41:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 518 transitions. [2019-12-26 23:41:17,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:41:17,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:17,671 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] [2019-12-26 23:41:17,671 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:17,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:17,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1326135034, now seen corresponding path program 2 times [2019-12-26 23:41:17,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:17,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39306986] [2019-12-26 23:41:17,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:18,405 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-26 23:41:18,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39306986] [2019-12-26 23:41:18,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:18,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-26 23:41:18,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800600715] [2019-12-26 23:41:18,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-26 23:41:18,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:18,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-26 23:41:18,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:41:18,408 INFO L87 Difference]: Start difference. First operand 306 states and 518 transitions. Second operand 20 states. [2019-12-26 23:41:19,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:19,673 INFO L93 Difference]: Finished difference Result 572 states and 950 transitions. [2019-12-26 23:41:19,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 23:41:19,674 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-12-26 23:41:19,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:19,675 INFO L225 Difference]: With dead ends: 572 [2019-12-26 23:41:19,675 INFO L226 Difference]: Without dead ends: 539 [2019-12-26 23:41:19,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=191, Invalid=865, Unknown=0, NotChecked=0, Total=1056 [2019-12-26 23:41:19,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-12-26 23:41:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 320. [2019-12-26 23:41:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-26 23:41:19,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 544 transitions. [2019-12-26 23:41:19,681 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 544 transitions. Word has length 54 [2019-12-26 23:41:19,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:19,682 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 544 transitions. [2019-12-26 23:41:19,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-26 23:41:19,682 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 544 transitions. [2019-12-26 23:41:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:41:19,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:19,686 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] [2019-12-26 23:41:19,686 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:19,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:19,687 INFO L82 PathProgramCache]: Analyzing trace with hash -778167690, now seen corresponding path program 3 times [2019-12-26 23:41:19,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:19,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962526000] [2019-12-26 23:41:19,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:20,103 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-26 23:41:20,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962526000] [2019-12-26 23:41:20,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:20,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-26 23:41:20,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175976654] [2019-12-26 23:41:20,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 23:41:20,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:20,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 23:41:20,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:41:20,106 INFO L87 Difference]: Start difference. First operand 320 states and 544 transitions. Second operand 17 states. [2019-12-26 23:41:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:21,165 INFO L93 Difference]: Finished difference Result 563 states and 938 transitions. [2019-12-26 23:41:21,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 23:41:21,165 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-12-26 23:41:21,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:21,167 INFO L225 Difference]: With dead ends: 563 [2019-12-26 23:41:21,167 INFO L226 Difference]: Without dead ends: 530 [2019-12-26 23:41:21,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2019-12-26 23:41:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-12-26 23:41:21,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 318. [2019-12-26 23:41:21,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-12-26 23:41:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 540 transitions. [2019-12-26 23:41:21,176 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 540 transitions. Word has length 54 [2019-12-26 23:41:21,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:21,176 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 540 transitions. [2019-12-26 23:41:21,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 23:41:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 540 transitions. [2019-12-26 23:41:21,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:41:21,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:21,178 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] [2019-12-26 23:41:21,178 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:21,178 INFO L82 PathProgramCache]: Analyzing trace with hash 202960694, now seen corresponding path program 4 times [2019-12-26 23:41:21,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:21,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897499495] [2019-12-26 23:41:21,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:21,418 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-26 23:41:21,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897499495] [2019-12-26 23:41:21,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:21,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:41:21,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031522159] [2019-12-26 23:41:21,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:41:21,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:21,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:41:21,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:41:21,421 INFO L87 Difference]: Start difference. First operand 318 states and 540 transitions. Second operand 12 states. [2019-12-26 23:41:21,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:21,817 INFO L93 Difference]: Finished difference Result 423 states and 697 transitions. [2019-12-26 23:41:21,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 23:41:21,818 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-26 23:41:21,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:21,819 INFO L225 Difference]: With dead ends: 423 [2019-12-26 23:41:21,819 INFO L226 Difference]: Without dead ends: 388 [2019-12-26 23:41:21,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-12-26 23:41:21,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-12-26 23:41:21,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 314. [2019-12-26 23:41:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-12-26 23:41:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 532 transitions. [2019-12-26 23:41:21,824 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 532 transitions. Word has length 54 [2019-12-26 23:41:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:21,824 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 532 transitions. [2019-12-26 23:41:21,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:41:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 532 transitions. [2019-12-26 23:41:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:41:21,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:21,825 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] [2019-12-26 23:41:21,825 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:21,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:21,826 INFO L82 PathProgramCache]: Analyzing trace with hash -91775718, now seen corresponding path program 5 times [2019-12-26 23:41:21,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:21,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124628617] [2019-12-26 23:41:21,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:41:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:41:21,923 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:41:21,923 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:41:21,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$r_buff1_thd0~0_329 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2015~0.base_24| 4)) (= v_~y$w_buff0_used~0_834 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2015~0.base_24|) 0) (= 0 v_~__unbuffered_cnt~0_61) (= 0 v_~weak$$choice0~0_14) (= v_~y$r_buff1_thd1~0_200 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2015~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2015~0.base_24|) |v_ULTIMATE.start_main_~#t2015~0.offset_19| 0)) |v_#memory_int_11|) (= 0 v_~x~0_147) (= |v_#NULL.offset_3| 0) (= |v_ULTIMATE.start_main_~#t2015~0.offset_19| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2015~0.base_24|) (= v_~main$tmp_guard1~0_27 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= 0 v_~y$r_buff1_thd2~0_208) (= 0 v_~y$r_buff0_thd2~0_162) (= v_~y$mem_tmp~0_19 0) (= v_~weak$$choice2~0_141 0) (= v_~y$w_buff1_used~0_547 0) (= v_~y$r_buff0_thd1~0_297 0) (= 0 v_~y$flush_delayed~0_36) (= v_~main$tmp_guard0~0_33 0) (= 0 |v_#NULL.base_3|) (= 0 v_~y$w_buff0~0_485) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff0_thd0~0_416 0) (= v_~y~0_146 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2015~0.base_24| 1)) (< 0 |v_#StackHeapBarrier_13|) (= v_~y$w_buff1~0_308 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_41|, ULTIMATE.start_main_~#t2016~0.offset=|v_ULTIMATE.start_main_~#t2016~0.offset_16|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_145|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_297, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, #length=|v_#length_13|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_36|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_38|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_21|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_41|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_44|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_38|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_308, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_162, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_~#t2016~0.base=|v_ULTIMATE.start_main_~#t2016~0.base_19|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_329, ~x~0=v_~x~0_147, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_834, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_33|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_200, ULTIMATE.start_main_~#t2015~0.base=|v_ULTIMATE.start_main_~#t2015~0.base_24|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ULTIMATE.start_main_~#t2015~0.offset=|v_ULTIMATE.start_main_~#t2015~0.offset_19|, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y~0=v_~y~0_146, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_35|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_40|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_208, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_416, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_14|, ~weak$$choice2~0=v_~weak$$choice2~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2016~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2016~0.base, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t2015~0.base, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t2015~0.offset, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:41:21,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L779-1-->L781: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2016~0.base_11|) 0) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2016~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2016~0.base_11|) |v_ULTIMATE.start_main_~#t2016~0.offset_10| 1)) |v_#memory_int_7|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2016~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2016~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2016~0.base_11|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2016~0.base_11| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2016~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2016~0.offset=|v_ULTIMATE.start_main_~#t2016~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2016~0.base=|v_ULTIMATE.start_main_~#t2016~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2016~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2016~0.base] because there is no mapped edge [2019-12-26 23:41:21,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1~0_121 v_~y$w_buff0~0_204) (= 2 v_~y$w_buff0~0_203) (= v_P0Thread1of1ForFork0_~arg.base_96 |v_P0Thread1of1ForFork0_#in~arg.base_96|) (= 0 (mod v_~y$w_buff1_used~0_210 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|) (= v_P0Thread1of1ForFork0_~arg.offset_96 |v_P0Thread1of1ForFork0_#in~arg.offset_96|) (= v_~y$w_buff0_used~0_350 v_~y$w_buff1_used~0_210) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_100 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|) (= v_~y$w_buff0_used~0_349 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_350, ~y$w_buff0~0=v_~y$w_buff0~0_204, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_349, ~y$w_buff1~0=v_~y$w_buff1~0_121, ~y$w_buff0~0=v_~y$w_buff0~0_203, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_100, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_96, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_96, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_210} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:41:21,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L756-2-->L756-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1161399998 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1161399998 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-1161399998| ~y~0_In-1161399998)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-1161399998| ~y$w_buff1~0_In-1161399998)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1161399998, ~y$w_buff1~0=~y$w_buff1~0_In-1161399998, ~y~0=~y~0_In-1161399998, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1161399998} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1161399998, ~y$w_buff1~0=~y$w_buff1~0_In-1161399998, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1161399998|, ~y~0=~y~0_In-1161399998, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1161399998} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-26 23:41:21,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L756-4-->L757: Formula: (= v_~y~0_41 |v_P1Thread1of1ForFork1_#t~ite9_10|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_10|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_9|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_15|, ~y~0=v_~y~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-26 23:41:21,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In570552776 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In570552776 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In570552776 |P1Thread1of1ForFork1_#t~ite11_Out570552776|)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out570552776| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In570552776, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In570552776} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In570552776, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In570552776, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out570552776|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:41:21,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In498128541 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In498128541 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In498128541 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In498128541 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite12_Out498128541| ~y$w_buff1_used~0_In498128541)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out498128541| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In498128541, ~y$w_buff0_used~0=~y$w_buff0_used~0_In498128541, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In498128541, ~y$w_buff1_used~0=~y$w_buff1_used~0_In498128541} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In498128541, ~y$w_buff0_used~0=~y$w_buff0_used~0_In498128541, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In498128541, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out498128541|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In498128541} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:41:21,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L759-->L759-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-766089661 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-766089661 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-766089661| ~y$r_buff0_thd2~0_In-766089661) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-766089661| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-766089661, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-766089661} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-766089661, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-766089661, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-766089661|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-26 23:41:21,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L760-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In214800990 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In214800990 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In214800990 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In214800990 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out214800990| ~y$r_buff1_thd2~0_In214800990) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out214800990|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In214800990, ~y$w_buff0_used~0=~y$w_buff0_used~0_In214800990, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In214800990, ~y$w_buff1_used~0=~y$w_buff1_used~0_In214800990} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In214800990, ~y$w_buff0_used~0=~y$w_buff0_used~0_In214800990, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In214800990, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out214800990|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In214800990} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:41:21,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~y$r_buff1_thd2~0_91) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_91, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:41:21,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In930796558 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In930796558 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out930796558| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out930796558| ~y$w_buff0_used~0_In930796558) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In930796558, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In930796558} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out930796558|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In930796558, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In930796558} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:41:21,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L738-->L738-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In-591177076 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-591177076 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-591177076 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-591177076 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-591177076|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-591177076 |P0Thread1of1ForFork0_#t~ite6_Out-591177076|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-591177076, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-591177076, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-591177076, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-591177076} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-591177076|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-591177076, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-591177076, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-591177076, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-591177076} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:41:21,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L739-->L740: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1909093746 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1909093746 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out1909093746)) (and (= ~y$r_buff0_thd1~0_In1909093746 ~y$r_buff0_thd1~0_Out1909093746) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1909093746, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1909093746} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1909093746, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1909093746|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1909093746} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:41:21,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-907760829 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-907760829 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-907760829 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-907760829 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-907760829| ~y$r_buff1_thd1~0_In-907760829) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out-907760829| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-907760829, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-907760829, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-907760829, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-907760829} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-907760829, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-907760829, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-907760829|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-907760829, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-907760829} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:41:21,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L740-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:41:21,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [577] [577] L785-->L787-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$w_buff0_used~0_67 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_44 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:41:21,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-2-->L787-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1408910594 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1408910594 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite18_Out1408910594| |ULTIMATE.start_main_#t~ite17_Out1408910594|))) (or (and (= ~y~0_In1408910594 |ULTIMATE.start_main_#t~ite17_Out1408910594|) (or .cse0 .cse1) .cse2) (and (not .cse0) (= ~y$w_buff1~0_In1408910594 |ULTIMATE.start_main_#t~ite17_Out1408910594|) (not .cse1) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1408910594, ~y~0=~y~0_In1408910594, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1408910594, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1408910594} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1408910594|, ~y$w_buff1~0=~y$w_buff1~0_In1408910594, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1408910594|, ~y~0=~y~0_In1408910594, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1408910594, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1408910594} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-26 23:41:21,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2095444268 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2095444268 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-2095444268 |ULTIMATE.start_main_#t~ite19_Out-2095444268|)) (and (= 0 |ULTIMATE.start_main_#t~ite19_Out-2095444268|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2095444268, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2095444268} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2095444268, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-2095444268|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2095444268} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-26 23:41:21,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In1136117667 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1136117667 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1136117667 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1136117667 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out1136117667| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite20_Out1136117667| ~y$w_buff1_used~0_In1136117667) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1136117667, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1136117667, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1136117667, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1136117667} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1136117667, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1136117667, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1136117667|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1136117667, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1136117667} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 23:41:21,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1360740081 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1360740081 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-1360740081|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1360740081 |ULTIMATE.start_main_#t~ite21_Out-1360740081|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1360740081, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1360740081} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1360740081, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1360740081, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1360740081|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 23:41:21,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L791-->L791-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-1960925397 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1960925397 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1960925397 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1960925397 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-1960925397| ~y$r_buff1_thd0~0_In-1960925397) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite22_Out-1960925397| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1960925397, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1960925397, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1960925397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1960925397} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1960925397, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1960925397, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1960925397, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1960925397|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1960925397} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 23:41:21,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L800-->L800-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In640946529 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite31_Out640946529| ~y$w_buff1~0_In640946529) (= |ULTIMATE.start_main_#t~ite32_Out640946529| |ULTIMATE.start_main_#t~ite31_Out640946529|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In640946529 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In640946529 256))) (= 0 (mod ~y$w_buff0_used~0_In640946529 256)) (and (= (mod ~y$r_buff1_thd0~0_In640946529 256) 0) .cse1)))) (and (= |ULTIMATE.start_main_#t~ite31_In640946529| |ULTIMATE.start_main_#t~ite31_Out640946529|) (= |ULTIMATE.start_main_#t~ite32_Out640946529| ~y$w_buff1~0_In640946529) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In640946529, ~y$w_buff0_used~0=~y$w_buff0_used~0_In640946529, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In640946529, ~weak$$choice2~0=~weak$$choice2~0_In640946529, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In640946529|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In640946529, ~y$w_buff1_used~0=~y$w_buff1_used~0_In640946529} OutVars{~y$w_buff1~0=~y$w_buff1~0_In640946529, ~y$w_buff0_used~0=~y$w_buff0_used~0_In640946529, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In640946529, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out640946529|, ~weak$$choice2~0=~weak$$choice2~0_In640946529, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out640946529|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In640946529, ~y$w_buff1_used~0=~y$w_buff1_used~0_In640946529} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-26 23:41:21,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L803-->L804: Formula: (and (= v_~y$r_buff0_thd0~0_162 v_~y$r_buff0_thd0~0_163) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_162, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-26 23:41:21,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L806-->L809-1: Formula: (and (= 0 v_~y$flush_delayed~0_24) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_12 256)) (not (= 0 (mod v_~y$flush_delayed~0_25 256))) (= v_~y~0_106 v_~y$mem_tmp~0_13)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_106, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_22|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:41:21,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:41:22,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:41:22 BasicIcfg [2019-12-26 23:41:22,040 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:41:22,041 INFO L168 Benchmark]: Toolchain (without parser) took 20460.31 ms. Allocated memory was 144.7 MB in the beginning and 747.1 MB in the end (delta: 602.4 MB). Free memory was 100.3 MB in the beginning and 543.0 MB in the end (delta: -442.6 MB). Peak memory consumption was 159.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:41:22,046 INFO L168 Benchmark]: CDTParser took 0.74 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 23:41:22,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.89 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.9 MB in the beginning and 156.6 MB in the end (delta: -56.7 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:41:22,048 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.36 ms. Allocated memory is still 201.9 MB. Free memory was 156.6 MB in the beginning and 153.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:41:22,048 INFO L168 Benchmark]: Boogie Preprocessor took 37.18 ms. Allocated memory is still 201.9 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:41:22,051 INFO L168 Benchmark]: RCFGBuilder took 808.66 ms. Allocated memory is still 201.9 MB. Free memory was 151.2 MB in the beginning and 107.7 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:41:22,052 INFO L168 Benchmark]: TraceAbstraction took 18795.34 ms. Allocated memory was 201.9 MB in the beginning and 747.1 MB in the end (delta: 545.3 MB). Free memory was 107.0 MB in the beginning and 543.0 MB in the end (delta: -435.9 MB). Peak memory consumption was 109.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:41:22,057 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.74 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 732.89 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.9 MB in the beginning and 156.6 MB in the end (delta: -56.7 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.36 ms. Allocated memory is still 201.9 MB. Free memory was 156.6 MB in the beginning and 153.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.18 ms. Allocated memory is still 201.9 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 808.66 ms. Allocated memory is still 201.9 MB. Free memory was 151.2 MB in the beginning and 107.7 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18795.34 ms. Allocated memory was 201.9 MB in the beginning and 747.1 MB in the end (delta: 545.3 MB). Free memory was 107.0 MB in the beginning and 543.0 MB in the end (delta: -435.9 MB). Peak memory consumption was 109.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 146 ProgramPointsBefore, 79 ProgramPointsAfterwards, 180 TransitionsBefore, 91 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 3678 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 69 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 46090 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t2015, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2016, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 18.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1741 SDtfs, 1568 SDslu, 5062 SDs, 0 SdLazy, 3706 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 21 SyntacticMatches, 18 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14186occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 9946 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 716 NumberOfCodeBlocks, 716 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 645 ConstructedInterpolants, 0 QuantifiedInterpolants, 141394 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 proved your program to be incorrect! Received shutdown request...