/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:36:09,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:36:09,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:36:09,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:36:09,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:36:09,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:36:09,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:36:09,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:36:09,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:36:09,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:36:09,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:36:09,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:36:09,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:36:09,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:36:09,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:36:09,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:36:09,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:36:09,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:36:09,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:36:09,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:36:09,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:36:09,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:36:09,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:36:09,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:36:09,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:36:09,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:36:09,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:36:09,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:36:09,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:36:09,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:36:09,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:36:09,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:36:09,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:36:09,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:36:09,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:36:09,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:36:09,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:36:09,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:36:09,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:36:09,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:36:09,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:36:09,390 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:36:09,416 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:36:09,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:36:09,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:36:09,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:36:09,418 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:36:09,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:36:09,419 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:36:09,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:36:09,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:36:09,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:36:09,420 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:36:09,420 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:36:09,420 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:36:09,420 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:36:09,420 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:36:09,420 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:36:09,421 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:36:09,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:36:09,421 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:36:09,421 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:36:09,421 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:36:09,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:36:09,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:36:09,422 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:36:09,422 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:36:09,422 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:36:09,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:36:09,423 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:36:09,423 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:36:09,423 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:36:09,713 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:36:09,731 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:36:09,736 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:36:09,737 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:36:09,738 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:36:09,739 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2019-12-18 14:36:09,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbd8ff639/b9d77d718c0d4fa0a39e9d0fee2276f7/FLAG70388b8bc [2019-12-18 14:36:10,376 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:36:10,376 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2019-12-18 14:36:10,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbd8ff639/b9d77d718c0d4fa0a39e9d0fee2276f7/FLAG70388b8bc [2019-12-18 14:36:10,690 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbd8ff639/b9d77d718c0d4fa0a39e9d0fee2276f7 [2019-12-18 14:36:10,699 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:36:10,701 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:36:10,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:36:10,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:36:10,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:36:10,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:36:10" (1/1) ... [2019-12-18 14:36:10,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12c5e056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:10, skipping insertion in model container [2019-12-18 14:36:10,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:36:10" (1/1) ... [2019-12-18 14:36:10,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:36:10,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:36:11,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:36:11,393 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:36:11,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:36:11,542 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:36:11,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:11 WrapperNode [2019-12-18 14:36:11,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:36:11,544 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:36:11,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:36:11,544 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:36:11,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:11" (1/1) ... [2019-12-18 14:36:11,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:11" (1/1) ... [2019-12-18 14:36:11,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:36:11,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:36:11,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:36:11,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:36:11,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:11" (1/1) ... [2019-12-18 14:36:11,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:11" (1/1) ... [2019-12-18 14:36:11,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:11" (1/1) ... [2019-12-18 14:36:11,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:11" (1/1) ... [2019-12-18 14:36:11,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:11" (1/1) ... [2019-12-18 14:36:11,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:11" (1/1) ... [2019-12-18 14:36:11,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:11" (1/1) ... [2019-12-18 14:36:11,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:36:11,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:36:11,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:36:11,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:36:11,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:11" (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 14:36:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:36:11,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:36:11,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:36:11,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:36:11,721 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:36:11,722 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:36:11,722 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:36:11,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:36:11,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:36:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:36:11,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:36:11,726 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 14:36:12,404 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:36:12,404 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:36:12,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:36:12 BoogieIcfgContainer [2019-12-18 14:36:12,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:36:12,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:36:12,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:36:12,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:36:12,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:36:10" (1/3) ... [2019-12-18 14:36:12,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69deadd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:36:12, skipping insertion in model container [2019-12-18 14:36:12,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:11" (2/3) ... [2019-12-18 14:36:12,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69deadd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:36:12, skipping insertion in model container [2019-12-18 14:36:12,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:36:12" (3/3) ... [2019-12-18 14:36:12,415 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc.i [2019-12-18 14:36:12,424 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:36:12,425 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:36:12,432 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:36:12,433 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:36:12,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,468 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,468 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,468 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,469 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,469 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,477 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,477 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,490 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,490 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,491 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,496 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,497 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:12,515 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:36:12,535 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:36:12,536 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:36:12,536 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:36:12,536 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:36:12,536 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:36:12,536 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:36:12,537 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:36:12,537 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:36:12,554 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-18 14:36:12,556 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 14:36:12,678 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 14:36:12,679 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:36:12,697 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 14:36:12,714 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 14:36:12,790 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 14:36:12,790 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:36:12,799 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 14:36:12,819 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-18 14:36:12,821 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:36:17,703 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-18 14:36:17,806 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-18 14:36:17,838 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46090 [2019-12-18 14:36:17,838 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-18 14:36:17,842 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 91 transitions [2019-12-18 14:36:18,295 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8654 states. [2019-12-18 14:36:18,298 INFO L276 IsEmpty]: Start isEmpty. Operand 8654 states. [2019-12-18 14:36:18,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 14:36:18,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:18,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 14:36:18,305 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:18,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:18,312 INFO L82 PathProgramCache]: Analyzing trace with hash 722891, now seen corresponding path program 1 times [2019-12-18 14:36:18,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:18,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069588343] [2019-12-18 14:36:18,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:18,576 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 14:36:18,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069588343] [2019-12-18 14:36:18,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:18,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:36:18,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343795364] [2019-12-18 14:36:18,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:36:18,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:18,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:36:18,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:36:18,605 INFO L87 Difference]: Start difference. First operand 8654 states. Second operand 3 states. [2019-12-18 14:36:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:18,865 INFO L93 Difference]: Finished difference Result 8604 states and 28108 transitions. [2019-12-18 14:36:18,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:36:18,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 14:36:18,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:18,972 INFO L225 Difference]: With dead ends: 8604 [2019-12-18 14:36:18,973 INFO L226 Difference]: Without dead ends: 8436 [2019-12-18 14:36:18,974 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 14:36:19,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8436 states. [2019-12-18 14:36:19,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8436 to 8436. [2019-12-18 14:36:19,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8436 states. [2019-12-18 14:36:19,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 27590 transitions. [2019-12-18 14:36:19,453 INFO L78 Accepts]: Start accepts. Automaton has 8436 states and 27590 transitions. Word has length 3 [2019-12-18 14:36:19,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:19,454 INFO L462 AbstractCegarLoop]: Abstraction has 8436 states and 27590 transitions. [2019-12-18 14:36:19,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:36:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 8436 states and 27590 transitions. [2019-12-18 14:36:19,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:36:19,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:19,457 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:36:19,457 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:19,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:19,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1596153002, now seen corresponding path program 1 times [2019-12-18 14:36:19,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:19,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000870712] [2019-12-18 14:36:19,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:19,554 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 14:36:19,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000870712] [2019-12-18 14:36:19,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:19,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:36:19,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908188430] [2019-12-18 14:36:19,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:36:19,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:19,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:36:19,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:36:19,558 INFO L87 Difference]: Start difference. First operand 8436 states and 27590 transitions. Second operand 4 states. [2019-12-18 14:36:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:20,062 INFO L93 Difference]: Finished difference Result 13130 states and 41153 transitions. [2019-12-18 14:36:20,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:36:20,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:36:20,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:20,147 INFO L225 Difference]: With dead ends: 13130 [2019-12-18 14:36:20,147 INFO L226 Difference]: Without dead ends: 13123 [2019-12-18 14:36:20,148 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 14:36:20,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13123 states. [2019-12-18 14:36:21,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13123 to 11988. [2019-12-18 14:36:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11988 states. [2019-12-18 14:36:21,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11988 states to 11988 states and 38075 transitions. [2019-12-18 14:36:21,223 INFO L78 Accepts]: Start accepts. Automaton has 11988 states and 38075 transitions. Word has length 11 [2019-12-18 14:36:21,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:21,224 INFO L462 AbstractCegarLoop]: Abstraction has 11988 states and 38075 transitions. [2019-12-18 14:36:21,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:36:21,224 INFO L276 IsEmpty]: Start isEmpty. Operand 11988 states and 38075 transitions. [2019-12-18 14:36:21,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:36:21,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:21,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:36:21,236 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:21,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:21,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1194917716, now seen corresponding path program 1 times [2019-12-18 14:36:21,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:21,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413856000] [2019-12-18 14:36:21,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:21,364 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 14:36:21,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413856000] [2019-12-18 14:36:21,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:21,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:36:21,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472545651] [2019-12-18 14:36:21,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:36:21,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:21,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:36:21,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:36:21,366 INFO L87 Difference]: Start difference. First operand 11988 states and 38075 transitions. Second operand 4 states. [2019-12-18 14:36:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:21,598 INFO L93 Difference]: Finished difference Result 14736 states and 46267 transitions. [2019-12-18 14:36:21,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:36:21,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:36:21,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:21,646 INFO L225 Difference]: With dead ends: 14736 [2019-12-18 14:36:21,646 INFO L226 Difference]: Without dead ends: 14736 [2019-12-18 14:36:21,647 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 14:36:21,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14736 states. [2019-12-18 14:36:22,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14736 to 13160. [2019-12-18 14:36:22,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13160 states. [2019-12-18 14:36:22,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13160 states to 13160 states and 41689 transitions. [2019-12-18 14:36:22,305 INFO L78 Accepts]: Start accepts. Automaton has 13160 states and 41689 transitions. Word has length 11 [2019-12-18 14:36:22,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:22,306 INFO L462 AbstractCegarLoop]: Abstraction has 13160 states and 41689 transitions. [2019-12-18 14:36:22,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:36:22,306 INFO L276 IsEmpty]: Start isEmpty. Operand 13160 states and 41689 transitions. [2019-12-18 14:36:22,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 14:36:22,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:22,310 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 14:36:22,310 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:22,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:22,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1502155024, now seen corresponding path program 1 times [2019-12-18 14:36:22,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:22,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845398059] [2019-12-18 14:36:22,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:22,386 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 14:36:22,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845398059] [2019-12-18 14:36:22,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:22,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:36:22,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948990806] [2019-12-18 14:36:22,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:36:22,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:22,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:36:22,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:36:22,391 INFO L87 Difference]: Start difference. First operand 13160 states and 41689 transitions. Second operand 5 states. [2019-12-18 14:36:22,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:22,850 INFO L93 Difference]: Finished difference Result 17572 states and 54523 transitions. [2019-12-18 14:36:22,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:36:22,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 14:36:22,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:22,903 INFO L225 Difference]: With dead ends: 17572 [2019-12-18 14:36:22,903 INFO L226 Difference]: Without dead ends: 17565 [2019-12-18 14:36:22,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 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 14:36:23,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17565 states. [2019-12-18 14:36:23,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17565 to 13105. [2019-12-18 14:36:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13105 states. [2019-12-18 14:36:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13105 states to 13105 states and 41426 transitions. [2019-12-18 14:36:23,505 INFO L78 Accepts]: Start accepts. Automaton has 13105 states and 41426 transitions. Word has length 17 [2019-12-18 14:36:23,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:23,506 INFO L462 AbstractCegarLoop]: Abstraction has 13105 states and 41426 transitions. [2019-12-18 14:36:23,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:36:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 13105 states and 41426 transitions. [2019-12-18 14:36:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:36:23,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:23,518 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 14:36:23,518 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:23,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:23,518 INFO L82 PathProgramCache]: Analyzing trace with hash 933350131, now seen corresponding path program 1 times [2019-12-18 14:36:23,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:23,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767835054] [2019-12-18 14:36:23,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:23,571 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 14:36:23,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767835054] [2019-12-18 14:36:23,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:23,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:36:23,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452701999] [2019-12-18 14:36:23,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:36:23,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:23,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:36:23,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:36:23,574 INFO L87 Difference]: Start difference. First operand 13105 states and 41426 transitions. Second operand 3 states. [2019-12-18 14:36:23,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:23,679 INFO L93 Difference]: Finished difference Result 16057 states and 50095 transitions. [2019-12-18 14:36:23,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:36:23,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 14:36:23,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:23,713 INFO L225 Difference]: With dead ends: 16057 [2019-12-18 14:36:23,714 INFO L226 Difference]: Without dead ends: 16057 [2019-12-18 14:36:23,714 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 14:36:23,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16057 states. [2019-12-18 14:36:24,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16057 to 14186. [2019-12-18 14:36:24,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14186 states. [2019-12-18 14:36:24,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14186 states to 14186 states and 44710 transitions. [2019-12-18 14:36:24,128 INFO L78 Accepts]: Start accepts. Automaton has 14186 states and 44710 transitions. Word has length 25 [2019-12-18 14:36:24,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:24,130 INFO L462 AbstractCegarLoop]: Abstraction has 14186 states and 44710 transitions. [2019-12-18 14:36:24,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:36:24,130 INFO L276 IsEmpty]: Start isEmpty. Operand 14186 states and 44710 transitions. [2019-12-18 14:36:24,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:36:24,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:24,147 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 14:36:24,148 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:24,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:24,148 INFO L82 PathProgramCache]: Analyzing trace with hash 933194542, now seen corresponding path program 1 times [2019-12-18 14:36:24,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:24,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600598577] [2019-12-18 14:36:24,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:24,239 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 14:36:24,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600598577] [2019-12-18 14:36:24,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:24,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:36:24,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429934752] [2019-12-18 14:36:24,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:36:24,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:24,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:36:24,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:36:24,241 INFO L87 Difference]: Start difference. First operand 14186 states and 44710 transitions. Second operand 4 states. [2019-12-18 14:36:24,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:24,285 INFO L93 Difference]: Finished difference Result 2296 states and 5226 transitions. [2019-12-18 14:36:24,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:36:24,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:36:24,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:24,289 INFO L225 Difference]: With dead ends: 2296 [2019-12-18 14:36:24,289 INFO L226 Difference]: Without dead ends: 2019 [2019-12-18 14:36:24,289 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 14:36:24,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2019-12-18 14:36:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 2019. [2019-12-18 14:36:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2019-12-18 14:36:24,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 4460 transitions. [2019-12-18 14:36:24,322 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 4460 transitions. Word has length 25 [2019-12-18 14:36:24,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:24,322 INFO L462 AbstractCegarLoop]: Abstraction has 2019 states and 4460 transitions. [2019-12-18 14:36:24,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:36:24,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 4460 transitions. [2019-12-18 14:36:24,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 14:36:24,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:24,326 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 14:36:24,327 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:24,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:24,327 INFO L82 PathProgramCache]: Analyzing trace with hash -568804126, now seen corresponding path program 1 times [2019-12-18 14:36:24,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:24,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095693948] [2019-12-18 14:36:24,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:24,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095693948] [2019-12-18 14:36:24,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:24,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:36:24,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032008905] [2019-12-18 14:36:24,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:36:24,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:24,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:36:24,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:36:24,435 INFO L87 Difference]: Start difference. First operand 2019 states and 4460 transitions. Second operand 5 states. [2019-12-18 14:36:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:24,479 INFO L93 Difference]: Finished difference Result 416 states and 758 transitions. [2019-12-18 14:36:24,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:36:24,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 14:36:24,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:24,481 INFO L225 Difference]: With dead ends: 416 [2019-12-18 14:36:24,481 INFO L226 Difference]: Without dead ends: 371 [2019-12-18 14:36:24,481 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 14:36:24,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-18 14:36:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 343. [2019-12-18 14:36:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-18 14:36:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 618 transitions. [2019-12-18 14:36:24,487 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 618 transitions. Word has length 37 [2019-12-18 14:36:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:24,487 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 618 transitions. [2019-12-18 14:36:24,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:36:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 618 transitions. [2019-12-18 14:36:24,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 14:36:24,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:24,490 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 14:36:24,490 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:24,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:24,490 INFO L82 PathProgramCache]: Analyzing trace with hash -506418728, now seen corresponding path program 1 times [2019-12-18 14:36:24,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:24,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387657470] [2019-12-18 14:36:24,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:24,728 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 14:36:24,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387657470] [2019-12-18 14:36:24,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:24,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:36:24,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596666881] [2019-12-18 14:36:24,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:36:24,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:24,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:36:24,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:36:24,732 INFO L87 Difference]: Start difference. First operand 343 states and 618 transitions. Second operand 3 states. [2019-12-18 14:36:24,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:24,747 INFO L93 Difference]: Finished difference Result 331 states and 582 transitions. [2019-12-18 14:36:24,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:36:24,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 14:36:24,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:24,749 INFO L225 Difference]: With dead ends: 331 [2019-12-18 14:36:24,749 INFO L226 Difference]: Without dead ends: 331 [2019-12-18 14:36:24,749 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 14:36:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-18 14:36:24,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2019-12-18 14:36:24,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-12-18 14:36:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 582 transitions. [2019-12-18 14:36:24,755 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 582 transitions. Word has length 52 [2019-12-18 14:36:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:24,757 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 582 transitions. [2019-12-18 14:36:24,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:36:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 582 transitions. [2019-12-18 14:36:24,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:36:24,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:24,762 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 14:36:24,762 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:24,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:24,762 INFO L82 PathProgramCache]: Analyzing trace with hash -156128935, now seen corresponding path program 1 times [2019-12-18 14:36:24,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:24,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619935743] [2019-12-18 14:36:24,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:24,915 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 14:36:24,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619935743] [2019-12-18 14:36:24,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:24,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:36:24,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242836901] [2019-12-18 14:36:24,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:36:24,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:24,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:36:24,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:36:24,918 INFO L87 Difference]: Start difference. First operand 331 states and 582 transitions. Second operand 5 states. [2019-12-18 14:36:25,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:25,095 INFO L93 Difference]: Finished difference Result 487 states and 864 transitions. [2019-12-18 14:36:25,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:36:25,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-18 14:36:25,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:25,096 INFO L225 Difference]: With dead ends: 487 [2019-12-18 14:36:25,096 INFO L226 Difference]: Without dead ends: 487 [2019-12-18 14:36:25,097 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 14:36:25,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-12-18 14:36:25,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 422. [2019-12-18 14:36:25,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-12-18 14:36:25,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 748 transitions. [2019-12-18 14:36:25,103 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 748 transitions. Word has length 53 [2019-12-18 14:36:25,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:25,103 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 748 transitions. [2019-12-18 14:36:25,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:36:25,103 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 748 transitions. [2019-12-18 14:36:25,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:36:25,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:25,105 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 14:36:25,105 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:25,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:25,106 INFO L82 PathProgramCache]: Analyzing trace with hash -2022513439, now seen corresponding path program 2 times [2019-12-18 14:36:25,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:25,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215172500] [2019-12-18 14:36:25,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:25,199 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 14:36:25,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215172500] [2019-12-18 14:36:25,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:25,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:36:25,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527549741] [2019-12-18 14:36:25,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:36:25,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:25,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:36:25,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:36:25,201 INFO L87 Difference]: Start difference. First operand 422 states and 748 transitions. Second operand 3 states. [2019-12-18 14:36:25,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:25,241 INFO L93 Difference]: Finished difference Result 422 states and 747 transitions. [2019-12-18 14:36:25,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:36:25,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 14:36:25,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:25,242 INFO L225 Difference]: With dead ends: 422 [2019-12-18 14:36:25,242 INFO L226 Difference]: Without dead ends: 422 [2019-12-18 14:36:25,243 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 14:36:25,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-12-18 14:36:25,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 331. [2019-12-18 14:36:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-12-18 14:36:25,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 581 transitions. [2019-12-18 14:36:25,248 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 581 transitions. Word has length 53 [2019-12-18 14:36:25,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:25,249 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 581 transitions. [2019-12-18 14:36:25,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:36:25,249 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 581 transitions. [2019-12-18 14:36:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:36:25,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:25,250 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 14:36:25,250 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:25,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:25,251 INFO L82 PathProgramCache]: Analyzing trace with hash -731863498, now seen corresponding path program 1 times [2019-12-18 14:36:25,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:25,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670567267] [2019-12-18 14:36:25,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:25,373 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 14:36:25,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670567267] [2019-12-18 14:36:25,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:25,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:36:25,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50748724] [2019-12-18 14:36:25,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:36:25,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:25,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:36:25,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:36:25,376 INFO L87 Difference]: Start difference. First operand 331 states and 581 transitions. Second operand 7 states. [2019-12-18 14:36:25,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:25,469 INFO L93 Difference]: Finished difference Result 534 states and 938 transitions. [2019-12-18 14:36:25,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:36:25,470 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 14:36:25,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:25,471 INFO L225 Difference]: With dead ends: 534 [2019-12-18 14:36:25,471 INFO L226 Difference]: Without dead ends: 245 [2019-12-18 14:36:25,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:36:25,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-12-18 14:36:25,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 221. [2019-12-18 14:36:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-12-18 14:36:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 391 transitions. [2019-12-18 14:36:25,478 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 391 transitions. Word has length 54 [2019-12-18 14:36:25,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:25,478 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 391 transitions. [2019-12-18 14:36:25,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:36:25,478 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 391 transitions. [2019-12-18 14:36:25,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:36:25,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:25,479 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 14:36:25,479 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:25,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:25,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1034362442, now seen corresponding path program 2 times [2019-12-18 14:36:25,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:25,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201044425] [2019-12-18 14:36:25,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:26,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201044425] [2019-12-18 14:36:26,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:26,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 14:36:26,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571584185] [2019-12-18 14:36:26,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 14:36:26,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:26,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 14:36:26,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:36:26,141 INFO L87 Difference]: Start difference. First operand 221 states and 391 transitions. Second operand 19 states. [2019-12-18 14:36:27,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:27,836 INFO L93 Difference]: Finished difference Result 610 states and 1023 transitions. [2019-12-18 14:36:27,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 14:36:27,837 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2019-12-18 14:36:27,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:27,838 INFO L225 Difference]: With dead ends: 610 [2019-12-18 14:36:27,839 INFO L226 Difference]: Without dead ends: 577 [2019-12-18 14:36:27,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=1049, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 14:36:27,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-12-18 14:36:27,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 277. [2019-12-18 14:36:27,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-18 14:36:27,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 465 transitions. [2019-12-18 14:36:27,845 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 465 transitions. Word has length 54 [2019-12-18 14:36:27,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:27,846 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 465 transitions. [2019-12-18 14:36:27,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 14:36:27,846 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 465 transitions. [2019-12-18 14:36:27,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:36:27,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:27,847 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 14:36:27,848 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:27,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:27,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1035568350, now seen corresponding path program 3 times [2019-12-18 14:36:27,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:27,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928342488] [2019-12-18 14:36:27,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:28,215 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 14:36:28,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928342488] [2019-12-18 14:36:28,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:28,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 14:36:28,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044414942] [2019-12-18 14:36:28,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 14:36:28,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:28,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 14:36:28,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:36:28,218 INFO L87 Difference]: Start difference. First operand 277 states and 465 transitions. Second operand 17 states. [2019-12-18 14:36:29,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:29,056 INFO L93 Difference]: Finished difference Result 483 states and 804 transitions. [2019-12-18 14:36:29,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 14:36:29,056 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-12-18 14:36:29,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:29,057 INFO L225 Difference]: With dead ends: 483 [2019-12-18 14:36:29,057 INFO L226 Difference]: Without dead ends: 450 [2019-12-18 14:36:29,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2019-12-18 14:36:29,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-12-18 14:36:29,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 300. [2019-12-18 14:36:29,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-12-18 14:36:29,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 510 transitions. [2019-12-18 14:36:29,064 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 510 transitions. Word has length 54 [2019-12-18 14:36:29,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:29,065 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 510 transitions. [2019-12-18 14:36:29,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 14:36:29,065 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 510 transitions. [2019-12-18 14:36:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:36:29,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:29,066 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 14:36:29,066 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:29,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:29,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1929608182, now seen corresponding path program 4 times [2019-12-18 14:36:29,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:29,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323353528] [2019-12-18 14:36:29,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:29,361 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 14:36:29,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323353528] [2019-12-18 14:36:29,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:29,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:36:29,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733684078] [2019-12-18 14:36:29,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 14:36:29,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:29,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 14:36:29,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:36:29,363 INFO L87 Difference]: Start difference. First operand 300 states and 510 transitions. Second operand 13 states. [2019-12-18 14:36:29,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:29,848 INFO L93 Difference]: Finished difference Result 447 states and 745 transitions. [2019-12-18 14:36:29,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 14:36:29,849 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 14:36:29,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:29,850 INFO L225 Difference]: With dead ends: 447 [2019-12-18 14:36:29,850 INFO L226 Difference]: Without dead ends: 414 [2019-12-18 14:36:29,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:36:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-12-18 14:36:29,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 306. [2019-12-18 14:36:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-12-18 14:36:29,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 518 transitions. [2019-12-18 14:36:29,856 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 518 transitions. Word has length 54 [2019-12-18 14:36:29,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:29,856 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 518 transitions. [2019-12-18 14:36:29,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 14:36:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 518 transitions. [2019-12-18 14:36:29,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:36:29,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:29,858 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 14:36:29,858 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:29,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:29,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1326135034, now seen corresponding path program 5 times [2019-12-18 14:36:29,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:29,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594333009] [2019-12-18 14:36:29,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:30,554 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 14:36:30,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594333009] [2019-12-18 14:36:30,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:30,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 14:36:30,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303175594] [2019-12-18 14:36:30,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 14:36:30,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:30,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 14:36:30,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:36:30,556 INFO L87 Difference]: Start difference. First operand 306 states and 518 transitions. Second operand 18 states. [2019-12-18 14:36:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:31,515 INFO L93 Difference]: Finished difference Result 548 states and 910 transitions. [2019-12-18 14:36:31,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 14:36:31,515 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2019-12-18 14:36:31,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:31,516 INFO L225 Difference]: With dead ends: 548 [2019-12-18 14:36:31,517 INFO L226 Difference]: Without dead ends: 515 [2019-12-18 14:36:31,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2019-12-18 14:36:31,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-12-18 14:36:31,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 320. [2019-12-18 14:36:31,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-18 14:36:31,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 544 transitions. [2019-12-18 14:36:31,523 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 544 transitions. Word has length 54 [2019-12-18 14:36:31,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:31,524 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 544 transitions. [2019-12-18 14:36:31,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 14:36:31,524 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 544 transitions. [2019-12-18 14:36:31,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:36:31,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:31,525 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 14:36:31,525 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:31,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:31,526 INFO L82 PathProgramCache]: Analyzing trace with hash -778167690, now seen corresponding path program 6 times [2019-12-18 14:36:31,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:31,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247594001] [2019-12-18 14:36:31,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:32,140 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 14:36:32,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247594001] [2019-12-18 14:36:32,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:32,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 14:36:32,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431957496] [2019-12-18 14:36:32,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 14:36:32,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:32,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 14:36:32,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:36:32,145 INFO L87 Difference]: Start difference. First operand 320 states and 544 transitions. Second operand 18 states. [2019-12-18 14:36:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:33,231 INFO L93 Difference]: Finished difference Result 563 states and 938 transitions. [2019-12-18 14:36:33,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 14:36:33,231 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2019-12-18 14:36:33,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:33,232 INFO L225 Difference]: With dead ends: 563 [2019-12-18 14:36:33,232 INFO L226 Difference]: Without dead ends: 530 [2019-12-18 14:36:33,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-12-18 14:36:33,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-12-18 14:36:33,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 318. [2019-12-18 14:36:33,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-12-18 14:36:33,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 540 transitions. [2019-12-18 14:36:33,239 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 540 transitions. Word has length 54 [2019-12-18 14:36:33,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:33,240 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 540 transitions. [2019-12-18 14:36:33,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 14:36:33,240 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 540 transitions. [2019-12-18 14:36:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:36:33,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:33,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:36:33,241 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:33,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:33,241 INFO L82 PathProgramCache]: Analyzing trace with hash 202960694, now seen corresponding path program 7 times [2019-12-18 14:36:33,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:33,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738355670] [2019-12-18 14:36:33,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:34,001 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 14:36:34,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738355670] [2019-12-18 14:36:34,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:34,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 14:36:34,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15629628] [2019-12-18 14:36:34,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 14:36:34,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:34,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 14:36:34,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-12-18 14:36:34,005 INFO L87 Difference]: Start difference. First operand 318 states and 540 transitions. Second operand 20 states. [2019-12-18 14:36:35,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:35,503 INFO L93 Difference]: Finished difference Result 712 states and 1165 transitions. [2019-12-18 14:36:35,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 14:36:35,504 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-12-18 14:36:35,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:35,505 INFO L225 Difference]: With dead ends: 712 [2019-12-18 14:36:35,505 INFO L226 Difference]: Without dead ends: 679 [2019-12-18 14:36:35,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=197, Invalid=993, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 14:36:35,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2019-12-18 14:36:35,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 314. [2019-12-18 14:36:35,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-12-18 14:36:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 532 transitions. [2019-12-18 14:36:35,511 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 532 transitions. Word has length 54 [2019-12-18 14:36:35,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:35,512 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 532 transitions. [2019-12-18 14:36:35,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 14:36:35,512 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 532 transitions. [2019-12-18 14:36:35,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:36:35,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:35,513 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 14:36:35,513 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:35,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:35,514 INFO L82 PathProgramCache]: Analyzing trace with hash -91775718, now seen corresponding path program 8 times [2019-12-18 14:36:35,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:35,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37136795] [2019-12-18 14:36:35,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:36:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:36:35,620 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:36:35,620 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:36:35,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2009~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2009~0.base_24|) |v_ULTIMATE.start_main_~#t2009~0.offset_19| 0))) (= v_~y$r_buff1_thd0~0_329 0) (= v_~y$w_buff0_used~0_834 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2009~0.base_24|) (= 0 v_~__unbuffered_cnt~0_61) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2009~0.base_24|)) (= 0 v_~weak$$choice0~0_14) (= v_~y$r_buff1_thd1~0_200 0) (= 0 v_~x~0_147) (= 0 |v_ULTIMATE.start_main_~#t2009~0.offset_19|) (= |v_#NULL.offset_3| 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2009~0.base_24| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2009~0.base_24| 4)) (= v_~main$tmp_guard1~0_27 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= 0 v_~y$r_buff1_thd2~0_208) (= 0 v_~y$r_buff0_thd2~0_162) (= v_~y$mem_tmp~0_19 0) (= v_~weak$$choice2~0_141 0) (= v_~y$w_buff1_used~0_547 0) (= v_~y$r_buff0_thd1~0_297 0) (= 0 v_~y$flush_delayed~0_36) (= v_~main$tmp_guard0~0_33 0) (= 0 |v_#NULL.base_3|) (= 0 v_~y$w_buff0~0_485) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff0_thd0~0_416 0) (= v_~y~0_146 0) (< 0 |v_#StackHeapBarrier_13|) (= v_~y$w_buff1~0_308 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_41|, ULTIMATE.start_main_~#t2009~0.offset=|v_ULTIMATE.start_main_~#t2009~0.offset_19|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_145|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_297, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, #length=|v_#length_13|, ULTIMATE.start_main_~#t2010~0.base=|v_ULTIMATE.start_main_~#t2010~0.base_19|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_36|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_38|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_21|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_41|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_44|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_38|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_308, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_162, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_329, ~x~0=v_~x~0_147, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_834, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ULTIMATE.start_main_~#t2009~0.base=|v_ULTIMATE.start_main_~#t2009~0.base_24|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_33|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_200, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y~0=v_~y~0_146, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_35|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_40|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_208, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_~#t2010~0.offset=|v_ULTIMATE.start_main_~#t2010~0.offset_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_416, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_14|, ~weak$$choice2~0=v_~weak$$choice2~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2009~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t2010~0.base, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t2009~0.base, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2010~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:36:35,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L779-1-->L781: Formula: (and (= |v_ULTIMATE.start_main_~#t2010~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t2010~0.base_11| 0)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2010~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2010~0.base_11|) |v_ULTIMATE.start_main_~#t2010~0.offset_10| 1)) |v_#memory_int_7|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2010~0.base_11|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2010~0.base_11| 4) |v_#length_9|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2010~0.base_11| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2010~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2010~0.base=|v_ULTIMATE.start_main_~#t2010~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2010~0.offset=|v_ULTIMATE.start_main_~#t2010~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2010~0.base, ULTIMATE.start_main_~#t2010~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 14:36:35,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1~0_121 v_~y$w_buff0~0_204) (= 2 v_~y$w_buff0~0_203) (= v_P0Thread1of1ForFork0_~arg.base_96 |v_P0Thread1of1ForFork0_#in~arg.base_96|) (= 0 (mod v_~y$w_buff1_used~0_210 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|) (= v_P0Thread1of1ForFork0_~arg.offset_96 |v_P0Thread1of1ForFork0_#in~arg.offset_96|) (= v_~y$w_buff0_used~0_350 v_~y$w_buff1_used~0_210) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_100 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|) (= v_~y$w_buff0_used~0_349 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_350, ~y$w_buff0~0=v_~y$w_buff0~0_204, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_349, ~y$w_buff1~0=v_~y$w_buff1~0_121, ~y$w_buff0~0=v_~y$w_buff0~0_203, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_100, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_96, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_96, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_210} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:36:35,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L756-2-->L756-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-481634251 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-481634251 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-481634251 |P1Thread1of1ForFork1_#t~ite9_Out-481634251|)) (and (= ~y$w_buff1~0_In-481634251 |P1Thread1of1ForFork1_#t~ite9_Out-481634251|) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-481634251, ~y$w_buff1~0=~y$w_buff1~0_In-481634251, ~y~0=~y~0_In-481634251, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-481634251} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-481634251, ~y$w_buff1~0=~y$w_buff1~0_In-481634251, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-481634251|, ~y~0=~y~0_In-481634251, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-481634251} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 14:36:35,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L756-4-->L757: Formula: (= v_~y~0_41 |v_P1Thread1of1ForFork1_#t~ite9_10|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_10|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_9|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_15|, ~y~0=v_~y~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-18 14:36:35,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1227357501 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1227357501 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1227357501| 0)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1227357501 |P1Thread1of1ForFork1_#t~ite11_Out1227357501|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1227357501, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1227357501} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1227357501, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1227357501, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1227357501|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 14:36:35,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1934815862 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1934815862 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1934815862 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1934815862 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1934815862| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite12_Out-1934815862| ~y$w_buff1_used~0_In-1934815862) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1934815862, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1934815862, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1934815862, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1934815862} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1934815862, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1934815862, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1934815862, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1934815862|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1934815862} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 14:36:35,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L759-->L759-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In398718639 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In398718639 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out398718639| ~y$r_buff0_thd2~0_In398718639)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out398718639| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In398718639, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In398718639} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In398718639, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In398718639, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out398718639|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 14:36:35,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1853948576 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1853948576 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1853948576 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1853948576 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out1853948576| ~y$r_buff1_thd2~0_In1853948576) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out1853948576| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1853948576, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1853948576, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1853948576, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1853948576} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1853948576, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1853948576, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1853948576, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1853948576|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1853948576} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:36:35,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~y$r_buff1_thd2~0_91) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_91, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 14:36:35,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L737-->L737-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In600661542 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In600661542 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out600661542| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out600661542| ~y$w_buff0_used~0_In600661542)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In600661542, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In600661542} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out600661542|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In600661542, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In600661542} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:36:35,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L738-->L738-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1265102897 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-1265102897 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1265102897 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1265102897 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1265102897 |P0Thread1of1ForFork0_#t~ite6_Out-1265102897|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1265102897|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1265102897, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1265102897, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1265102897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1265102897} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1265102897|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1265102897, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1265102897, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1265102897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1265102897} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:36:35,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L739-->L740: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-167100496 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-167100496 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out-167100496 ~y$r_buff0_thd1~0_In-167100496)) (and (not .cse0) (= ~y$r_buff0_thd1~0_Out-167100496 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-167100496, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-167100496} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-167100496, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-167100496|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-167100496} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:36:35,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-508075930 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-508075930 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-508075930 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-508075930 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-508075930| ~y$r_buff1_thd1~0_In-508075930) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out-508075930| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-508075930, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-508075930, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-508075930, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-508075930} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-508075930, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-508075930, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-508075930|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-508075930, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-508075930} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:36:35,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L740-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 14:36:35,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [577] [577] L785-->L787-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$w_buff0_used~0_67 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_44 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:36:35,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-2-->L787-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite18_Out-1758768294| |ULTIMATE.start_main_#t~ite17_Out-1758768294|)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1758768294 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1758768294 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite17_Out-1758768294| ~y$w_buff1~0_In-1758768294)) (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite17_Out-1758768294| ~y~0_In-1758768294)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1758768294, ~y~0=~y~0_In-1758768294, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1758768294, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1758768294} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1758768294|, ~y$w_buff1~0=~y$w_buff1~0_In-1758768294, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1758768294|, ~y~0=~y~0_In-1758768294, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1758768294, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1758768294} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-18 14:36:35,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1458152875 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1458152875 256)))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out-1458152875| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite19_Out-1458152875| ~y$w_buff0_used~0_In-1458152875) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1458152875, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1458152875} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1458152875, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1458152875|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1458152875} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 14:36:35,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1065213955 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1065213955 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1065213955 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1065213955 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out1065213955|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1065213955 |ULTIMATE.start_main_#t~ite20_Out1065213955|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1065213955, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1065213955, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1065213955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1065213955} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1065213955, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1065213955, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1065213955|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1065213955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1065213955} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 14:36:35,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In479260245 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In479260245 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out479260245| ~y$r_buff0_thd0~0_In479260245)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out479260245|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In479260245, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In479260245} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In479260245, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In479260245, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out479260245|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 14:36:35,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L791-->L791-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1863965496 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1863965496 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1863965496 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1863965496 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out1863965496|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out1863965496| ~y$r_buff1_thd0~0_In1863965496) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1863965496, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1863965496, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1863965496, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1863965496} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1863965496, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1863965496, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1863965496, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1863965496|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1863965496} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 14:36:35,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L800-->L800-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-460182133 256) 0))) (or (and (= ~y$w_buff1~0_In-460182133 |ULTIMATE.start_main_#t~ite32_Out-460182133|) (not .cse0) (= |ULTIMATE.start_main_#t~ite31_In-460182133| |ULTIMATE.start_main_#t~ite31_Out-460182133|)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-460182133 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-460182133 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-460182133 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-460182133 256) 0)))) (= ~y$w_buff1~0_In-460182133 |ULTIMATE.start_main_#t~ite31_Out-460182133|) (= |ULTIMATE.start_main_#t~ite31_Out-460182133| |ULTIMATE.start_main_#t~ite32_Out-460182133|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-460182133, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-460182133, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-460182133, ~weak$$choice2~0=~weak$$choice2~0_In-460182133, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-460182133|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-460182133, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460182133} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-460182133, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-460182133, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-460182133, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-460182133|, ~weak$$choice2~0=~weak$$choice2~0_In-460182133, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-460182133|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-460182133, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460182133} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-18 14:36:35,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L803-->L804: Formula: (and (= v_~y$r_buff0_thd0~0_162 v_~y$r_buff0_thd0~0_163) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_162, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-18 14:36:35,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L806-->L809-1: Formula: (and (= 0 v_~y$flush_delayed~0_24) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_12 256)) (not (= 0 (mod v_~y$flush_delayed~0_25 256))) (= v_~y~0_106 v_~y$mem_tmp~0_13)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_106, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_22|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:36:35,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 14:36:35,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:36:35 BasicIcfg [2019-12-18 14:36:35,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:36:35,718 INFO L168 Benchmark]: Toolchain (without parser) took 25016.87 ms. Allocated memory was 138.4 MB in the beginning and 883.4 MB in the end (delta: 745.0 MB). Free memory was 100.9 MB in the beginning and 584.6 MB in the end (delta: -483.7 MB). Peak memory consumption was 261.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:35,718 INFO L168 Benchmark]: CDTParser took 1.45 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 14:36:35,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 841.15 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 100.5 MB in the beginning and 156.2 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:35,720 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.24 ms. Allocated memory is still 201.9 MB. Free memory was 156.2 MB in the beginning and 153.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:35,720 INFO L168 Benchmark]: Boogie Preprocessor took 35.75 ms. Allocated memory is still 201.9 MB. Free memory was 153.5 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:35,721 INFO L168 Benchmark]: RCFGBuilder took 761.29 ms. Allocated memory is still 201.9 MB. Free memory was 150.8 MB in the beginning and 106.4 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:35,722 INFO L168 Benchmark]: TraceAbstraction took 23309.36 ms. Allocated memory was 201.9 MB in the beginning and 883.4 MB in the end (delta: 681.6 MB). Free memory was 106.4 MB in the beginning and 584.6 MB in the end (delta: -478.2 MB). Peak memory consumption was 203.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:35,725 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.45 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 841.15 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 100.5 MB in the beginning and 156.2 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.24 ms. Allocated memory is still 201.9 MB. Free memory was 156.2 MB in the beginning and 153.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.75 ms. Allocated memory is still 201.9 MB. Free memory was 153.5 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 761.29 ms. Allocated memory is still 201.9 MB. Free memory was 150.8 MB in the beginning and 106.4 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23309.36 ms. Allocated memory was 201.9 MB in the beginning and 883.4 MB in the end (delta: 681.6 MB). Free memory was 106.4 MB in the beginning and 584.6 MB in the end (delta: -478.2 MB). Peak memory consumption was 203.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 146 ProgramPointsBefore, 79 ProgramPointsAfterwards, 180 TransitionsBefore, 91 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 3678 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 69 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 46090 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 23.0s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1764 SDtfs, 2163 SDslu, 6237 SDs, 0 SdLazy, 5935 SolverSat, 262 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 20 SyntacticMatches, 19 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14186occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 10580 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 719 NumberOfCodeBlocks, 719 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 648 ConstructedInterpolants, 0 QuantifiedInterpolants, 208971 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...