/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:19:21,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:19:21,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:19:21,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:19:21,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:19:21,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:19:21,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:19:21,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:19:21,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:19:21,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:19:21,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:19:21,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:19:21,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:19:21,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:19:21,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:19:21,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:19:21,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:19:21,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:19:21,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:19:21,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:19:21,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:19:21,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:19:21,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:19:21,489 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:19:21,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:19:21,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:19:21,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:19:21,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:19:21,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:19:21,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:19:21,494 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:19:21,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:19:21,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:19:21,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:19:21,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:19:21,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:19:21,501 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:19:21,501 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:19:21,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:19:21,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:19:21,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:19:21,504 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:19:21,529 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:19:21,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:19:21,532 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:19:21,532 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:19:21,533 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:19:21,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:19:21,533 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:19:21,533 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:19:21,533 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:19:21,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:19:21,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:19:21,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:19:21,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:19:21,536 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:19:21,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:19:21,536 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:19:21,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:19:21,537 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:19:21,537 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:19:21,537 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:19:21,537 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:19:21,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:19:21,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:19:21,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:19:21,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:19:21,538 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:19:21,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:19:21,539 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:19:21,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:19:21,539 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:19:21,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:19:21,820 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:19:21,824 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:19:21,825 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:19:21,826 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:19:21,827 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt.i [2019-12-27 07:19:21,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/406ded4be/1b499bacfcf6496b98ee46b60c0125f3/FLAG29c8763c3 [2019-12-27 07:19:22,475 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:19:22,476 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.opt.i [2019-12-27 07:19:22,494 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/406ded4be/1b499bacfcf6496b98ee46b60c0125f3/FLAG29c8763c3 [2019-12-27 07:19:22,820 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/406ded4be/1b499bacfcf6496b98ee46b60c0125f3 [2019-12-27 07:19:22,829 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:19:22,831 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:19:22,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:19:22,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:19:22,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:19:22,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:19:22" (1/1) ... [2019-12-27 07:19:22,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f84663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:19:22, skipping insertion in model container [2019-12-27 07:19:22,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:19:22" (1/1) ... [2019-12-27 07:19:22,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:19:22,902 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:19:23,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:19:23,475 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:19:23,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:19:23,633 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:19:23,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:19:23 WrapperNode [2019-12-27 07:19:23,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:19:23,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:19:23,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:19:23,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:19:23,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:19:23" (1/1) ... [2019-12-27 07:19:23,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:19:23" (1/1) ... [2019-12-27 07:19:23,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:19:23,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:19:23,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:19:23,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:19:23,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:19:23" (1/1) ... [2019-12-27 07:19:23,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:19:23" (1/1) ... [2019-12-27 07:19:23,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:19:23" (1/1) ... [2019-12-27 07:19:23,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:19:23" (1/1) ... [2019-12-27 07:19:23,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:19:23" (1/1) ... [2019-12-27 07:19:23,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:19:23" (1/1) ... [2019-12-27 07:19:23,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:19:23" (1/1) ... [2019-12-27 07:19:23,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:19:23,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:19:23,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:19:23,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:19:23,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:19:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:19:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:19:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:19:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:19:23,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:19:23,835 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:19:23,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:19:23,835 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:19:23,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:19:23,836 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:19:23,836 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:19:23,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:19:23,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:19:23,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:19:23,838 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:19:24,589 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:19:24,589 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:19:24,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:19:24 BoogieIcfgContainer [2019-12-27 07:19:24,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:19:24,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:19:24,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:19:24,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:19:24,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:19:22" (1/3) ... [2019-12-27 07:19:24,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bee6690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:19:24, skipping insertion in model container [2019-12-27 07:19:24,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:19:23" (2/3) ... [2019-12-27 07:19:24,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bee6690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:19:24, skipping insertion in model container [2019-12-27 07:19:24,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:19:24" (3/3) ... [2019-12-27 07:19:24,602 INFO L109 eAbstractionObserver]: Analyzing ICFG safe001_power.opt.i [2019-12-27 07:19:24,613 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:19:24,614 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:19:24,624 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:19:24,625 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:19:24,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,677 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,677 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,686 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,686 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,686 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,687 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,687 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,695 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,695 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,726 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,726 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,728 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,729 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,729 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,733 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,733 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:19:24,749 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:19:24,770 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:19:24,770 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:19:24,770 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:19:24,770 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:19:24,771 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:19:24,771 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:19:24,771 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:19:24,771 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:19:24,789 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 07:19:24,791 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 07:19:24,903 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 07:19:24,904 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:19:24,920 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:19:24,945 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 07:19:25,006 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 07:19:25,006 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:19:25,017 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:19:25,038 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 07:19:25,040 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:19:28,334 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 07:19:28,448 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 07:19:28,472 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82010 [2019-12-27 07:19:28,473 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 07:19:28,476 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 109 transitions [2019-12-27 07:19:48,084 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 117808 states. [2019-12-27 07:19:48,086 INFO L276 IsEmpty]: Start isEmpty. Operand 117808 states. [2019-12-27 07:19:48,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:19:48,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:19:48,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:19:48,094 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:19:48,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:19:48,100 INFO L82 PathProgramCache]: Analyzing trace with hash 806008766, now seen corresponding path program 1 times [2019-12-27 07:19:48,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:19:48,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288244676] [2019-12-27 07:19:48,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:19:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:19:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:19:48,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288244676] [2019-12-27 07:19:48,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:19:48,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:19:48,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388216812] [2019-12-27 07:19:48,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:19:48,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:19:48,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:19:48,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:19:48,454 INFO L87 Difference]: Start difference. First operand 117808 states. Second operand 3 states. [2019-12-27 07:19:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:19:51,698 INFO L93 Difference]: Finished difference Result 117244 states and 506404 transitions. [2019-12-27 07:19:51,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:19:51,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:19:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:19:52,688 INFO L225 Difference]: With dead ends: 117244 [2019-12-27 07:19:52,688 INFO L226 Difference]: Without dead ends: 114878 [2019-12-27 07:19:52,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:19:58,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114878 states. [2019-12-27 07:20:01,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114878 to 114878. [2019-12-27 07:20:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114878 states. [2019-12-27 07:20:05,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114878 states to 114878 states and 496758 transitions. [2019-12-27 07:20:05,181 INFO L78 Accepts]: Start accepts. Automaton has 114878 states and 496758 transitions. Word has length 5 [2019-12-27 07:20:05,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:20:05,181 INFO L462 AbstractCegarLoop]: Abstraction has 114878 states and 496758 transitions. [2019-12-27 07:20:05,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:20:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 114878 states and 496758 transitions. [2019-12-27 07:20:05,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:20:05,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:20:05,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:20:05,187 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:20:05,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:20:05,188 INFO L82 PathProgramCache]: Analyzing trace with hash 702926397, now seen corresponding path program 1 times [2019-12-27 07:20:05,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:20:05,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975416111] [2019-12-27 07:20:05,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:20:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:20:05,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:20:05,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975416111] [2019-12-27 07:20:05,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:20:05,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:20:05,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907874124] [2019-12-27 07:20:05,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:20:05,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:20:05,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:20:05,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:20:05,315 INFO L87 Difference]: Start difference. First operand 114878 states and 496758 transitions. Second operand 4 states. [2019-12-27 07:20:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:20:10,905 INFO L93 Difference]: Finished difference Result 184188 states and 760222 transitions. [2019-12-27 07:20:10,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:20:10,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:20:10,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:20:11,551 INFO L225 Difference]: With dead ends: 184188 [2019-12-27 07:20:11,551 INFO L226 Difference]: Without dead ends: 184139 [2019-12-27 07:20:11,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:20:16,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184139 states. [2019-12-27 07:20:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184139 to 169203. [2019-12-27 07:20:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169203 states. [2019-12-27 07:20:20,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169203 states to 169203 states and 707190 transitions. [2019-12-27 07:20:20,741 INFO L78 Accepts]: Start accepts. Automaton has 169203 states and 707190 transitions. Word has length 11 [2019-12-27 07:20:20,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:20:20,742 INFO L462 AbstractCegarLoop]: Abstraction has 169203 states and 707190 transitions. [2019-12-27 07:20:20,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:20:20,742 INFO L276 IsEmpty]: Start isEmpty. Operand 169203 states and 707190 transitions. [2019-12-27 07:20:20,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:20:20,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:20:20,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:20:20,748 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:20:20,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:20:20,749 INFO L82 PathProgramCache]: Analyzing trace with hash 702866747, now seen corresponding path program 1 times [2019-12-27 07:20:20,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:20:20,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058874510] [2019-12-27 07:20:20,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:20:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:20:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:20:20,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058874510] [2019-12-27 07:20:20,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:20:20,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:20:20,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147782935] [2019-12-27 07:20:20,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:20:20,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:20:20,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:20:20,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:20:20,827 INFO L87 Difference]: Start difference. First operand 169203 states and 707190 transitions. Second operand 4 states. [2019-12-27 07:20:28,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:20:28,556 INFO L93 Difference]: Finished difference Result 240014 states and 977713 transitions. [2019-12-27 07:20:28,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:20:28,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:20:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:20:29,340 INFO L225 Difference]: With dead ends: 240014 [2019-12-27 07:20:29,340 INFO L226 Difference]: Without dead ends: 239951 [2019-12-27 07:20:29,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:20:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239951 states. [2019-12-27 07:20:38,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239951 to 203645. [2019-12-27 07:20:38,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203645 states. [2019-12-27 07:20:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203645 states to 203645 states and 844323 transitions. [2019-12-27 07:20:48,018 INFO L78 Accepts]: Start accepts. Automaton has 203645 states and 844323 transitions. Word has length 13 [2019-12-27 07:20:48,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:20:48,019 INFO L462 AbstractCegarLoop]: Abstraction has 203645 states and 844323 transitions. [2019-12-27 07:20:48,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:20:48,020 INFO L276 IsEmpty]: Start isEmpty. Operand 203645 states and 844323 transitions. [2019-12-27 07:20:48,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:20:48,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:20:48,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:20:48,024 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:20:48,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:20:48,024 INFO L82 PathProgramCache]: Analyzing trace with hash 464803757, now seen corresponding path program 1 times [2019-12-27 07:20:48,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:20:48,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50361847] [2019-12-27 07:20:48,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:20:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:20:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:20:48,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50361847] [2019-12-27 07:20:48,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:20:48,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:20:48,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539398479] [2019-12-27 07:20:48,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:20:48,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:20:48,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:20:48,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:20:48,083 INFO L87 Difference]: Start difference. First operand 203645 states and 844323 transitions. Second operand 3 states. [2019-12-27 07:20:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:20:48,225 INFO L93 Difference]: Finished difference Result 39928 states and 130360 transitions. [2019-12-27 07:20:48,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:20:48,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 07:20:48,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:20:48,289 INFO L225 Difference]: With dead ends: 39928 [2019-12-27 07:20:48,290 INFO L226 Difference]: Without dead ends: 39928 [2019-12-27 07:20:48,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:20:48,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39928 states. [2019-12-27 07:20:48,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39928 to 39928. [2019-12-27 07:20:48,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39928 states. [2019-12-27 07:20:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39928 states to 39928 states and 130360 transitions. [2019-12-27 07:20:48,940 INFO L78 Accepts]: Start accepts. Automaton has 39928 states and 130360 transitions. Word has length 13 [2019-12-27 07:20:48,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:20:48,941 INFO L462 AbstractCegarLoop]: Abstraction has 39928 states and 130360 transitions. [2019-12-27 07:20:48,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:20:48,941 INFO L276 IsEmpty]: Start isEmpty. Operand 39928 states and 130360 transitions. [2019-12-27 07:20:48,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 07:20:48,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:20:48,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:20:48,944 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:20:48,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:20:48,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2009264966, now seen corresponding path program 1 times [2019-12-27 07:20:48,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:20:48,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622411921] [2019-12-27 07:20:48,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:20:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:20:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:20:49,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622411921] [2019-12-27 07:20:49,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:20:49,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:20:49,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954299843] [2019-12-27 07:20:49,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:20:49,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:20:49,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:20:49,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:20:49,078 INFO L87 Difference]: Start difference. First operand 39928 states and 130360 transitions. Second operand 6 states. [2019-12-27 07:20:51,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:20:51,897 INFO L93 Difference]: Finished difference Result 54473 states and 172334 transitions. [2019-12-27 07:20:51,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:20:51,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-27 07:20:51,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:20:51,996 INFO L225 Difference]: With dead ends: 54473 [2019-12-27 07:20:51,996 INFO L226 Difference]: Without dead ends: 54466 [2019-12-27 07:20:51,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:20:52,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54466 states. [2019-12-27 07:20:52,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54466 to 40256. [2019-12-27 07:20:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40256 states. [2019-12-27 07:20:52,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40256 states to 40256 states and 131316 transitions. [2019-12-27 07:20:52,740 INFO L78 Accepts]: Start accepts. Automaton has 40256 states and 131316 transitions. Word has length 19 [2019-12-27 07:20:52,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:20:52,741 INFO L462 AbstractCegarLoop]: Abstraction has 40256 states and 131316 transitions. [2019-12-27 07:20:52,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:20:52,741 INFO L276 IsEmpty]: Start isEmpty. Operand 40256 states and 131316 transitions. [2019-12-27 07:20:52,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 07:20:52,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:20:52,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:20:52,746 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:20:52,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:20:52,746 INFO L82 PathProgramCache]: Analyzing trace with hash -782714310, now seen corresponding path program 2 times [2019-12-27 07:20:52,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:20:52,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5610829] [2019-12-27 07:20:52,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:20:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:20:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:20:52,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5610829] [2019-12-27 07:20:52,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:20:52,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:20:52,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420525160] [2019-12-27 07:20:52,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:20:52,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:20:52,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:20:52,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:20:52,822 INFO L87 Difference]: Start difference. First operand 40256 states and 131316 transitions. Second operand 5 states. [2019-12-27 07:20:53,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:20:53,560 INFO L93 Difference]: Finished difference Result 50188 states and 160318 transitions. [2019-12-27 07:20:53,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:20:53,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 07:20:53,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:20:53,645 INFO L225 Difference]: With dead ends: 50188 [2019-12-27 07:20:53,645 INFO L226 Difference]: Without dead ends: 50181 [2019-12-27 07:20:53,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:20:53,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50181 states. [2019-12-27 07:20:55,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50181 to 40157. [2019-12-27 07:20:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40157 states. [2019-12-27 07:20:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40157 states to 40157 states and 130977 transitions. [2019-12-27 07:20:55,323 INFO L78 Accepts]: Start accepts. Automaton has 40157 states and 130977 transitions. Word has length 19 [2019-12-27 07:20:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:20:55,323 INFO L462 AbstractCegarLoop]: Abstraction has 40157 states and 130977 transitions. [2019-12-27 07:20:55,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:20:55,323 INFO L276 IsEmpty]: Start isEmpty. Operand 40157 states and 130977 transitions. [2019-12-27 07:20:55,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:20:55,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:20:55,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:20:55,332 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:20:55,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:20:55,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1059595659, now seen corresponding path program 1 times [2019-12-27 07:20:55,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:20:55,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931540723] [2019-12-27 07:20:55,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:20:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:20:55,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:20:55,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931540723] [2019-12-27 07:20:55,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:20:55,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:20:55,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617298025] [2019-12-27 07:20:55,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:20:55,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:20:55,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:20:55,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:20:55,399 INFO L87 Difference]: Start difference. First operand 40157 states and 130977 transitions. Second operand 4 states. [2019-12-27 07:20:55,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:20:55,433 INFO L93 Difference]: Finished difference Result 7224 states and 19739 transitions. [2019-12-27 07:20:55,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:20:55,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:20:55,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:20:55,441 INFO L225 Difference]: With dead ends: 7224 [2019-12-27 07:20:55,442 INFO L226 Difference]: Without dead ends: 7224 [2019-12-27 07:20:55,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:20:55,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2019-12-27 07:20:55,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 7112. [2019-12-27 07:20:55,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7112 states. [2019-12-27 07:20:55,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7112 states to 7112 states and 19419 transitions. [2019-12-27 07:20:55,533 INFO L78 Accepts]: Start accepts. Automaton has 7112 states and 19419 transitions. Word has length 25 [2019-12-27 07:20:55,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:20:55,534 INFO L462 AbstractCegarLoop]: Abstraction has 7112 states and 19419 transitions. [2019-12-27 07:20:55,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:20:55,534 INFO L276 IsEmpty]: Start isEmpty. Operand 7112 states and 19419 transitions. [2019-12-27 07:20:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 07:20:55,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:20:55,544 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-27 07:20:55,544 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:20:55,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:20:55,544 INFO L82 PathProgramCache]: Analyzing trace with hash -81356198, now seen corresponding path program 1 times [2019-12-27 07:20:55,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:20:55,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341310103] [2019-12-27 07:20:55,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:20:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:20:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:20:55,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341310103] [2019-12-27 07:20:55,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:20:55,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:20:55,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908377753] [2019-12-27 07:20:55,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:20:55,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:20:55,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:20:55,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:20:55,625 INFO L87 Difference]: Start difference. First operand 7112 states and 19419 transitions. Second operand 5 states. [2019-12-27 07:20:55,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:20:55,667 INFO L93 Difference]: Finished difference Result 5025 states and 14423 transitions. [2019-12-27 07:20:55,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:20:55,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 07:20:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:20:55,674 INFO L225 Difference]: With dead ends: 5025 [2019-12-27 07:20:55,675 INFO L226 Difference]: Without dead ends: 5025 [2019-12-27 07:20:55,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:20:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2019-12-27 07:20:55,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4661. [2019-12-27 07:20:55,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2019-12-27 07:20:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 13439 transitions. [2019-12-27 07:20:55,740 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 13439 transitions. Word has length 37 [2019-12-27 07:20:55,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:20:55,741 INFO L462 AbstractCegarLoop]: Abstraction has 4661 states and 13439 transitions. [2019-12-27 07:20:55,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:20:55,741 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 13439 transitions. [2019-12-27 07:20:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:20:55,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:20:55,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:20:55,750 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:20:55,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:20:55,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2136434843, now seen corresponding path program 1 times [2019-12-27 07:20:55,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:20:55,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756404805] [2019-12-27 07:20:55,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:20:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:20:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:20:55,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756404805] [2019-12-27 07:20:55,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:20:55,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:20:55,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752160423] [2019-12-27 07:20:55,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:20:55,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:20:55,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:20:55,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:20:55,824 INFO L87 Difference]: Start difference. First operand 4661 states and 13439 transitions. Second operand 3 states. [2019-12-27 07:20:55,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:20:55,876 INFO L93 Difference]: Finished difference Result 4670 states and 13453 transitions. [2019-12-27 07:20:55,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:20:55,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:20:55,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:20:55,884 INFO L225 Difference]: With dead ends: 4670 [2019-12-27 07:20:55,884 INFO L226 Difference]: Without dead ends: 4670 [2019-12-27 07:20:55,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:20:55,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-27 07:20:55,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-27 07:20:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-27 07:20:55,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13449 transitions. [2019-12-27 07:20:55,971 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13449 transitions. Word has length 65 [2019-12-27 07:20:55,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:20:55,972 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13449 transitions. [2019-12-27 07:20:55,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:20:55,972 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13449 transitions. [2019-12-27 07:20:55,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:20:55,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:20:55,981 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:20:55,981 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:20:55,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:20:55,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1287100776, now seen corresponding path program 1 times [2019-12-27 07:20:55,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:20:55,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103402525] [2019-12-27 07:20:55,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:20:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:20:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:20:56,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103402525] [2019-12-27 07:20:56,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:20:56,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:20:56,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818375654] [2019-12-27 07:20:56,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:20:56,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:20:56,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:20:56,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:20:56,047 INFO L87 Difference]: Start difference. First operand 4666 states and 13449 transitions. Second operand 3 states. [2019-12-27 07:20:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:20:56,104 INFO L93 Difference]: Finished difference Result 4670 states and 13443 transitions. [2019-12-27 07:20:56,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:20:56,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:20:56,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:20:56,113 INFO L225 Difference]: With dead ends: 4670 [2019-12-27 07:20:56,114 INFO L226 Difference]: Without dead ends: 4670 [2019-12-27 07:20:56,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:20:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-27 07:20:56,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-27 07:20:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-27 07:20:56,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13439 transitions. [2019-12-27 07:20:56,208 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13439 transitions. Word has length 65 [2019-12-27 07:20:56,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:20:56,208 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13439 transitions. [2019-12-27 07:20:56,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:20:56,208 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13439 transitions. [2019-12-27 07:20:56,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:20:56,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:20:56,217 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:20:56,217 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:20:56,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:20:56,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1294757063, now seen corresponding path program 1 times [2019-12-27 07:20:56,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:20:56,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534783914] [2019-12-27 07:20:56,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:20:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:20:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:20:56,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534783914] [2019-12-27 07:20:56,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:20:56,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:20:56,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283881979] [2019-12-27 07:20:56,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:20:56,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:20:56,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:20:56,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:20:56,316 INFO L87 Difference]: Start difference. First operand 4666 states and 13439 transitions. Second operand 3 states. [2019-12-27 07:20:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:20:56,344 INFO L93 Difference]: Finished difference Result 4414 states and 12534 transitions. [2019-12-27 07:20:56,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:20:56,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:20:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:20:56,351 INFO L225 Difference]: With dead ends: 4414 [2019-12-27 07:20:56,352 INFO L226 Difference]: Without dead ends: 4414 [2019-12-27 07:20:56,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:20:56,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4414 states. [2019-12-27 07:20:56,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4414 to 4414. [2019-12-27 07:20:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4414 states. [2019-12-27 07:20:56,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4414 states to 4414 states and 12534 transitions. [2019-12-27 07:20:56,446 INFO L78 Accepts]: Start accepts. Automaton has 4414 states and 12534 transitions. Word has length 65 [2019-12-27 07:20:56,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:20:56,446 INFO L462 AbstractCegarLoop]: Abstraction has 4414 states and 12534 transitions. [2019-12-27 07:20:56,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:20:56,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4414 states and 12534 transitions. [2019-12-27 07:20:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:20:56,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:20:56,457 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:20:56,457 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:20:56,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:20:56,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1361414887, now seen corresponding path program 1 times [2019-12-27 07:20:56,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:20:56,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423966068] [2019-12-27 07:20:56,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:20:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:20:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:20:56,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423966068] [2019-12-27 07:20:56,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:20:56,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:20:56,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399067377] [2019-12-27 07:20:56,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:20:56,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:20:56,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:20:56,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:20:56,553 INFO L87 Difference]: Start difference. First operand 4414 states and 12534 transitions. Second operand 5 states. [2019-12-27 07:20:58,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:20:58,181 INFO L93 Difference]: Finished difference Result 7038 states and 19759 transitions. [2019-12-27 07:20:58,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:20:58,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 07:20:58,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:20:58,192 INFO L225 Difference]: With dead ends: 7038 [2019-12-27 07:20:58,192 INFO L226 Difference]: Without dead ends: 7038 [2019-12-27 07:20:58,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:20:58,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7038 states. [2019-12-27 07:20:58,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7038 to 4840. [2019-12-27 07:20:58,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4840 states. [2019-12-27 07:20:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4840 states to 4840 states and 13808 transitions. [2019-12-27 07:20:58,277 INFO L78 Accepts]: Start accepts. Automaton has 4840 states and 13808 transitions. Word has length 66 [2019-12-27 07:20:58,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:20:58,277 INFO L462 AbstractCegarLoop]: Abstraction has 4840 states and 13808 transitions. [2019-12-27 07:20:58,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:20:58,277 INFO L276 IsEmpty]: Start isEmpty. Operand 4840 states and 13808 transitions. [2019-12-27 07:20:58,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:20:58,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:20:58,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:20:58,284 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:20:58,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:20:58,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1912682329, now seen corresponding path program 2 times [2019-12-27 07:20:58,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:20:58,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325020147] [2019-12-27 07:20:58,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:20:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:20:58,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:20:58,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325020147] [2019-12-27 07:20:58,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:20:58,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:20:58,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231830439] [2019-12-27 07:20:58,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:20:58,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:20:58,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:20:58,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:20:58,412 INFO L87 Difference]: Start difference. First operand 4840 states and 13808 transitions. Second operand 7 states. [2019-12-27 07:20:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:20:58,873 INFO L93 Difference]: Finished difference Result 7012 states and 19685 transitions. [2019-12-27 07:20:58,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:20:58,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 07:20:58,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:20:58,884 INFO L225 Difference]: With dead ends: 7012 [2019-12-27 07:20:58,885 INFO L226 Difference]: Without dead ends: 7012 [2019-12-27 07:20:58,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:20:58,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7012 states. [2019-12-27 07:20:58,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7012 to 5533. [2019-12-27 07:20:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5533 states. [2019-12-27 07:20:59,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5533 states to 5533 states and 15753 transitions. [2019-12-27 07:20:59,008 INFO L78 Accepts]: Start accepts. Automaton has 5533 states and 15753 transitions. Word has length 66 [2019-12-27 07:20:59,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:20:59,009 INFO L462 AbstractCegarLoop]: Abstraction has 5533 states and 15753 transitions. [2019-12-27 07:20:59,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:20:59,009 INFO L276 IsEmpty]: Start isEmpty. Operand 5533 states and 15753 transitions. [2019-12-27 07:20:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:20:59,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:20:59,019 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:20:59,019 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:20:59,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:20:59,020 INFO L82 PathProgramCache]: Analyzing trace with hash -710018751, now seen corresponding path program 3 times [2019-12-27 07:20:59,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:20:59,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708576811] [2019-12-27 07:20:59,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:20:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:20:59,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:20:59,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708576811] [2019-12-27 07:20:59,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:20:59,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:20:59,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855283023] [2019-12-27 07:20:59,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:20:59,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:20:59,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:20:59,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:20:59,121 INFO L87 Difference]: Start difference. First operand 5533 states and 15753 transitions. Second operand 6 states. [2019-12-27 07:20:59,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:20:59,616 INFO L93 Difference]: Finished difference Result 7599 states and 21224 transitions. [2019-12-27 07:20:59,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 07:20:59,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 07:20:59,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:20:59,627 INFO L225 Difference]: With dead ends: 7599 [2019-12-27 07:20:59,629 INFO L226 Difference]: Without dead ends: 7599 [2019-12-27 07:20:59,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:20:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7599 states. [2019-12-27 07:20:59,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7599 to 5932. [2019-12-27 07:20:59,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5932 states. [2019-12-27 07:20:59,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5932 states to 5932 states and 16732 transitions. [2019-12-27 07:20:59,723 INFO L78 Accepts]: Start accepts. Automaton has 5932 states and 16732 transitions. Word has length 66 [2019-12-27 07:20:59,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:20:59,724 INFO L462 AbstractCegarLoop]: Abstraction has 5932 states and 16732 transitions. [2019-12-27 07:20:59,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:20:59,724 INFO L276 IsEmpty]: Start isEmpty. Operand 5932 states and 16732 transitions. [2019-12-27 07:20:59,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:20:59,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:20:59,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:20:59,732 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:20:59,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:20:59,732 INFO L82 PathProgramCache]: Analyzing trace with hash -397995211, now seen corresponding path program 4 times [2019-12-27 07:20:59,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:20:59,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283207371] [2019-12-27 07:20:59,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:20:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:20:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:20:59,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283207371] [2019-12-27 07:20:59,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:20:59,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:20:59,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521659426] [2019-12-27 07:20:59,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:20:59,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:20:59,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:20:59,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:20:59,834 INFO L87 Difference]: Start difference. First operand 5932 states and 16732 transitions. Second operand 7 states. [2019-12-27 07:21:00,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:21:00,562 INFO L93 Difference]: Finished difference Result 8663 states and 24095 transitions. [2019-12-27 07:21:00,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 07:21:00,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 07:21:00,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:21:00,574 INFO L225 Difference]: With dead ends: 8663 [2019-12-27 07:21:00,574 INFO L226 Difference]: Without dead ends: 8663 [2019-12-27 07:21:00,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:21:00,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8663 states. [2019-12-27 07:21:00,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8663 to 5848. [2019-12-27 07:21:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5848 states. [2019-12-27 07:21:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5848 states to 5848 states and 16506 transitions. [2019-12-27 07:21:00,730 INFO L78 Accepts]: Start accepts. Automaton has 5848 states and 16506 transitions. Word has length 66 [2019-12-27 07:21:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:21:00,731 INFO L462 AbstractCegarLoop]: Abstraction has 5848 states and 16506 transitions. [2019-12-27 07:21:00,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:21:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 5848 states and 16506 transitions. [2019-12-27 07:21:00,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:21:00,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:21:00,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:21:00,743 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:21:00,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:21:00,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1480872019, now seen corresponding path program 5 times [2019-12-27 07:21:00,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:21:00,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698490005] [2019-12-27 07:21:00,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:21:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:21:00,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:21:00,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698490005] [2019-12-27 07:21:00,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:21:00,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:21:00,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302477528] [2019-12-27 07:21:00,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:21:00,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:21:00,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:21:00,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:21:00,844 INFO L87 Difference]: Start difference. First operand 5848 states and 16506 transitions. Second operand 5 states. [2019-12-27 07:21:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:21:01,052 INFO L93 Difference]: Finished difference Result 7639 states and 21271 transitions. [2019-12-27 07:21:01,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:21:01,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 07:21:01,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:21:01,063 INFO L225 Difference]: With dead ends: 7639 [2019-12-27 07:21:01,063 INFO L226 Difference]: Without dead ends: 7639 [2019-12-27 07:21:01,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:21:01,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7639 states. [2019-12-27 07:21:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7639 to 6002. [2019-12-27 07:21:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6002 states. [2019-12-27 07:21:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6002 states to 6002 states and 16932 transitions. [2019-12-27 07:21:01,150 INFO L78 Accepts]: Start accepts. Automaton has 6002 states and 16932 transitions. Word has length 66 [2019-12-27 07:21:01,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:21:01,150 INFO L462 AbstractCegarLoop]: Abstraction has 6002 states and 16932 transitions. [2019-12-27 07:21:01,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:21:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 6002 states and 16932 transitions. [2019-12-27 07:21:01,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:21:01,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:21:01,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:21:01,158 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:21:01,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:21:01,159 INFO L82 PathProgramCache]: Analyzing trace with hash -745144111, now seen corresponding path program 6 times [2019-12-27 07:21:01,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:21:01,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704453859] [2019-12-27 07:21:01,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:21:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:21:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:21:01,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704453859] [2019-12-27 07:21:01,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:21:01,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:21:01,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776261877] [2019-12-27 07:21:01,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:21:01,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:21:01,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:21:01,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:21:01,254 INFO L87 Difference]: Start difference. First operand 6002 states and 16932 transitions. Second operand 6 states. [2019-12-27 07:21:01,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:21:01,738 INFO L93 Difference]: Finished difference Result 8592 states and 23897 transitions. [2019-12-27 07:21:01,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:21:01,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 07:21:01,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:21:01,751 INFO L225 Difference]: With dead ends: 8592 [2019-12-27 07:21:01,751 INFO L226 Difference]: Without dead ends: 8592 [2019-12-27 07:21:01,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:21:01,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8592 states. [2019-12-27 07:21:01,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8592 to 5694. [2019-12-27 07:21:01,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5694 states. [2019-12-27 07:21:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5694 states to 5694 states and 16080 transitions. [2019-12-27 07:21:01,922 INFO L78 Accepts]: Start accepts. Automaton has 5694 states and 16080 transitions. Word has length 66 [2019-12-27 07:21:01,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:21:01,923 INFO L462 AbstractCegarLoop]: Abstraction has 5694 states and 16080 transitions. [2019-12-27 07:21:01,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:21:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 5694 states and 16080 transitions. [2019-12-27 07:21:01,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:21:01,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:21:01,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:21:01,935 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:21:01,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:21:01,935 INFO L82 PathProgramCache]: Analyzing trace with hash 879933987, now seen corresponding path program 7 times [2019-12-27 07:21:01,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:21:01,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323412377] [2019-12-27 07:21:01,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:21:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:21:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:21:02,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323412377] [2019-12-27 07:21:02,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:21:02,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:21:02,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637821670] [2019-12-27 07:21:02,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:21:02,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:21:02,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:21:02,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:21:02,203 INFO L87 Difference]: Start difference. First operand 5694 states and 16080 transitions. Second operand 11 states. [2019-12-27 07:21:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:21:03,475 INFO L93 Difference]: Finished difference Result 9443 states and 26136 transitions. [2019-12-27 07:21:03,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 07:21:03,476 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 07:21:03,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:21:03,490 INFO L225 Difference]: With dead ends: 9443 [2019-12-27 07:21:03,490 INFO L226 Difference]: Without dead ends: 9443 [2019-12-27 07:21:03,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-27 07:21:03,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9443 states. [2019-12-27 07:21:03,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9443 to 5941. [2019-12-27 07:21:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5941 states. [2019-12-27 07:21:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5941 states to 5941 states and 16718 transitions. [2019-12-27 07:21:03,601 INFO L78 Accepts]: Start accepts. Automaton has 5941 states and 16718 transitions. Word has length 66 [2019-12-27 07:21:03,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:21:03,602 INFO L462 AbstractCegarLoop]: Abstraction has 5941 states and 16718 transitions. [2019-12-27 07:21:03,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:21:03,602 INFO L276 IsEmpty]: Start isEmpty. Operand 5941 states and 16718 transitions. [2019-12-27 07:21:03,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:21:03,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:21:03,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:21:03,608 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:21:03,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:21:03,609 INFO L82 PathProgramCache]: Analyzing trace with hash -74195049, now seen corresponding path program 8 times [2019-12-27 07:21:03,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:21:03,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213055912] [2019-12-27 07:21:03,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:21:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:21:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:21:03,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213055912] [2019-12-27 07:21:03,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:21:03,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:21:03,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547508685] [2019-12-27 07:21:03,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:21:03,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:21:03,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:21:03,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:21:03,681 INFO L87 Difference]: Start difference. First operand 5941 states and 16718 transitions. Second operand 3 states. [2019-12-27 07:21:03,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:21:03,739 INFO L93 Difference]: Finished difference Result 5941 states and 16717 transitions. [2019-12-27 07:21:03,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:21:03,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 07:21:03,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:21:03,748 INFO L225 Difference]: With dead ends: 5941 [2019-12-27 07:21:03,749 INFO L226 Difference]: Without dead ends: 5941 [2019-12-27 07:21:03,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-27 07:21:03,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5941 states. [2019-12-27 07:21:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5941 to 3641. [2019-12-27 07:21:03,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2019-12-27 07:21:03,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 10345 transitions. [2019-12-27 07:21:03,834 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 10345 transitions. Word has length 66 [2019-12-27 07:21:03,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:21:03,835 INFO L462 AbstractCegarLoop]: Abstraction has 3641 states and 10345 transitions. [2019-12-27 07:21:03,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:21:03,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 10345 transitions. [2019-12-27 07:21:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:21:03,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:21:03,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:21:03,840 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:21:03,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:21:03,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1093252188, now seen corresponding path program 1 times [2019-12-27 07:21:03,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:21:03,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856273529] [2019-12-27 07:21:03,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:21:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:21:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:21:03,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856273529] [2019-12-27 07:21:03,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:21:03,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:21:03,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563547381] [2019-12-27 07:21:03,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:21:03,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:21:03,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:21:03,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:21:03,976 INFO L87 Difference]: Start difference. First operand 3641 states and 10345 transitions. Second operand 7 states. [2019-12-27 07:21:04,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:21:04,087 INFO L93 Difference]: Finished difference Result 7942 states and 22782 transitions. [2019-12-27 07:21:04,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:21:04,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-27 07:21:04,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:21:04,094 INFO L225 Difference]: With dead ends: 7942 [2019-12-27 07:21:04,094 INFO L226 Difference]: Without dead ends: 4603 [2019-12-27 07:21:04,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:21:04,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4603 states. [2019-12-27 07:21:04,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4603 to 3425. [2019-12-27 07:21:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3425 states. [2019-12-27 07:21:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3425 states to 3425 states and 9733 transitions. [2019-12-27 07:21:04,148 INFO L78 Accepts]: Start accepts. Automaton has 3425 states and 9733 transitions. Word has length 67 [2019-12-27 07:21:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:21:04,148 INFO L462 AbstractCegarLoop]: Abstraction has 3425 states and 9733 transitions. [2019-12-27 07:21:04,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:21:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3425 states and 9733 transitions. [2019-12-27 07:21:04,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:21:04,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:21:04,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:21:04,152 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:21:04,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:21:04,152 INFO L82 PathProgramCache]: Analyzing trace with hash 471698454, now seen corresponding path program 2 times [2019-12-27 07:21:04,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:21:04,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713956361] [2019-12-27 07:21:04,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:21:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:21:04,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:21:04,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713956361] [2019-12-27 07:21:04,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:21:04,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:21:04,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382238656] [2019-12-27 07:21:04,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:21:04,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:21:04,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:21:04,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:21:04,208 INFO L87 Difference]: Start difference. First operand 3425 states and 9733 transitions. Second operand 3 states. [2019-12-27 07:21:04,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:21:04,229 INFO L93 Difference]: Finished difference Result 3259 states and 9107 transitions. [2019-12-27 07:21:04,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:21:04,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 07:21:04,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:21:04,234 INFO L225 Difference]: With dead ends: 3259 [2019-12-27 07:21:04,234 INFO L226 Difference]: Without dead ends: 3259 [2019-12-27 07:21:04,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:21:04,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3259 states. [2019-12-27 07:21:04,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3259 to 3091. [2019-12-27 07:21:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3091 states. [2019-12-27 07:21:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3091 states to 3091 states and 8645 transitions. [2019-12-27 07:21:04,296 INFO L78 Accepts]: Start accepts. Automaton has 3091 states and 8645 transitions. Word has length 67 [2019-12-27 07:21:04,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:21:04,297 INFO L462 AbstractCegarLoop]: Abstraction has 3091 states and 8645 transitions. [2019-12-27 07:21:04,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:21:04,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3091 states and 8645 transitions. [2019-12-27 07:21:04,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:21:04,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:21:04,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:21:04,301 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:21:04,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:21:04,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1986071826, now seen corresponding path program 1 times [2019-12-27 07:21:04,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:21:04,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590732101] [2019-12-27 07:21:04,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:21:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:21:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:21:04,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590732101] [2019-12-27 07:21:04,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:21:04,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:21:04,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357554387] [2019-12-27 07:21:04,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:21:04,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:21:04,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:21:04,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:21:04,431 INFO L87 Difference]: Start difference. First operand 3091 states and 8645 transitions. Second operand 6 states. [2019-12-27 07:21:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:21:04,528 INFO L93 Difference]: Finished difference Result 4836 states and 13450 transitions. [2019-12-27 07:21:04,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:21:04,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 07:21:04,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:21:04,533 INFO L225 Difference]: With dead ends: 4836 [2019-12-27 07:21:04,533 INFO L226 Difference]: Without dead ends: 2167 [2019-12-27 07:21:04,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:21:04,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2019-12-27 07:21:04,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 2167. [2019-12-27 07:21:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2167 states. [2019-12-27 07:21:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 6002 transitions. [2019-12-27 07:21:04,603 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 6002 transitions. Word has length 68 [2019-12-27 07:21:04,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:21:04,604 INFO L462 AbstractCegarLoop]: Abstraction has 2167 states and 6002 transitions. [2019-12-27 07:21:04,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:21:04,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 6002 transitions. [2019-12-27 07:21:04,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:21:04,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:21:04,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:21:04,609 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:21:04,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:21:04,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1952420056, now seen corresponding path program 2 times [2019-12-27 07:21:04,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:21:04,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555917693] [2019-12-27 07:21:04,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:21:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:21:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:21:04,853 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:21:04,855 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:21:04,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1804~0.base_20| 1)) (= v_~main$tmp_guard0~0_10 0) (= v_~x$r_buff1_thd1~0_19 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1804~0.base_20|) (= v_~__unbuffered_p0_EAX~0_8 0) (= 0 v_~weak$$choice0~0_8) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1804~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1804~0.base_20|) |v_ULTIMATE.start_main_~#t1804~0.offset_17| 0)) |v_#memory_int_21|) (= 0 v_~x$w_buff0_used~0_117) (= v_~x$w_buff1_used~0_74 0) (= 0 v_~x$r_buff0_thd2~0_26) (= v_~x~0_30 0) (= 0 v_~x$r_buff0_thd1~0_20) (= v_~y~0_14 0) (= v_~x$flush_delayed~0_16 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd0~0_47 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~x$r_buff0_thd0~0_79) (= 0 |v_#NULL.base_4|) (= 0 v_~x$w_buff1~0_29) (= 0 v_~__unbuffered_cnt~0_19) (= v_~x$r_buff1_thd2~0_19 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1804~0.base_20|)) (= |v_#NULL.offset_4| 0) (= v_~x$mem_tmp~0_11 0) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$r_buff0_thd3~0_19) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0~0_30) (= v_~main$tmp_guard1~0_12 0) (= |v_ULTIMATE.start_main_~#t1804~0.offset_17| 0) (= 0 v_~weak$$choice2~0_31) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1804~0.base_20| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ~x$w_buff0~0=v_~x$w_buff0~0_30, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ULTIMATE.start_main_~#t1805~0.offset=|v_ULTIMATE.start_main_~#t1805~0.offset_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_79, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ~x$w_buff1~0=v_~x$w_buff1~0_29, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_74, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t1805~0.base=|v_ULTIMATE.start_main_~#t1805~0.base_21|, ULTIMATE.start_main_~#t1806~0.offset=|v_ULTIMATE.start_main_~#t1806~0.offset_16|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ULTIMATE.start_main_~#t1804~0.base=|v_ULTIMATE.start_main_~#t1804~0.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_30, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_~#t1804~0.offset=|v_ULTIMATE.start_main_~#t1804~0.offset_17|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ULTIMATE.start_main_~#t1806~0.base=|v_ULTIMATE.start_main_~#t1806~0.base_20|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_47, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1805~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ULTIMATE.start_main_~#t1805~0.base, ULTIMATE.start_main_~#t1806~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1804~0.base, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1804~0.offset, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1806~0.base, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 07:21:04,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L805-1-->L807: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1805~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1805~0.base_11| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1805~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1805~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1805~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1805~0.base_11|) |v_ULTIMATE.start_main_~#t1805~0.offset_10| 1)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t1805~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1805~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1805~0.offset=|v_ULTIMATE.start_main_~#t1805~0.offset_10|, ULTIMATE.start_main_~#t1805~0.base=|v_ULTIMATE.start_main_~#t1805~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1805~0.offset, ULTIMATE.start_main_~#t1805~0.base] because there is no mapped edge [2019-12-27 07:21:04,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1806~0.base_9| 1)) (not (= |v_ULTIMATE.start_main_~#t1806~0.base_9| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1806~0.base_9|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1806~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1806~0.base_9|) |v_ULTIMATE.start_main_~#t1806~0.offset_8| 2)) |v_#memory_int_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1806~0.base_9| 4)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1806~0.base_9|) 0) (= |v_ULTIMATE.start_main_~#t1806~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1806~0.base=|v_ULTIMATE.start_main_~#t1806~0.base_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1806~0.offset=|v_ULTIMATE.start_main_~#t1806~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1806~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1806~0.offset] because there is no mapped edge [2019-12-27 07:21:04,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= 2 v_~x$w_buff0~0_17) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= 1 v_~x$w_buff0_used~0_80) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~x$w_buff0~0_18 v_~x$w_buff1~0_15) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff1_used~0_49 v_~x$w_buff0_used~0_81) (= (mod v_~x$w_buff1_used~0_49 256) 0)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_18, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_80} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 07:21:04,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1535361508 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1535361508 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out1535361508| ~x~0_In1535361508) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out1535361508| ~x$w_buff1~0_In1535361508)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1535361508, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1535361508, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1535361508, ~x~0=~x~0_In1535361508} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1535361508|, ~x$w_buff1~0=~x$w_buff1~0_In1535361508, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1535361508, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1535361508, ~x~0=~x~0_In1535361508} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 07:21:04,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 07:21:04,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In327457752 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In327457752 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out327457752|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In327457752 |P2Thread1of1ForFork2_#t~ite17_Out327457752|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In327457752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In327457752} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In327457752, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out327457752|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In327457752} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 07:21:04,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1931752099 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-1931752099 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-1931752099 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1931752099 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1931752099 |P2Thread1of1ForFork2_#t~ite18_Out-1931752099|)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out-1931752099| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1931752099, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1931752099, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1931752099, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1931752099} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1931752099, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1931752099, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1931752099, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1931752099|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1931752099} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 07:21:04,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out706251521| |P0Thread1of1ForFork0_#t~ite3_Out706251521|)) (.cse2 (= (mod ~x$w_buff1_used~0_In706251521 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In706251521 256)))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out706251521| ~x~0_In706251521) (or .cse1 .cse2)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out706251521| ~x$w_buff1~0_In706251521) .cse0 (not .cse2) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In706251521, ~x$w_buff1_used~0=~x$w_buff1_used~0_In706251521, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In706251521, ~x~0=~x~0_In706251521} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out706251521|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out706251521|, ~x$w_buff1~0=~x$w_buff1~0_In706251521, ~x$w_buff1_used~0=~x$w_buff1_used~0_In706251521, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In706251521, ~x~0=~x~0_In706251521} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 07:21:04,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1510290807 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1510290807 256)))) (or (and (= ~x$w_buff0_used~0_In-1510290807 |P0Thread1of1ForFork0_#t~ite5_Out-1510290807|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1510290807|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1510290807, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1510290807} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1510290807|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1510290807, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1510290807} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:21:04,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In488867288 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In488867288 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In488867288 256))) (.cse3 (= (mod ~x$r_buff0_thd1~0_In488867288 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out488867288|)) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In488867288 |P0Thread1of1ForFork0_#t~ite6_Out488867288|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In488867288, ~x$w_buff1_used~0=~x$w_buff1_used~0_In488867288, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In488867288, ~x$w_buff0_used~0=~x$w_buff0_used~0_In488867288} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out488867288|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In488867288, ~x$w_buff1_used~0=~x$w_buff1_used~0_In488867288, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In488867288, ~x$w_buff0_used~0=~x$w_buff0_used~0_In488867288} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:21:04,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-229369527 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-229369527 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out-229369527| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out-229369527| ~x$r_buff0_thd3~0_In-229369527) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-229369527, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229369527} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-229369527, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-229369527|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229369527} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 07:21:04,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-864056651 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-864056651 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-864056651 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-864056651 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite20_Out-864056651| ~x$r_buff1_thd3~0_In-864056651)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite20_Out-864056651| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-864056651, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-864056651, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-864056651, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-864056651} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-864056651|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-864056651, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-864056651, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-864056651, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-864056651} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 07:21:04,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_13)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 07:21:04,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In142638581 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In142638581 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out142638581| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out142638581| ~x$r_buff0_thd1~0_In142638581)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In142638581, ~x$w_buff0_used~0=~x$w_buff0_used~0_In142638581} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In142638581, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out142638581|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In142638581} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 07:21:04,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1939656142 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In1939656142 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1939656142 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1939656142 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In1939656142 |P0Thread1of1ForFork0_#t~ite8_Out1939656142|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1939656142|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1939656142, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1939656142, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1939656142, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1939656142} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1939656142, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1939656142|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1939656142, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1939656142, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1939656142} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:21:04,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L737-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 07:21:04,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1303266517 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1303266517 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1303266517|)) (and (= ~x$w_buff0_used~0_In1303266517 |P1Thread1of1ForFork1_#t~ite11_Out1303266517|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1303266517, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1303266517} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1303266517|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1303266517, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1303266517} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:21:04,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-727161971 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-727161971 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-727161971 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-727161971 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out-727161971| 0)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-727161971| ~x$w_buff1_used~0_In-727161971) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-727161971, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-727161971, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-727161971, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-727161971} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-727161971, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-727161971, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-727161971|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-727161971, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-727161971} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 07:21:04,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1881275904 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1881275904 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-1881275904)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In-1881275904 ~x$r_buff0_thd2~0_Out-1881275904)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1881275904, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1881275904} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1881275904|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1881275904, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1881275904} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:21:04,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-983466703 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-983466703 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-983466703 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-983466703 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-983466703 |P1Thread1of1ForFork1_#t~ite14_Out-983466703|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-983466703|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-983466703, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-983466703, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-983466703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-983466703} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-983466703, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-983466703, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-983466703, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-983466703|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-983466703} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:21:04,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 07:21:04,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 07:21:04,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In676056656 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In676056656 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite25_Out676056656| |ULTIMATE.start_main_#t~ite24_Out676056656|))) (or (and (not .cse0) (= ~x$w_buff1~0_In676056656 |ULTIMATE.start_main_#t~ite24_Out676056656|) (not .cse1) .cse2) (and (= ~x~0_In676056656 |ULTIMATE.start_main_#t~ite24_Out676056656|) (or .cse0 .cse1) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In676056656, ~x$w_buff1_used~0=~x$w_buff1_used~0_In676056656, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In676056656, ~x~0=~x~0_In676056656} OutVars{~x$w_buff1~0=~x$w_buff1~0_In676056656, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out676056656|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out676056656|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In676056656, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In676056656, ~x~0=~x~0_In676056656} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 07:21:04,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-829523701 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-829523701 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite26_Out-829523701|)) (and (= ~x$w_buff0_used~0_In-829523701 |ULTIMATE.start_main_#t~ite26_Out-829523701|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-829523701, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-829523701} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-829523701, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-829523701|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-829523701} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 07:21:04,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1415300131 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1415300131 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1415300131 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1415300131 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1415300131 |ULTIMATE.start_main_#t~ite27_Out-1415300131|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite27_Out-1415300131|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1415300131, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1415300131, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1415300131, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1415300131} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1415300131, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1415300131, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1415300131|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1415300131, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1415300131} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 07:21:04,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-717558100 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-717558100 256)))) (or (and (= |ULTIMATE.start_main_#t~ite28_Out-717558100| 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-717558100 |ULTIMATE.start_main_#t~ite28_Out-717558100|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-717558100, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-717558100} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-717558100, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-717558100|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-717558100} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 07:21:04,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-660308171 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-660308171 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-660308171 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-660308171 256)))) (or (and (= ~x$r_buff1_thd0~0_In-660308171 |ULTIMATE.start_main_#t~ite29_Out-660308171|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite29_Out-660308171|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-660308171, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-660308171, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-660308171, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-660308171} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-660308171, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-660308171|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-660308171, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-660308171, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-660308171} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 07:21:04,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_57 v_~x$r_buff0_thd0~0_56) (not (= (mod v_~weak$$choice2~0_21 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 07:21:04,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~x$flush_delayed~0_10 0) (= v_~x$mem_tmp~0_7 v_~x~0_25)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:21:04,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 07:21:05,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:21:05 BasicIcfg [2019-12-27 07:21:05,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:21:05,060 INFO L168 Benchmark]: Toolchain (without parser) took 102229.75 ms. Allocated memory was 137.4 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 99.1 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 985.5 MB. Max. memory is 7.1 GB. [2019-12-27 07:21:05,061 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 07:21:05,061 INFO L168 Benchmark]: CACSL2BoogieTranslator took 802.93 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 98.6 MB in the beginning and 154.2 MB in the end (delta: -55.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:21:05,062 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.02 ms. Allocated memory is still 201.9 MB. Free memory was 154.2 MB in the beginning and 150.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 07:21:05,063 INFO L168 Benchmark]: Boogie Preprocessor took 39.13 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 148.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:21:05,063 INFO L168 Benchmark]: RCFGBuilder took 841.79 ms. Allocated memory is still 201.9 MB. Free memory was 148.9 MB in the beginning and 98.7 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:21:05,064 INFO L168 Benchmark]: TraceAbstraction took 100466.06 ms. Allocated memory was 201.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 98.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 920.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:21:05,066 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.54 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 802.93 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 98.6 MB in the beginning and 154.2 MB in the end (delta: -55.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.02 ms. Allocated memory is still 201.9 MB. Free memory was 154.2 MB in the beginning and 150.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.13 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 148.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 841.79 ms. Allocated memory is still 201.9 MB. Free memory was 148.9 MB in the beginning and 98.7 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 100466.06 ms. Allocated memory was 201.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 98.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 920.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 174 ProgramPointsBefore, 96 ProgramPointsAfterwards, 211 TransitionsBefore, 109 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 28 ChoiceCompositions, 5983 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82010 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L807] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L727] 1 __unbuffered_p0_EAX = y [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L827] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L828] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L829] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L830] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L832] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 100.0s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 28.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3566 SDtfs, 2880 SDslu, 6992 SDs, 0 SdLazy, 4773 SolverSat, 189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 46 SyntacticMatches, 20 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203645occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 44.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 95802 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1135 NumberOfCodeBlocks, 1135 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1045 ConstructedInterpolants, 0 QuantifiedInterpolants, 173835 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...