/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:04:06,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:04:06,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:04:06,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:04:06,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:04:06,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:04:06,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:04:06,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:04:06,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:04:06,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:04:06,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:04:06,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:04:06,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:04:06,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:04:06,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:04:06,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:04:06,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:04:06,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:04:06,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:04:06,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:04:06,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:04:06,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:04:06,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:04:06,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:04:06,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:04:06,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:04:06,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:04:06,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:04:06,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:04:06,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:04:06,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:04:06,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:04:06,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:04:06,384 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:04:06,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:04:06,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:04:06,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:04:06,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:04:06,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:04:06,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:04:06,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:04:06,389 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 19:04:06,403 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:04:06,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:04:06,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:04:06,405 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:04:06,405 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:04:06,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:04:06,405 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:04:06,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:04:06,406 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:04:06,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:04:06,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:04:06,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:04:06,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:04:06,407 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:04:06,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:04:06,407 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:04:06,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:04:06,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:04:06,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:04:06,408 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:04:06,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:04:06,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:04:06,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:04:06,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:04:06,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:04:06,409 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:04:06,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:04:06,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:04:06,410 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:04:06,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:04:06,714 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:04:06,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:04:06,719 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:04:06,719 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:04:06,720 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2019-12-18 19:04:06,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/819b5d6aa/a9ecf504468c4e12a4232b796f13b555/FLAG6daaf0332 [2019-12-18 19:04:07,410 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:04:07,411 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2019-12-18 19:04:07,439 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/819b5d6aa/a9ecf504468c4e12a4232b796f13b555/FLAG6daaf0332 [2019-12-18 19:04:07,633 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/819b5d6aa/a9ecf504468c4e12a4232b796f13b555 [2019-12-18 19:04:07,641 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:04:07,643 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:04:07,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:04:07,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:04:07,648 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:04:07,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:04:07" (1/1) ... [2019-12-18 19:04:07,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78dca394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:07, skipping insertion in model container [2019-12-18 19:04:07,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:04:07" (1/1) ... [2019-12-18 19:04:07,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:04:07,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:04:08,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:04:08,291 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:04:08,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:04:08,432 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:04:08,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:08 WrapperNode [2019-12-18 19:04:08,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:04:08,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:04:08,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:04:08,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:04:08,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:08" (1/1) ... [2019-12-18 19:04:08,462 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:08" (1/1) ... [2019-12-18 19:04:08,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:04:08,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:04:08,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:04:08,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:04:08,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:08" (1/1) ... [2019-12-18 19:04:08,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:08" (1/1) ... [2019-12-18 19:04:08,515 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:08" (1/1) ... [2019-12-18 19:04:08,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:08" (1/1) ... [2019-12-18 19:04:08,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:08" (1/1) ... [2019-12-18 19:04:08,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:08" (1/1) ... [2019-12-18 19:04:08,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:08" (1/1) ... [2019-12-18 19:04:08,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:04:08,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:04:08,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:04:08,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:04:08,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:08" (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-18 19:04:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:04:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 19:04:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:04:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:04:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 19:04:08,616 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 19:04:08,616 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 19:04:08,616 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 19:04:08,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 19:04:08,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:04:08,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:04:08,619 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 19:04:09,361 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:04:09,362 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 19:04:09,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:04:09 BoogieIcfgContainer [2019-12-18 19:04:09,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:04:09,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:04:09,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:04:09,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:04:09,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:04:07" (1/3) ... [2019-12-18 19:04:09,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5b129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:04:09, skipping insertion in model container [2019-12-18 19:04:09,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:08" (2/3) ... [2019-12-18 19:04:09,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5b129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:04:09, skipping insertion in model container [2019-12-18 19:04:09,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:04:09" (3/3) ... [2019-12-18 19:04:09,372 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_power.opt.i [2019-12-18 19:04:09,383 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:04:09,383 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:04:09,391 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 19:04:09,392 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:04:09,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,429 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,430 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,441 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,441 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,442 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,442 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,442 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,464 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,464 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,470 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,470 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,470 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:09,487 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 19:04:09,506 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:04:09,506 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:04:09,506 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:04:09,506 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:04:09,506 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:04:09,507 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:04:09,507 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:04:09,507 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:04:09,524 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-18 19:04:09,526 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 19:04:09,635 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 19:04:09,636 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:04:09,649 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 253 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 19:04:09,669 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 19:04:09,707 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 19:04:09,707 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:04:09,714 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 253 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 19:04:09,730 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 19:04:09,731 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:04:12,957 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2019-12-18 19:04:14,058 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-18 19:04:14,342 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-18 19:04:14,463 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47380 [2019-12-18 19:04:14,463 INFO L214 etLargeBlockEncoding]: Total number of compositions: 96 [2019-12-18 19:04:14,466 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-18 19:04:14,937 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8608 states. [2019-12-18 19:04:14,939 INFO L276 IsEmpty]: Start isEmpty. Operand 8608 states. [2019-12-18 19:04:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 19:04:14,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:14,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 19:04:14,948 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:14,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:14,954 INFO L82 PathProgramCache]: Analyzing trace with hash 689103523, now seen corresponding path program 1 times [2019-12-18 19:04:14,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:14,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241195527] [2019-12-18 19:04:14,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:15,183 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-18 19:04:15,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241195527] [2019-12-18 19:04:15,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:15,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:04:15,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739771352] [2019-12-18 19:04:15,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:15,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:15,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:15,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:15,211 INFO L87 Difference]: Start difference. First operand 8608 states. Second operand 3 states. [2019-12-18 19:04:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:15,481 INFO L93 Difference]: Finished difference Result 8560 states and 27962 transitions. [2019-12-18 19:04:15,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:15,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 19:04:15,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:15,605 INFO L225 Difference]: With dead ends: 8560 [2019-12-18 19:04:15,605 INFO L226 Difference]: Without dead ends: 8391 [2019-12-18 19:04:15,607 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-18 19:04:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8391 states. [2019-12-18 19:04:16,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8391 to 8391. [2019-12-18 19:04:16,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8391 states. [2019-12-18 19:04:16,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8391 states to 8391 states and 27442 transitions. [2019-12-18 19:04:16,101 INFO L78 Accepts]: Start accepts. Automaton has 8391 states and 27442 transitions. Word has length 5 [2019-12-18 19:04:16,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:16,102 INFO L462 AbstractCegarLoop]: Abstraction has 8391 states and 27442 transitions. [2019-12-18 19:04:16,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 8391 states and 27442 transitions. [2019-12-18 19:04:16,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 19:04:16,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:16,105 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:16,105 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:16,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:16,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1296433146, now seen corresponding path program 1 times [2019-12-18 19:04:16,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:16,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636812371] [2019-12-18 19:04:16,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:16,203 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-18 19:04:16,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636812371] [2019-12-18 19:04:16,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:16,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:04:16,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747464719] [2019-12-18 19:04:16,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:04:16,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:16,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:04:16,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:04:16,206 INFO L87 Difference]: Start difference. First operand 8391 states and 27442 transitions. Second operand 4 states. [2019-12-18 19:04:16,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:16,683 INFO L93 Difference]: Finished difference Result 13399 states and 41962 transitions. [2019-12-18 19:04:16,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:04:16,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 19:04:16,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:16,761 INFO L225 Difference]: With dead ends: 13399 [2019-12-18 19:04:16,761 INFO L226 Difference]: Without dead ends: 13392 [2019-12-18 19:04:16,762 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-18 19:04:16,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13392 states. [2019-12-18 19:04:17,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13392 to 11787. [2019-12-18 19:04:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11787 states. [2019-12-18 19:04:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11787 states to 11787 states and 37494 transitions. [2019-12-18 19:04:17,746 INFO L78 Accepts]: Start accepts. Automaton has 11787 states and 37494 transitions. Word has length 11 [2019-12-18 19:04:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:17,746 INFO L462 AbstractCegarLoop]: Abstraction has 11787 states and 37494 transitions. [2019-12-18 19:04:17,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:04:17,747 INFO L276 IsEmpty]: Start isEmpty. Operand 11787 states and 37494 transitions. [2019-12-18 19:04:17,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 19:04:17,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:17,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:17,750 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:17,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:17,750 INFO L82 PathProgramCache]: Analyzing trace with hash 825675890, now seen corresponding path program 1 times [2019-12-18 19:04:17,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:17,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388194316] [2019-12-18 19:04:17,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:17,818 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-18 19:04:17,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388194316] [2019-12-18 19:04:17,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:17,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:04:17,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480961705] [2019-12-18 19:04:17,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:04:17,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:17,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:04:17,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:04:17,820 INFO L87 Difference]: Start difference. First operand 11787 states and 37494 transitions. Second operand 4 states. [2019-12-18 19:04:18,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:18,139 INFO L93 Difference]: Finished difference Result 14846 states and 46774 transitions. [2019-12-18 19:04:18,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:04:18,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 19:04:18,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:18,190 INFO L225 Difference]: With dead ends: 14846 [2019-12-18 19:04:18,191 INFO L226 Difference]: Without dead ends: 14846 [2019-12-18 19:04:18,191 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-18 19:04:18,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14846 states. [2019-12-18 19:04:18,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14846 to 13070. [2019-12-18 19:04:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13070 states. [2019-12-18 19:04:18,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13070 states to 13070 states and 41519 transitions. [2019-12-18 19:04:18,713 INFO L78 Accepts]: Start accepts. Automaton has 13070 states and 41519 transitions. Word has length 11 [2019-12-18 19:04:18,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:18,713 INFO L462 AbstractCegarLoop]: Abstraction has 13070 states and 41519 transitions. [2019-12-18 19:04:18,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:04:18,713 INFO L276 IsEmpty]: Start isEmpty. Operand 13070 states and 41519 transitions. [2019-12-18 19:04:18,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:04:18,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:18,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:18,718 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:18,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:18,718 INFO L82 PathProgramCache]: Analyzing trace with hash 727521173, now seen corresponding path program 1 times [2019-12-18 19:04:18,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:18,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067489504] [2019-12-18 19:04:18,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:18,792 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-18 19:04:18,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067489504] [2019-12-18 19:04:18,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:18,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:04:18,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282709135] [2019-12-18 19:04:18,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:04:18,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:18,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:04:18,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:18,798 INFO L87 Difference]: Start difference. First operand 13070 states and 41519 transitions. Second operand 5 states. [2019-12-18 19:04:19,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:19,229 INFO L93 Difference]: Finished difference Result 17840 states and 55421 transitions. [2019-12-18 19:04:19,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:04:19,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 19:04:19,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:19,299 INFO L225 Difference]: With dead ends: 17840 [2019-12-18 19:04:19,299 INFO L226 Difference]: Without dead ends: 17833 [2019-12-18 19:04:19,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:04:19,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17833 states. [2019-12-18 19:04:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17833 to 13112. [2019-12-18 19:04:19,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13112 states. [2019-12-18 19:04:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13112 states to 13112 states and 41511 transitions. [2019-12-18 19:04:19,964 INFO L78 Accepts]: Start accepts. Automaton has 13112 states and 41511 transitions. Word has length 17 [2019-12-18 19:04:19,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:19,965 INFO L462 AbstractCegarLoop]: Abstraction has 13112 states and 41511 transitions. [2019-12-18 19:04:19,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:04:19,965 INFO L276 IsEmpty]: Start isEmpty. Operand 13112 states and 41511 transitions. [2019-12-18 19:04:19,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:04:19,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:19,982 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-18 19:04:19,983 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:19,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:19,983 INFO L82 PathProgramCache]: Analyzing trace with hash -569311522, now seen corresponding path program 1 times [2019-12-18 19:04:19,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:19,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913384247] [2019-12-18 19:04:19,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:04:20,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913384247] [2019-12-18 19:04:20,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:20,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:04:20,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124161924] [2019-12-18 19:04:20,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:20,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:20,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:20,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:20,085 INFO L87 Difference]: Start difference. First operand 13112 states and 41511 transitions. Second operand 3 states. [2019-12-18 19:04:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:20,197 INFO L93 Difference]: Finished difference Result 15933 states and 49812 transitions. [2019-12-18 19:04:20,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:20,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 19:04:20,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:20,244 INFO L225 Difference]: With dead ends: 15933 [2019-12-18 19:04:20,244 INFO L226 Difference]: Without dead ends: 15933 [2019-12-18 19:04:20,244 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-18 19:04:20,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15933 states. [2019-12-18 19:04:21,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15933 to 14126. [2019-12-18 19:04:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14126 states. [2019-12-18 19:04:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14126 states to 14126 states and 44593 transitions. [2019-12-18 19:04:21,485 INFO L78 Accepts]: Start accepts. Automaton has 14126 states and 44593 transitions. Word has length 25 [2019-12-18 19:04:21,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:21,486 INFO L462 AbstractCegarLoop]: Abstraction has 14126 states and 44593 transitions. [2019-12-18 19:04:21,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:21,487 INFO L276 IsEmpty]: Start isEmpty. Operand 14126 states and 44593 transitions. [2019-12-18 19:04:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:04:21,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:21,503 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-18 19:04:21,503 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:21,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:21,504 INFO L82 PathProgramCache]: Analyzing trace with hash -569496623, now seen corresponding path program 1 times [2019-12-18 19:04:21,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:21,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109628971] [2019-12-18 19:04:21,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:21,597 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-18 19:04:21,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109628971] [2019-12-18 19:04:21,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:21,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:04:21,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692119485] [2019-12-18 19:04:21,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:04:21,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:21,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:04:21,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:04:21,599 INFO L87 Difference]: Start difference. First operand 14126 states and 44593 transitions. Second operand 4 states. [2019-12-18 19:04:21,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:21,632 INFO L93 Difference]: Finished difference Result 2310 states and 5267 transitions. [2019-12-18 19:04:21,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:04:21,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 19:04:21,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:21,637 INFO L225 Difference]: With dead ends: 2310 [2019-12-18 19:04:21,637 INFO L226 Difference]: Without dead ends: 2024 [2019-12-18 19:04:21,639 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-18 19:04:21,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2019-12-18 19:04:21,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 2024. [2019-12-18 19:04:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2024 states. [2019-12-18 19:04:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 4476 transitions. [2019-12-18 19:04:21,672 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 4476 transitions. Word has length 25 [2019-12-18 19:04:21,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:21,672 INFO L462 AbstractCegarLoop]: Abstraction has 2024 states and 4476 transitions. [2019-12-18 19:04:21,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:04:21,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 4476 transitions. [2019-12-18 19:04:21,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 19:04:21,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:21,676 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-18 19:04:21,676 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:21,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:21,677 INFO L82 PathProgramCache]: Analyzing trace with hash 355873678, now seen corresponding path program 1 times [2019-12-18 19:04:21,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:21,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035343022] [2019-12-18 19:04:21,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:21,806 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-18 19:04:21,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035343022] [2019-12-18 19:04:21,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:21,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:04:21,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070786465] [2019-12-18 19:04:21,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:04:21,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:21,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:04:21,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:21,808 INFO L87 Difference]: Start difference. First operand 2024 states and 4476 transitions. Second operand 5 states. [2019-12-18 19:04:21,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:21,848 INFO L93 Difference]: Finished difference Result 426 states and 776 transitions. [2019-12-18 19:04:21,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:04:21,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 19:04:21,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:21,850 INFO L225 Difference]: With dead ends: 426 [2019-12-18 19:04:21,851 INFO L226 Difference]: Without dead ends: 380 [2019-12-18 19:04:21,851 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-18 19:04:21,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-12-18 19:04:21,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 345. [2019-12-18 19:04:21,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-18 19:04:21,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 621 transitions. [2019-12-18 19:04:21,865 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 621 transitions. Word has length 37 [2019-12-18 19:04:21,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:21,865 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 621 transitions. [2019-12-18 19:04:21,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:04:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 621 transitions. [2019-12-18 19:04:21,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 19:04:21,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:21,871 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-18 19:04:21,872 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:21,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:21,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1678296005, now seen corresponding path program 1 times [2019-12-18 19:04:21,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:21,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560044254] [2019-12-18 19:04:21,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:22,021 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-18 19:04:22,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560044254] [2019-12-18 19:04:22,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:22,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:04:22,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741086610] [2019-12-18 19:04:22,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:04:22,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:22,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:04:22,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:22,024 INFO L87 Difference]: Start difference. First operand 345 states and 621 transitions. Second operand 5 states. [2019-12-18 19:04:22,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:22,214 INFO L93 Difference]: Finished difference Result 476 states and 857 transitions. [2019-12-18 19:04:22,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:04:22,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 19:04:22,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:22,216 INFO L225 Difference]: With dead ends: 476 [2019-12-18 19:04:22,217 INFO L226 Difference]: Without dead ends: 476 [2019-12-18 19:04:22,218 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-18 19:04:22,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-12-18 19:04:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 435. [2019-12-18 19:04:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-12-18 19:04:22,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 785 transitions. [2019-12-18 19:04:22,227 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 785 transitions. Word has length 52 [2019-12-18 19:04:22,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:22,229 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 785 transitions. [2019-12-18 19:04:22,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:04:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 785 transitions. [2019-12-18 19:04:22,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 19:04:22,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:22,235 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-18 19:04:22,236 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:22,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:22,236 INFO L82 PathProgramCache]: Analyzing trace with hash -856791897, now seen corresponding path program 2 times [2019-12-18 19:04:22,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:22,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073913901] [2019-12-18 19:04:22,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:22,384 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-18 19:04:22,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073913901] [2019-12-18 19:04:22,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:22,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:04:22,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272502066] [2019-12-18 19:04:22,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:04:22,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:22,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:04:22,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:04:22,388 INFO L87 Difference]: Start difference. First operand 435 states and 785 transitions. Second operand 6 states. [2019-12-18 19:04:22,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:22,753 INFO L93 Difference]: Finished difference Result 661 states and 1197 transitions. [2019-12-18 19:04:22,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:04:22,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 19:04:22,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:22,756 INFO L225 Difference]: With dead ends: 661 [2019-12-18 19:04:22,756 INFO L226 Difference]: Without dead ends: 661 [2019-12-18 19:04:22,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:04:22,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-12-18 19:04:22,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 480. [2019-12-18 19:04:22,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-12-18 19:04:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 875 transitions. [2019-12-18 19:04:22,765 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 875 transitions. Word has length 52 [2019-12-18 19:04:22,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:22,766 INFO L462 AbstractCegarLoop]: Abstraction has 480 states and 875 transitions. [2019-12-18 19:04:22,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:04:22,766 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 875 transitions. [2019-12-18 19:04:22,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 19:04:22,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:22,768 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-18 19:04:22,768 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:22,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:22,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1692114105, now seen corresponding path program 3 times [2019-12-18 19:04:22,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:22,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196268020] [2019-12-18 19:04:22,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:22,859 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-18 19:04:22,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196268020] [2019-12-18 19:04:22,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:22,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:04:22,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651311194] [2019-12-18 19:04:22,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:22,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:22,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:22,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:22,861 INFO L87 Difference]: Start difference. First operand 480 states and 875 transitions. Second operand 3 states. [2019-12-18 19:04:22,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:22,874 INFO L93 Difference]: Finished difference Result 435 states and 770 transitions. [2019-12-18 19:04:22,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:22,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 19:04:22,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:22,875 INFO L225 Difference]: With dead ends: 435 [2019-12-18 19:04:22,875 INFO L226 Difference]: Without dead ends: 435 [2019-12-18 19:04:22,876 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-18 19:04:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-12-18 19:04:22,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 423. [2019-12-18 19:04:22,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-12-18 19:04:22,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 748 transitions. [2019-12-18 19:04:22,883 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 748 transitions. Word has length 52 [2019-12-18 19:04:22,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:22,883 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 748 transitions. [2019-12-18 19:04:22,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 748 transitions. [2019-12-18 19:04:22,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 19:04:22,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:22,885 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-18 19:04:22,885 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:22,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:22,886 INFO L82 PathProgramCache]: Analyzing trace with hash -798948617, now seen corresponding path program 1 times [2019-12-18 19:04:22,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:22,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059424129] [2019-12-18 19:04:22,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:22,972 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-18 19:04:22,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059424129] [2019-12-18 19:04:22,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:22,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:04:22,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790971891] [2019-12-18 19:04:22,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:04:22,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:22,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:04:22,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:22,975 INFO L87 Difference]: Start difference. First operand 423 states and 748 transitions. Second operand 5 states. [2019-12-18 19:04:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:23,119 INFO L93 Difference]: Finished difference Result 519 states and 916 transitions. [2019-12-18 19:04:23,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:04:23,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-18 19:04:23,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:23,121 INFO L225 Difference]: With dead ends: 519 [2019-12-18 19:04:23,121 INFO L226 Difference]: Without dead ends: 519 [2019-12-18 19:04:23,121 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-18 19:04:23,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-12-18 19:04:23,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 437. [2019-12-18 19:04:23,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-12-18 19:04:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 774 transitions. [2019-12-18 19:04:23,131 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 774 transitions. Word has length 53 [2019-12-18 19:04:23,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:23,132 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 774 transitions. [2019-12-18 19:04:23,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:04:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 774 transitions. [2019-12-18 19:04:23,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 19:04:23,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:23,134 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-18 19:04:23,134 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:23,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:23,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1548250017, now seen corresponding path program 2 times [2019-12-18 19:04:23,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:23,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784517786] [2019-12-18 19:04:23,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:23,301 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-18 19:04:23,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784517786] [2019-12-18 19:04:23,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:23,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 19:04:23,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256388493] [2019-12-18 19:04:23,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:04:23,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:23,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:04:23,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:04:23,304 INFO L87 Difference]: Start difference. First operand 437 states and 774 transitions. Second operand 8 states. [2019-12-18 19:04:23,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:23,799 INFO L93 Difference]: Finished difference Result 664 states and 1163 transitions. [2019-12-18 19:04:23,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:04:23,800 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-18 19:04:23,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:23,801 INFO L225 Difference]: With dead ends: 664 [2019-12-18 19:04:23,801 INFO L226 Difference]: Without dead ends: 664 [2019-12-18 19:04:23,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:04:23,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-12-18 19:04:23,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 433. [2019-12-18 19:04:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-12-18 19:04:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 763 transitions. [2019-12-18 19:04:23,810 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 763 transitions. Word has length 53 [2019-12-18 19:04:23,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:23,811 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 763 transitions. [2019-12-18 19:04:23,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:04:23,811 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 763 transitions. [2019-12-18 19:04:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 19:04:23,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:23,813 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-18 19:04:23,813 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:23,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:23,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1975941905, now seen corresponding path program 3 times [2019-12-18 19:04:23,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:23,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617952103] [2019-12-18 19:04:23,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:23,890 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-18 19:04:23,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617952103] [2019-12-18 19:04:23,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:23,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:04:23,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134856721] [2019-12-18 19:04:23,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:23,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:23,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:23,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:23,893 INFO L87 Difference]: Start difference. First operand 433 states and 763 transitions. Second operand 3 states. [2019-12-18 19:04:23,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:23,946 INFO L93 Difference]: Finished difference Result 432 states and 761 transitions. [2019-12-18 19:04:23,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:23,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 19:04:23,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:23,947 INFO L225 Difference]: With dead ends: 432 [2019-12-18 19:04:23,947 INFO L226 Difference]: Without dead ends: 432 [2019-12-18 19:04:23,947 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-18 19:04:23,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-18 19:04:23,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 344. [2019-12-18 19:04:23,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-18 19:04:23,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 597 transitions. [2019-12-18 19:04:23,954 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 597 transitions. Word has length 53 [2019-12-18 19:04:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:23,955 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 597 transitions. [2019-12-18 19:04:23,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:23,955 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 597 transitions. [2019-12-18 19:04:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:04:23,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:23,957 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-18 19:04:23,957 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:23,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:23,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1826767497, now seen corresponding path program 1 times [2019-12-18 19:04:23,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:23,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928266165] [2019-12-18 19:04:23,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:24,104 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-18 19:04:24,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928266165] [2019-12-18 19:04:24,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:24,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:04:24,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709625800] [2019-12-18 19:04:24,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:04:24,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:24,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:04:24,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:24,106 INFO L87 Difference]: Start difference. First operand 344 states and 597 transitions. Second operand 5 states. [2019-12-18 19:04:24,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:24,151 INFO L93 Difference]: Finished difference Result 524 states and 906 transitions. [2019-12-18 19:04:24,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:04:24,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-18 19:04:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:24,152 INFO L225 Difference]: With dead ends: 524 [2019-12-18 19:04:24,153 INFO L226 Difference]: Without dead ends: 197 [2019-12-18 19:04:24,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:04:24,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-18 19:04:24,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-12-18 19:04:24,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-12-18 19:04:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 335 transitions. [2019-12-18 19:04:24,157 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 335 transitions. Word has length 54 [2019-12-18 19:04:24,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:24,157 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 335 transitions. [2019-12-18 19:04:24,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:04:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 335 transitions. [2019-12-18 19:04:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:04:24,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:24,158 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-18 19:04:24,158 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:24,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:24,159 INFO L82 PathProgramCache]: Analyzing trace with hash 584180705, now seen corresponding path program 2 times [2019-12-18 19:04:24,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:24,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012109728] [2019-12-18 19:04:24,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:24,447 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-18 19:04:24,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012109728] [2019-12-18 19:04:24,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:24,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:04:24,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375734449] [2019-12-18 19:04:24,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:04:24,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:24,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:04:24,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:04:24,450 INFO L87 Difference]: Start difference. First operand 197 states and 335 transitions. Second operand 14 states. [2019-12-18 19:04:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:25,004 INFO L93 Difference]: Finished difference Result 363 states and 608 transitions. [2019-12-18 19:04:25,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:04:25,008 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-18 19:04:25,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:25,009 INFO L225 Difference]: With dead ends: 363 [2019-12-18 19:04:25,009 INFO L226 Difference]: Without dead ends: 331 [2019-12-18 19:04:25,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:04:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-18 19:04:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 297. [2019-12-18 19:04:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-12-18 19:04:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 506 transitions. [2019-12-18 19:04:25,014 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 506 transitions. Word has length 54 [2019-12-18 19:04:25,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:25,015 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 506 transitions. [2019-12-18 19:04:25,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:04:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 506 transitions. [2019-12-18 19:04:25,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:04:25,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:25,016 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-18 19:04:25,016 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:25,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:25,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1111282689, now seen corresponding path program 3 times [2019-12-18 19:04:25,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:25,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455760593] [2019-12-18 19:04:25,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:25,721 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-18 19:04:25,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455760593] [2019-12-18 19:04:25,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:25,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 19:04:25,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005849293] [2019-12-18 19:04:25,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 19:04:25,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:25,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 19:04:25,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-12-18 19:04:25,724 INFO L87 Difference]: Start difference. First operand 297 states and 506 transitions. Second operand 21 states. [2019-12-18 19:04:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:27,151 INFO L93 Difference]: Finished difference Result 573 states and 954 transitions. [2019-12-18 19:04:27,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 19:04:27,151 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2019-12-18 19:04:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:27,152 INFO L225 Difference]: With dead ends: 573 [2019-12-18 19:04:27,152 INFO L226 Difference]: Without dead ends: 541 [2019-12-18 19:04:27,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 19:04:27,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-12-18 19:04:27,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 311. [2019-12-18 19:04:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-12-18 19:04:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 532 transitions. [2019-12-18 19:04:27,162 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 532 transitions. Word has length 54 [2019-12-18 19:04:27,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:27,163 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 532 transitions. [2019-12-18 19:04:27,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 19:04:27,163 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 532 transitions. [2019-12-18 19:04:27,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:04:27,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:27,164 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-18 19:04:27,164 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:27,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:27,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1090708027, now seen corresponding path program 4 times [2019-12-18 19:04:27,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:27,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771824044] [2019-12-18 19:04:27,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:27,597 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-18 19:04:27,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771824044] [2019-12-18 19:04:27,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:27,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:04:27,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964570269] [2019-12-18 19:04:27,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:04:27,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:27,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:04:27,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:04:27,599 INFO L87 Difference]: Start difference. First operand 311 states and 532 transitions. Second operand 14 states. [2019-12-18 19:04:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:28,084 INFO L93 Difference]: Finished difference Result 413 states and 685 transitions. [2019-12-18 19:04:28,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:04:28,085 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-18 19:04:28,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:28,086 INFO L225 Difference]: With dead ends: 413 [2019-12-18 19:04:28,086 INFO L226 Difference]: Without dead ends: 381 [2019-12-18 19:04:28,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:04:28,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-12-18 19:04:28,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 305. [2019-12-18 19:04:28,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-12-18 19:04:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 520 transitions. [2019-12-18 19:04:28,091 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 520 transitions. Word has length 54 [2019-12-18 19:04:28,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:28,091 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 520 transitions. [2019-12-18 19:04:28,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:04:28,091 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 520 transitions. [2019-12-18 19:04:28,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:04:28,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:28,092 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-18 19:04:28,093 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:28,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:28,093 INFO L82 PathProgramCache]: Analyzing trace with hash -695821945, now seen corresponding path program 5 times [2019-12-18 19:04:28,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:28,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785298687] [2019-12-18 19:04:28,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:04:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:04:28,181 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:04:28,181 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:04:28,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~x$w_buff1_used~0_344) (= v_~x$r_buff0_thd0~0_298 0) (= v_~x$r_buff0_thd1~0_128 0) (= 0 v_~weak$$choice0~0_26) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2475~0.base_19|)) (= 0 |v_ULTIMATE.start_main_~#t2475~0.offset_16|) (= v_~x$r_buff1_thd2~0_87 0) (= v_~x$flush_delayed~0_47 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff1~0_200) (= v_~x$r_buff1_thd0~0_184 0) (= v_~y~0_77 0) (= 0 v_~x$w_buff0_used~0_631) (= v_~x$mem_tmp~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~main$tmp_guard1~0_19 0) (= |v_#NULL.offset_5| 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t2475~0.base_19| 4)) (= 0 v_~x$r_buff0_thd2~0_137) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2475~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2475~0.base_19|) |v_ULTIMATE.start_main_~#t2475~0.offset_16| 0)) |v_#memory_int_17|) (= 0 v_~x~0_143) (= v_~weak$$choice2~0_101 0) (= v_~x$r_buff1_thd1~0_135 0) (= 0 v_~__unbuffered_cnt~0_59) (= 0 v_~x$read_delayed_var~0.offset_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2475~0.base_19|) (= (store .cse0 |v_ULTIMATE.start_main_~#t2475~0.base_19| 1) |v_#valid_40|) (= v_~main$tmp_guard0~0_24 0) (= 0 |v_#NULL.base_5|) (= 0 v_~x$w_buff0~0_255) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_255, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ~x$flush_delayed~0=v_~x$flush_delayed~0_47, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_135, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_31|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_57|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, #length=|v_#length_19|, ULTIMATE.start_main_~#t2476~0.base=|v_ULTIMATE.start_main_~#t2476~0.base_20|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_298, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_30|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_25|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_45|, ~x$w_buff1~0=v_~x$w_buff1~0_200, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_25|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_87, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_38|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~x~0=v_~x~0_143, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_128, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_23|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_29|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_38|, ~x$mem_tmp~0=v_~x$mem_tmp~0_31, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_21|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_40|, ULTIMATE.start_main_~#t2475~0.offset=|v_ULTIMATE.start_main_~#t2475~0.offset_16|, ~y~0=v_~y~0_77, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_45|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_25|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_184, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_27|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_631, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t2476~0.offset=|v_ULTIMATE.start_main_~#t2476~0.offset_16|, ULTIMATE.start_main_~#t2475~0.base=|v_ULTIMATE.start_main_~#t2475~0.base_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_16|, ~weak$$choice2~0=v_~weak$$choice2~0_101, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, #length, ULTIMATE.start_main_~#t2476~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t2475~0.offset, ~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, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2476~0.offset, ULTIMATE.start_main_~#t2475~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 19:04:28,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L777-1-->L779: Formula: (and (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2476~0.base_10| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2476~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2476~0.base_10|) |v_ULTIMATE.start_main_~#t2476~0.offset_9| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t2476~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2476~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t2476~0.offset_9|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2476~0.base_10| 4)) (= (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2476~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t2476~0.offset=|v_ULTIMATE.start_main_~#t2476~0.offset_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2476~0.base=|v_ULTIMATE.start_main_~#t2476~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2476~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2476~0.base] because there is no mapped edge [2019-12-18 19:04:28,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P1ENTRY-->L4-3: Formula: (and (= |P1Thread1of1ForFork1_#in~arg.base_In-1169195211| P1Thread1of1ForFork1_~arg.base_Out-1169195211) (= ~x$w_buff0_used~0_Out-1169195211 1) (= ~x$w_buff0~0_In-1169195211 ~x$w_buff1~0_Out-1169195211) (= ~x$w_buff1_used~0_Out-1169195211 ~x$w_buff0_used~0_In-1169195211) (= |P1Thread1of1ForFork1_#in~arg.offset_In-1169195211| P1Thread1of1ForFork1_~arg.offset_Out-1169195211) (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1169195211| 1) (= (mod ~x$w_buff1_used~0_Out-1169195211 256) 0) (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-1169195211 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1169195211|) (= ~x$w_buff0~0_Out-1169195211 2)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1169195211, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-1169195211|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-1169195211|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1169195211} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-1169195211, ~x$w_buff0~0=~x$w_buff0~0_Out-1169195211, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out-1169195211, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1169195211|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out-1169195211, ~x$w_buff1~0=~x$w_buff1~0_Out-1169195211, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-1169195211|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-1169195211|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1169195211, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1169195211} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 19:04:28,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L726-2-->L726-5: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1363752746 256))) (.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out1363752746| |P0Thread1of1ForFork0_#t~ite4_Out1363752746|)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1363752746 256)))) (or (and (= ~x~0_In1363752746 |P0Thread1of1ForFork0_#t~ite3_Out1363752746|) .cse0 (or .cse1 .cse2)) (and (= ~x$w_buff1~0_In1363752746 |P0Thread1of1ForFork0_#t~ite3_Out1363752746|) (not .cse2) .cse0 (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1363752746, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1363752746, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1363752746, ~x~0=~x~0_In1363752746} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1363752746|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1363752746|, ~x$w_buff1~0=~x$w_buff1~0_In1363752746, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1363752746, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1363752746, ~x~0=~x~0_In1363752746} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 19:04:28,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1012935618 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1012935618 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1012935618|)) (and (= ~x$w_buff0_used~0_In1012935618 |P1Thread1of1ForFork1_#t~ite11_Out1012935618|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1012935618, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1012935618} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1012935618|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1012935618, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1012935618} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 19:04:28,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L727-->L727-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-852758388 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-852758388 256)))) (or (and (= ~x$w_buff0_used~0_In-852758388 |P0Thread1of1ForFork0_#t~ite5_Out-852758388|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-852758388|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-852758388, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-852758388} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-852758388|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-852758388, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-852758388} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 19:04:28,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L728-->L728-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1779124024 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1779124024 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1779124024 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In1779124024 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1779124024|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1779124024 |P0Thread1of1ForFork0_#t~ite6_Out1779124024|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1779124024, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1779124024, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1779124024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1779124024} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1779124024|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1779124024, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1779124024, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1779124024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1779124024} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 19:04:28,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L729-->L729-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1140779355 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1140779355 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_In1140779355 |P0Thread1of1ForFork0_#t~ite7_Out1140779355|)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out1140779355| 0) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1140779355, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1140779355} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1140779355, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1140779355|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1140779355} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 19:04:28,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L730-->L730-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1659367954 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1659367954 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In1659367954 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1659367954 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In1659367954 |P0Thread1of1ForFork0_#t~ite8_Out1659367954|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1659367954|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1659367954, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1659367954, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1659367954, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1659367954} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1659367954, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1659367954|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1659367954, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1659367954, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1659367954} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 19:04:28,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L730-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_79 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_79} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 19:04:28,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-174117544 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-174117544 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-174117544 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-174117544 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-174117544| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite12_Out-174117544| ~x$w_buff1_used~0_In-174117544) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-174117544, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-174117544, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-174117544, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-174117544} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-174117544, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-174117544, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-174117544|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-174117544, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-174117544} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 19:04:28,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L757-->L758: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1166564021 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1166564021 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-1166564021)) (and (= ~x$r_buff0_thd2~0_In-1166564021 ~x$r_buff0_thd2~0_Out-1166564021) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1166564021, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1166564021} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1166564021|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1166564021, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1166564021} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 19:04:28,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1280535328 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1280535328 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1280535328 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1280535328 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out1280535328| ~x$r_buff1_thd2~0_In1280535328)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out1280535328| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1280535328, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1280535328, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1280535328, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1280535328} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1280535328, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1280535328, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1280535328, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1280535328|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1280535328} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 19:04:28,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= v_~x$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite14_30|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 19:04:28,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [585] [585] L783-->L785-2: Formula: (and (or (= (mod v_~x$w_buff0_used~0_91 256) 0) (= (mod v_~x$r_buff0_thd0~0_49 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 19:04:28,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L785-2-->L785-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1988438198 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1988438198 256)))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out1988438198| ~x~0_In1988438198) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite17_Out1988438198| ~x$w_buff1~0_In1988438198) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1988438198, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1988438198, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1988438198, ~x~0=~x~0_In1988438198} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1988438198|, ~x$w_buff1~0=~x$w_buff1~0_In1988438198, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1988438198, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1988438198, ~x~0=~x~0_In1988438198} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 19:04:28,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L785-4-->L786: Formula: (= v_~x~0_39 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-18 19:04:28,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-146562045 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-146562045 256)))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out-146562045| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-146562045 |ULTIMATE.start_main_#t~ite19_Out-146562045|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-146562045, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-146562045} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-146562045, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-146562045|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-146562045} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 19:04:28,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-->L787-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In710931429 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In710931429 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In710931429 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In710931429 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out710931429| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite20_Out710931429| ~x$w_buff1_used~0_In710931429)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In710931429, ~x$w_buff1_used~0=~x$w_buff1_used~0_In710931429, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In710931429, ~x$w_buff0_used~0=~x$w_buff0_used~0_In710931429} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In710931429, ~x$w_buff1_used~0=~x$w_buff1_used~0_In710931429, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out710931429|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In710931429, ~x$w_buff0_used~0=~x$w_buff0_used~0_In710931429} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 19:04:28,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In127040333 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In127040333 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out127040333| ~x$r_buff0_thd0~0_In127040333) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out127040333|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In127040333, ~x$w_buff0_used~0=~x$w_buff0_used~0_In127040333} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In127040333, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out127040333|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In127040333} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 19:04:28,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In188863688 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In188863688 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In188863688 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In188863688 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out188863688| ~x$r_buff1_thd0~0_In188863688) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite22_Out188863688| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In188863688, ~x$w_buff1_used~0=~x$w_buff1_used~0_In188863688, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In188863688, ~x$w_buff0_used~0=~x$w_buff0_used~0_In188863688} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In188863688, ~x$w_buff1_used~0=~x$w_buff1_used~0_In188863688, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In188863688, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out188863688|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In188863688} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 19:04:28,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L800-->L800-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1665313662 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1665313662 256)))) (or (= (mod ~x$w_buff0_used~0_In-1665313662 256) 0) (and .cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1665313662 256))) (and .cse0 (= (mod ~x$w_buff1_used~0_In-1665313662 256) 0)))) (= |ULTIMATE.start_main_#t~ite38_Out-1665313662| |ULTIMATE.start_main_#t~ite37_Out-1665313662|) .cse1 (= |ULTIMATE.start_main_#t~ite37_Out-1665313662| ~x$w_buff1_used~0_In-1665313662)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1665313662| ~x$w_buff1_used~0_In-1665313662) (= |ULTIMATE.start_main_#t~ite37_In-1665313662| |ULTIMATE.start_main_#t~ite37_Out-1665313662|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1665313662, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1665313662, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-1665313662|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1665313662, ~weak$$choice2~0=~weak$$choice2~0_In-1665313662, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1665313662} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1665313662, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1665313662, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1665313662|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1665313662|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1665313662, ~weak$$choice2~0=~weak$$choice2~0_In-1665313662, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1665313662} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 19:04:28,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [590] [590] L801-->L802: Formula: (and (= v_~x$r_buff0_thd0~0_57 v_~x$r_buff0_thd0~0_56) (not (= (mod v_~weak$$choice2~0_21 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 19:04:28,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L804-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= v_~x~0_75 v_~x$mem_tmp~0_14) (= v_~x$flush_delayed~0_25 0) (not (= (mod v_~x$flush_delayed~0_26 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x~0=v_~x~0_75, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 19:04:28,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 19:04:28,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:04:28 BasicIcfg [2019-12-18 19:04:28,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:04:28,271 INFO L168 Benchmark]: Toolchain (without parser) took 20629.12 ms. Allocated memory was 142.6 MB in the beginning and 840.4 MB in the end (delta: 697.8 MB). Free memory was 98.5 MB in the beginning and 413.0 MB in the end (delta: -314.4 MB). Peak memory consumption was 383.4 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:28,272 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 19:04:28,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.66 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 98.3 MB in the beginning and 152.5 MB in the end (delta: -54.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:28,273 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.06 ms. Allocated memory is still 200.3 MB. Free memory was 152.5 MB in the beginning and 149.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:28,274 INFO L168 Benchmark]: Boogie Preprocessor took 36.60 ms. Allocated memory is still 200.3 MB. Free memory was 149.7 MB in the beginning and 147.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:28,275 INFO L168 Benchmark]: RCFGBuilder took 825.39 ms. Allocated memory is still 200.3 MB. Free memory was 147.6 MB in the beginning and 103.3 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:28,275 INFO L168 Benchmark]: TraceAbstraction took 18905.33 ms. Allocated memory was 200.3 MB in the beginning and 840.4 MB in the end (delta: 640.2 MB). Free memory was 103.3 MB in the beginning and 413.0 MB in the end (delta: -309.7 MB). Peak memory consumption was 330.5 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:28,279 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.23 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.66 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 98.3 MB in the beginning and 152.5 MB in the end (delta: -54.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.06 ms. Allocated memory is still 200.3 MB. Free memory was 152.5 MB in the beginning and 149.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.60 ms. Allocated memory is still 200.3 MB. Free memory was 149.7 MB in the beginning and 147.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 825.39 ms. Allocated memory is still 200.3 MB. Free memory was 147.6 MB in the beginning and 103.3 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18905.33 ms. Allocated memory was 200.3 MB in the beginning and 840.4 MB in the end (delta: 640.2 MB). Free memory was 103.3 MB in the beginning and 413.0 MB in the end (delta: -309.7 MB). Peak memory consumption was 330.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 145 ProgramPointsBefore, 79 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 28 ConcurrentYvCompositions, 26 ChoiceCompositions, 3606 VarBasedMoverChecksPositive, 166 VarBasedMoverChecksNegative, 18 SemBasedMoverChecksPositive, 205 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 47380 CheckedPairsTotal, 96 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 2 x$r_buff0_thd2 = (_Bool)1 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 y = 2 [L723] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L726] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L727] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L728] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L729] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L756] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L788] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 x$flush_delayed = weak$$choice2 [L795] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L797] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L798] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L799] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L800] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 18.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1787 SDtfs, 1707 SDslu, 4541 SDs, 0 SdLazy, 3234 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 27 SyntacticMatches, 16 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14126occurred 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: 3.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 10919 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 716 NumberOfCodeBlocks, 716 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 645 ConstructedInterpolants, 0 QuantifiedInterpolants, 129654 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...