/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/safe029_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:07:22,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:07:22,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:07:22,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:07:22,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:07:22,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:07:22,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:07:22,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:07:22,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:07:22,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:07:22,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:07:22,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:07:22,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:07:22,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:07:22,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:07:22,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:07:22,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:07:22,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:07:22,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:07:22,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:07:22,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:07:22,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:07:22,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:07:22,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:07:22,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:07:22,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:07:22,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:07:22,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:07:22,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:07:22,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:07:22,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:07:22,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:07:22,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:07:22,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:07:22,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:07:22,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:07:22,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:07:22,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:07:22,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:07:22,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:07:22,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:07:22,848 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 08:07:22,868 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:07:22,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:07:22,873 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:07:22,873 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:07:22,874 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:07:22,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:07:22,874 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:07:22,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:07:22,874 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:07:22,875 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:07:22,875 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:07:22,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:07:22,875 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:07:22,875 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:07:22,876 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:07:22,876 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:07:22,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:07:22,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:07:22,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:07:22,877 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:07:22,877 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:07:22,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:07:22,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:07:22,878 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:07:22,878 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:07:22,878 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:07:22,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:07:22,879 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 08:07:22,880 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:07:22,880 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:07:23,153 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:07:23,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:07:23,175 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:07:23,176 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:07:23,177 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:07:23,178 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2019-12-27 08:07:23,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cf38e652/ffe8851ce0ea49eb8b348be5a4abf521/FLAG33b7dc8cb [2019-12-27 08:07:23,807 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:07:23,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2019-12-27 08:07:23,825 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cf38e652/ffe8851ce0ea49eb8b348be5a4abf521/FLAG33b7dc8cb [2019-12-27 08:07:24,082 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cf38e652/ffe8851ce0ea49eb8b348be5a4abf521 [2019-12-27 08:07:24,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:07:24,093 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:07:24,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:07:24,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:07:24,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:07:24,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:07:24" (1/1) ... [2019-12-27 08:07:24,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a85eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:24, skipping insertion in model container [2019-12-27 08:07:24,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:07:24" (1/1) ... [2019-12-27 08:07:24,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:07:24,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:07:24,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:07:24,680 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:07:24,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:07:24,862 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:07:24,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:24 WrapperNode [2019-12-27 08:07:24,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:07:24,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:07:24,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:07:24,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:07:24,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:24" (1/1) ... [2019-12-27 08:07:24,903 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:24" (1/1) ... [2019-12-27 08:07:24,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:07:24,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:07:24,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:07:24,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:07:24,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:24" (1/1) ... [2019-12-27 08:07:24,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:24" (1/1) ... [2019-12-27 08:07:24,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:24" (1/1) ... [2019-12-27 08:07:24,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:24" (1/1) ... [2019-12-27 08:07:24,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:24" (1/1) ... [2019-12-27 08:07:24,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:24" (1/1) ... [2019-12-27 08:07:24,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:24" (1/1) ... [2019-12-27 08:07:24,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:07:24,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:07:24,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:07:24,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:07:24,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:24" (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 08:07:25,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:07:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 08:07:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:07:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:07:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 08:07:25,067 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 08:07:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 08:07:25,067 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 08:07:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 08:07:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:07:25,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:07:25,069 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 08:07:25,708 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:07:25,709 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 08:07:25,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:07:25 BoogieIcfgContainer [2019-12-27 08:07:25,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:07:25,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:07:25,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:07:25,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:07:25,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:07:24" (1/3) ... [2019-12-27 08:07:25,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126e2aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:07:25, skipping insertion in model container [2019-12-27 08:07:25,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:24" (2/3) ... [2019-12-27 08:07:25,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126e2aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:07:25, skipping insertion in model container [2019-12-27 08:07:25,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:07:25" (3/3) ... [2019-12-27 08:07:25,720 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_pso.opt.i [2019-12-27 08:07:25,731 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:07:25,731 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:07:25,739 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 08:07:25,740 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:07:25,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,775 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,775 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,785 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,785 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,785 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,786 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,786 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,799 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,799 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,802 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,803 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,803 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:25,822 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 08:07:25,844 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:07:25,845 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:07:25,845 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:07:25,845 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:07:25,845 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:07:25,845 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:07:25,846 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:07:25,846 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:07:25,864 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-27 08:07:25,866 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 08:07:25,970 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 08:07:25,970 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:07:25,984 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 253 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 08:07:26,005 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 08:07:26,046 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 08:07:26,046 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:07:26,052 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 253 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 08:07:26,067 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 08:07:26,069 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:07:29,013 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-27 08:07:29,135 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48808 [2019-12-27 08:07:29,135 INFO L214 etLargeBlockEncoding]: Total number of compositions: 95 [2019-12-27 08:07:29,138 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-27 08:07:29,667 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8608 states. [2019-12-27 08:07:29,669 INFO L276 IsEmpty]: Start isEmpty. Operand 8608 states. [2019-12-27 08:07:29,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 08:07:29,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:29,677 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 08:07:29,678 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:29,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:29,687 INFO L82 PathProgramCache]: Analyzing trace with hash 688178079, now seen corresponding path program 1 times [2019-12-27 08:07:29,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:29,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222686829] [2019-12-27 08:07:29,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:29,945 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 08:07:29,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222686829] [2019-12-27 08:07:29,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:29,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:07:29,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165838416] [2019-12-27 08:07:29,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:07:29,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:29,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:07:29,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:07:29,971 INFO L87 Difference]: Start difference. First operand 8608 states. Second operand 3 states. [2019-12-27 08:07:30,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:30,269 INFO L93 Difference]: Finished difference Result 8560 states and 27962 transitions. [2019-12-27 08:07:30,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:07:30,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 08:07:30,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:30,369 INFO L225 Difference]: With dead ends: 8560 [2019-12-27 08:07:30,369 INFO L226 Difference]: Without dead ends: 8391 [2019-12-27 08:07:30,370 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 08:07:30,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8391 states. [2019-12-27 08:07:30,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8391 to 8391. [2019-12-27 08:07:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8391 states. [2019-12-27 08:07:30,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8391 states to 8391 states and 27442 transitions. [2019-12-27 08:07:30,805 INFO L78 Accepts]: Start accepts. Automaton has 8391 states and 27442 transitions. Word has length 5 [2019-12-27 08:07:30,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:30,806 INFO L462 AbstractCegarLoop]: Abstraction has 8391 states and 27442 transitions. [2019-12-27 08:07:30,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:07:30,806 INFO L276 IsEmpty]: Start isEmpty. Operand 8391 states and 27442 transitions. [2019-12-27 08:07:30,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 08:07:30,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:30,812 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:30,812 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:30,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:30,813 INFO L82 PathProgramCache]: Analyzing trace with hash 530797982, now seen corresponding path program 1 times [2019-12-27 08:07:30,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:30,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677871830] [2019-12-27 08:07:30,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:30,940 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 08:07:30,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677871830] [2019-12-27 08:07:30,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:30,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:07:30,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69073893] [2019-12-27 08:07:30,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:07:30,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:30,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:07:30,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:07:30,944 INFO L87 Difference]: Start difference. First operand 8391 states and 27442 transitions. Second operand 4 states. [2019-12-27 08:07:31,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:31,363 INFO L93 Difference]: Finished difference Result 13399 states and 41962 transitions. [2019-12-27 08:07:31,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:07:31,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 08:07:31,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:31,432 INFO L225 Difference]: With dead ends: 13399 [2019-12-27 08:07:31,433 INFO L226 Difference]: Without dead ends: 13392 [2019-12-27 08:07:31,434 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 08:07:31,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13392 states. [2019-12-27 08:07:31,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13392 to 12075. [2019-12-27 08:07:31,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12075 states. [2019-12-27 08:07:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12075 states to 12075 states and 38370 transitions. [2019-12-27 08:07:31,855 INFO L78 Accepts]: Start accepts. Automaton has 12075 states and 38370 transitions. Word has length 11 [2019-12-27 08:07:31,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:31,855 INFO L462 AbstractCegarLoop]: Abstraction has 12075 states and 38370 transitions. [2019-12-27 08:07:31,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:07:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand 12075 states and 38370 transitions. [2019-12-27 08:07:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 08:07:31,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:31,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:31,858 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:31,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:31,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1942568878, now seen corresponding path program 1 times [2019-12-27 08:07:31,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:31,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416540211] [2019-12-27 08:07:31,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:07:31,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416540211] [2019-12-27 08:07:31,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:31,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:07:31,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762367765] [2019-12-27 08:07:31,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:07:31,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:31,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:07:31,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:07:31,946 INFO L87 Difference]: Start difference. First operand 12075 states and 38370 transitions. Second operand 4 states. [2019-12-27 08:07:32,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:32,710 INFO L93 Difference]: Finished difference Result 15134 states and 47650 transitions. [2019-12-27 08:07:32,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:07:32,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 08:07:32,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:32,759 INFO L225 Difference]: With dead ends: 15134 [2019-12-27 08:07:32,760 INFO L226 Difference]: Without dead ends: 15134 [2019-12-27 08:07:32,760 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 08:07:32,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15134 states. [2019-12-27 08:07:33,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15134 to 13358. [2019-12-27 08:07:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13358 states. [2019-12-27 08:07:33,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13358 states to 13358 states and 42395 transitions. [2019-12-27 08:07:33,296 INFO L78 Accepts]: Start accepts. Automaton has 13358 states and 42395 transitions. Word has length 11 [2019-12-27 08:07:33,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:33,297 INFO L462 AbstractCegarLoop]: Abstraction has 13358 states and 42395 transitions. [2019-12-27 08:07:33,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:07:33,297 INFO L276 IsEmpty]: Start isEmpty. Operand 13358 states and 42395 transitions. [2019-12-27 08:07:33,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 08:07:33,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:33,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:33,304 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:33,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:33,304 INFO L82 PathProgramCache]: Analyzing trace with hash -608680593, now seen corresponding path program 1 times [2019-12-27 08:07:33,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:33,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393486982] [2019-12-27 08:07:33,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:33,460 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 08:07:33,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393486982] [2019-12-27 08:07:33,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:33,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:07:33,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856620119] [2019-12-27 08:07:33,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:07:33,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:33,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:07:33,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:07:33,469 INFO L87 Difference]: Start difference. First operand 13358 states and 42395 transitions. Second operand 6 states. [2019-12-27 08:07:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:34,122 INFO L93 Difference]: Finished difference Result 20458 states and 63354 transitions. [2019-12-27 08:07:34,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 08:07:34,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 08:07:34,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:34,177 INFO L225 Difference]: With dead ends: 20458 [2019-12-27 08:07:34,177 INFO L226 Difference]: Without dead ends: 20451 [2019-12-27 08:07:34,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 08:07:34,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20451 states. [2019-12-27 08:07:34,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20451 to 13283. [2019-12-27 08:07:34,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13283 states. [2019-12-27 08:07:34,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13283 states to 13283 states and 42092 transitions. [2019-12-27 08:07:34,737 INFO L78 Accepts]: Start accepts. Automaton has 13283 states and 42092 transitions. Word has length 17 [2019-12-27 08:07:34,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:34,737 INFO L462 AbstractCegarLoop]: Abstraction has 13283 states and 42092 transitions. [2019-12-27 08:07:34,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:07:34,738 INFO L276 IsEmpty]: Start isEmpty. Operand 13283 states and 42092 transitions. [2019-12-27 08:07:34,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:07:34,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:34,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, 1, 1] [2019-12-27 08:07:34,745 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:34,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:34,745 INFO L82 PathProgramCache]: Analyzing trace with hash 707253983, now seen corresponding path program 1 times [2019-12-27 08:07:34,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:34,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657697575] [2019-12-27 08:07:34,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:34,891 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 08:07:34,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657697575] [2019-12-27 08:07:34,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:34,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:07:34,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83614190] [2019-12-27 08:07:34,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:07:34,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:34,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:07:34,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:07:34,893 INFO L87 Difference]: Start difference. First operand 13283 states and 42092 transitions. Second operand 7 states. [2019-12-27 08:07:35,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:35,675 INFO L93 Difference]: Finished difference Result 20164 states and 62436 transitions. [2019-12-27 08:07:35,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 08:07:35,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-12-27 08:07:35,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:35,723 INFO L225 Difference]: With dead ends: 20164 [2019-12-27 08:07:35,724 INFO L226 Difference]: Without dead ends: 20164 [2019-12-27 08:07:35,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:07:35,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20164 states. [2019-12-27 08:07:36,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20164 to 13400. [2019-12-27 08:07:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13400 states. [2019-12-27 08:07:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13400 states to 13400 states and 42374 transitions. [2019-12-27 08:07:36,389 INFO L78 Accepts]: Start accepts. Automaton has 13400 states and 42374 transitions. Word has length 21 [2019-12-27 08:07:36,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:36,390 INFO L462 AbstractCegarLoop]: Abstraction has 13400 states and 42374 transitions. [2019-12-27 08:07:36,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:07:36,390 INFO L276 IsEmpty]: Start isEmpty. Operand 13400 states and 42374 transitions. [2019-12-27 08:07:36,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:07:36,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:36,405 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 08:07:36,406 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:36,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:36,406 INFO L82 PathProgramCache]: Analyzing trace with hash -981631142, now seen corresponding path program 1 times [2019-12-27 08:07:36,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:36,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812103990] [2019-12-27 08:07:36,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:36,475 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 08:07:36,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812103990] [2019-12-27 08:07:36,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:36,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:07:36,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191695259] [2019-12-27 08:07:36,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:07:36,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:36,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:07:36,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:07:36,481 INFO L87 Difference]: Start difference. First operand 13400 states and 42374 transitions. Second operand 3 states. [2019-12-27 08:07:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:36,587 INFO L93 Difference]: Finished difference Result 16317 states and 50935 transitions. [2019-12-27 08:07:36,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:07:36,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 08:07:36,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:36,617 INFO L225 Difference]: With dead ends: 16317 [2019-12-27 08:07:36,617 INFO L226 Difference]: Without dead ends: 16317 [2019-12-27 08:07:36,617 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 08:07:36,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16317 states. [2019-12-27 08:07:36,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16317 to 14414. [2019-12-27 08:07:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14414 states. [2019-12-27 08:07:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14414 states to 14414 states and 45456 transitions. [2019-12-27 08:07:37,858 INFO L78 Accepts]: Start accepts. Automaton has 14414 states and 45456 transitions. Word has length 25 [2019-12-27 08:07:37,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:37,863 INFO L462 AbstractCegarLoop]: Abstraction has 14414 states and 45456 transitions. [2019-12-27 08:07:37,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:07:37,863 INFO L276 IsEmpty]: Start isEmpty. Operand 14414 states and 45456 transitions. [2019-12-27 08:07:37,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:07:37,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:37,881 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 08:07:37,882 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:37,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:37,883 INFO L82 PathProgramCache]: Analyzing trace with hash -981816243, now seen corresponding path program 1 times [2019-12-27 08:07:37,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:37,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049168621] [2019-12-27 08:07:37,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:37,978 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 08:07:37,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049168621] [2019-12-27 08:07:37,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:37,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:07:37,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792599198] [2019-12-27 08:07:37,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:07:37,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:37,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:07:37,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:07:37,981 INFO L87 Difference]: Start difference. First operand 14414 states and 45456 transitions. Second operand 4 states. [2019-12-27 08:07:38,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:38,008 INFO L93 Difference]: Finished difference Result 2334 states and 5320 transitions. [2019-12-27 08:07:38,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 08:07:38,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 08:07:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:38,011 INFO L225 Difference]: With dead ends: 2334 [2019-12-27 08:07:38,012 INFO L226 Difference]: Without dead ends: 2048 [2019-12-27 08:07:38,012 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 08:07:38,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2019-12-27 08:07:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2048. [2019-12-27 08:07:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2019-12-27 08:07:38,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 4529 transitions. [2019-12-27 08:07:38,033 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 4529 transitions. Word has length 25 [2019-12-27 08:07:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:38,033 INFO L462 AbstractCegarLoop]: Abstraction has 2048 states and 4529 transitions. [2019-12-27 08:07:38,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:07:38,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 4529 transitions. [2019-12-27 08:07:38,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 08:07:38,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:38,037 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 08:07:38,037 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:38,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:38,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1158183016, now seen corresponding path program 1 times [2019-12-27 08:07:38,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:38,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727068196] [2019-12-27 08:07:38,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:38,114 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 08:07:38,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727068196] [2019-12-27 08:07:38,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:38,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:07:38,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917385047] [2019-12-27 08:07:38,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:07:38,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:38,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:07:38,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:07:38,117 INFO L87 Difference]: Start difference. First operand 2048 states and 4529 transitions. Second operand 5 states. [2019-12-27 08:07:38,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:38,152 INFO L93 Difference]: Finished difference Result 426 states and 776 transitions. [2019-12-27 08:07:38,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:07:38,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 08:07:38,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:38,154 INFO L225 Difference]: With dead ends: 426 [2019-12-27 08:07:38,154 INFO L226 Difference]: Without dead ends: 380 [2019-12-27 08:07:38,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:07:38,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-12-27 08:07:38,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 345. [2019-12-27 08:07:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-27 08:07:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 621 transitions. [2019-12-27 08:07:38,159 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 621 transitions. Word has length 37 [2019-12-27 08:07:38,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:38,160 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 621 transitions. [2019-12-27 08:07:38,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:07:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 621 transitions. [2019-12-27 08:07:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 08:07:38,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:38,162 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:38,162 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:38,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:38,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1944342103, now seen corresponding path program 1 times [2019-12-27 08:07:38,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:38,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076050407] [2019-12-27 08:07:38,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:38,259 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 08:07:38,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076050407] [2019-12-27 08:07:38,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:38,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:07:38,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568069989] [2019-12-27 08:07:38,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:07:38,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:38,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:07:38,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:07:38,261 INFO L87 Difference]: Start difference. First operand 345 states and 621 transitions. Second operand 5 states. [2019-12-27 08:07:38,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:38,440 INFO L93 Difference]: Finished difference Result 476 states and 857 transitions. [2019-12-27 08:07:38,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:07:38,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 08:07:38,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:38,441 INFO L225 Difference]: With dead ends: 476 [2019-12-27 08:07:38,441 INFO L226 Difference]: Without dead ends: 476 [2019-12-27 08:07:38,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:07:38,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-12-27 08:07:38,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 435. [2019-12-27 08:07:38,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-12-27 08:07:38,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 785 transitions. [2019-12-27 08:07:38,447 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 785 transitions. Word has length 52 [2019-12-27 08:07:38,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:38,448 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 785 transitions. [2019-12-27 08:07:38,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:07:38,448 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 785 transitions. [2019-12-27 08:07:38,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 08:07:38,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:38,449 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:38,450 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:38,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:38,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1307256259, now seen corresponding path program 2 times [2019-12-27 08:07:38,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:38,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794124217] [2019-12-27 08:07:38,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:38,575 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 08:07:38,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794124217] [2019-12-27 08:07:38,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:38,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:07:38,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024536115] [2019-12-27 08:07:38,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:07:38,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:38,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:07:38,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:07:38,579 INFO L87 Difference]: Start difference. First operand 435 states and 785 transitions. Second operand 6 states. [2019-12-27 08:07:38,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:38,892 INFO L93 Difference]: Finished difference Result 658 states and 1193 transitions. [2019-12-27 08:07:38,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 08:07:38,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 08:07:38,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:38,894 INFO L225 Difference]: With dead ends: 658 [2019-12-27 08:07:38,894 INFO L226 Difference]: Without dead ends: 658 [2019-12-27 08:07:38,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:07:38,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-12-27 08:07:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 480. [2019-12-27 08:07:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-12-27 08:07:38,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 875 transitions. [2019-12-27 08:07:38,901 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 875 transitions. Word has length 52 [2019-12-27 08:07:38,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:38,902 INFO L462 AbstractCegarLoop]: Abstraction has 480 states and 875 transitions. [2019-12-27 08:07:38,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:07:38,902 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 875 transitions. [2019-12-27 08:07:38,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 08:07:38,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:38,903 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:38,904 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:38,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:38,904 INFO L82 PathProgramCache]: Analyzing trace with hash -438805035, now seen corresponding path program 3 times [2019-12-27 08:07:38,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:38,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811899050] [2019-12-27 08:07:38,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:38,966 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 08:07:38,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811899050] [2019-12-27 08:07:38,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:38,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:07:38,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313114574] [2019-12-27 08:07:38,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:07:38,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:38,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:07:38,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:07:38,968 INFO L87 Difference]: Start difference. First operand 480 states and 875 transitions. Second operand 3 states. [2019-12-27 08:07:38,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:38,979 INFO L93 Difference]: Finished difference Result 435 states and 770 transitions. [2019-12-27 08:07:38,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:07:38,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 08:07:38,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:38,980 INFO L225 Difference]: With dead ends: 435 [2019-12-27 08:07:38,980 INFO L226 Difference]: Without dead ends: 435 [2019-12-27 08:07:38,981 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 08:07:38,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-12-27 08:07:38,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 423. [2019-12-27 08:07:38,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-12-27 08:07:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 748 transitions. [2019-12-27 08:07:38,986 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 748 transitions. Word has length 52 [2019-12-27 08:07:38,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:38,986 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 748 transitions. [2019-12-27 08:07:38,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:07:38,987 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 748 transitions. [2019-12-27 08:07:38,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 08:07:38,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:38,988 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:38,988 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:38,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:38,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1410277969, now seen corresponding path program 1 times [2019-12-27 08:07:38,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:38,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279158303] [2019-12-27 08:07:38,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:39,074 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 08:07:39,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279158303] [2019-12-27 08:07:39,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:39,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:07:39,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019651045] [2019-12-27 08:07:39,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:07:39,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:39,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:07:39,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:07:39,077 INFO L87 Difference]: Start difference. First operand 423 states and 748 transitions. Second operand 3 states. [2019-12-27 08:07:39,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:39,121 INFO L93 Difference]: Finished difference Result 422 states and 746 transitions. [2019-12-27 08:07:39,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:07:39,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 08:07:39,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:39,123 INFO L225 Difference]: With dead ends: 422 [2019-12-27 08:07:39,123 INFO L226 Difference]: Without dead ends: 422 [2019-12-27 08:07:39,124 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 08:07:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-12-27 08:07:39,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 344. [2019-12-27 08:07:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-27 08:07:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 606 transitions. [2019-12-27 08:07:39,131 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 606 transitions. Word has length 53 [2019-12-27 08:07:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:39,131 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 606 transitions. [2019-12-27 08:07:39,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:07:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 606 transitions. [2019-12-27 08:07:39,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:07:39,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:39,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:39,134 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:39,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:39,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1173138387, now seen corresponding path program 1 times [2019-12-27 08:07:39,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:39,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486458716] [2019-12-27 08:07:39,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:39,382 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 08:07:39,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486458716] [2019-12-27 08:07:39,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:39,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:07:39,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529745015] [2019-12-27 08:07:39,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:07:39,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:39,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:07:39,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:07:39,386 INFO L87 Difference]: Start difference. First operand 344 states and 606 transitions. Second operand 6 states. [2019-12-27 08:07:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:39,457 INFO L93 Difference]: Finished difference Result 558 states and 985 transitions. [2019-12-27 08:07:39,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:07:39,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 08:07:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:39,459 INFO L225 Difference]: With dead ends: 558 [2019-12-27 08:07:39,459 INFO L226 Difference]: Without dead ends: 233 [2019-12-27 08:07:39,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:07:39,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-12-27 08:07:39,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 209. [2019-12-27 08:07:39,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-27 08:07:39,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 365 transitions. [2019-12-27 08:07:39,465 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 365 transitions. Word has length 54 [2019-12-27 08:07:39,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:39,465 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 365 transitions. [2019-12-27 08:07:39,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:07:39,465 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 365 transitions. [2019-12-27 08:07:39,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:07:39,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:39,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:39,466 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:39,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:39,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1337955311, now seen corresponding path program 2 times [2019-12-27 08:07:39,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:39,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034651310] [2019-12-27 08:07:39,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:39,722 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 08:07:39,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034651310] [2019-12-27 08:07:39,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:39,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 08:07:39,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053070496] [2019-12-27 08:07:39,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 08:07:39,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:39,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 08:07:39,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:07:39,724 INFO L87 Difference]: Start difference. First operand 209 states and 365 transitions. Second operand 13 states. [2019-12-27 08:07:40,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:40,234 INFO L93 Difference]: Finished difference Result 371 states and 631 transitions. [2019-12-27 08:07:40,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 08:07:40,234 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 08:07:40,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:40,235 INFO L225 Difference]: With dead ends: 371 [2019-12-27 08:07:40,235 INFO L226 Difference]: Without dead ends: 339 [2019-12-27 08:07:40,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2019-12-27 08:07:40,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-12-27 08:07:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 317. [2019-12-27 08:07:40,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-27 08:07:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 550 transitions. [2019-12-27 08:07:40,241 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 550 transitions. Word has length 54 [2019-12-27 08:07:40,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:40,242 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 550 transitions. [2019-12-27 08:07:40,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 08:07:40,242 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 550 transitions. [2019-12-27 08:07:40,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:07:40,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:40,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:40,243 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:40,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:40,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1370214765, now seen corresponding path program 3 times [2019-12-27 08:07:40,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:40,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42206011] [2019-12-27 08:07:40,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:40,763 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 08:07:40,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42206011] [2019-12-27 08:07:40,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:40,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 08:07:40,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797137274] [2019-12-27 08:07:40,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 08:07:40,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:40,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 08:07:40,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:07:40,766 INFO L87 Difference]: Start difference. First operand 317 states and 550 transitions. Second operand 20 states. [2019-12-27 08:07:42,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:42,434 INFO L93 Difference]: Finished difference Result 809 states and 1366 transitions. [2019-12-27 08:07:42,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 08:07:42,435 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-12-27 08:07:42,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:42,436 INFO L225 Difference]: With dead ends: 809 [2019-12-27 08:07:42,436 INFO L226 Difference]: Without dead ends: 777 [2019-12-27 08:07:42,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=316, Invalid=1406, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 08:07:42,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2019-12-27 08:07:42,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 325. [2019-12-27 08:07:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-12-27 08:07:42,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 565 transitions. [2019-12-27 08:07:42,443 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 565 transitions. Word has length 54 [2019-12-27 08:07:42,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:42,443 INFO L462 AbstractCegarLoop]: Abstraction has 325 states and 565 transitions. [2019-12-27 08:07:42,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 08:07:42,443 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 565 transitions. [2019-12-27 08:07:42,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:07:42,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:42,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:42,445 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:42,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:42,445 INFO L82 PathProgramCache]: Analyzing trace with hash 57952661, now seen corresponding path program 4 times [2019-12-27 08:07:42,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:42,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810917744] [2019-12-27 08:07:42,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:07:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:07:42,548 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:07:42,548 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:07:42,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~x$w_buff1~0_24) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t2479~0.base_19| 4) |v_#length_19|) (= 0 v_~weak$$choice0~0_8) (= v_~x$r_buff1_thd2~0_15 0) (= |v_ULTIMATE.start_main_~#t2479~0.offset_16| 0) (= v_~x$flush_delayed~0_15 0) (= v_~x~0_28 0) (= 0 v_~__unbuffered_cnt~0_13) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2479~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2479~0.base_19|) |v_ULTIMATE.start_main_~#t2479~0.offset_16| 0)) |v_#memory_int_17|) (= (store .cse0 |v_ULTIMATE.start_main_~#t2479~0.base_19| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2479~0.base_19|) (= 0 v_~x$w_buff0_used~0_107) (= v_~main$tmp_guard0~0_8 0) (= 0 v_~x$r_buff0_thd0~0_78) (= 0 v_~x$r_buff0_thd1~0_18) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~weak$$choice2~0_36) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2479~0.base_19|)) (= 0 v_~x$r_buff0_thd2~0_23) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_46 0) (= |v_#NULL.offset_5| 0) (= v_~x$mem_tmp~0_11 0) (= v_~x$w_buff1_used~0_64 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~y~0_11 0) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~x$w_buff0~0_29) (= v_~x$r_buff1_thd1~0_17 0) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_29, ULTIMATE.start_main_~#t2479~0.base=|v_ULTIMATE.start_main_~#t2479~0.base_19|, ULTIMATE.start_main_~#t2479~0.offset=|v_ULTIMATE.start_main_~#t2479~0.offset_16|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_16|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_17, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, #length=|v_#length_19|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_78, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_14|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ~x$w_buff1~0=v_~x$w_buff1~0_24, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_16|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_16|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_14|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~x~0=v_~x~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_18, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_13|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_14|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_13|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ~y~0=v_~y~0_11, ULTIMATE.start_main_~#t2480~0.base=|v_ULTIMATE.start_main_~#t2480~0.base_20|, ULTIMATE.start_main_~#t2480~0.offset=|v_ULTIMATE.start_main_~#t2480~0.offset_16|, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_13|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_11|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_46, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_16|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_107, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2479~0.base, ULTIMATE.start_main_~#t2479~0.offset, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_~#t2480~0.base, ULTIMATE.start_main_~#t2480~0.offset, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 08:07:42,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L777-1-->L779: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2480~0.base_10|) (= |v_ULTIMATE.start_main_~#t2480~0.offset_9| 0) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2480~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2480~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2480~0.base_10|) |v_ULTIMATE.start_main_~#t2480~0.offset_9| 1))) (not (= |v_ULTIMATE.start_main_~#t2480~0.base_10| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2480~0.base_10| 4)) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2480~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t2480~0.base=|v_ULTIMATE.start_main_~#t2480~0.base_10|, ULTIMATE.start_main_~#t2480~0.offset=|v_ULTIMATE.start_main_~#t2480~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2480~0.base, ULTIMATE.start_main_~#t2480~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 08:07:42,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] P1ENTRY-->L4-3: Formula: (and (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-1185342689 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1185342689|) (= ~x$w_buff0~0_Out-1185342689 2) (= 0 (mod ~x$w_buff1_used~0_Out-1185342689 256)) (= ~x$w_buff0~0_In-1185342689 ~x$w_buff1~0_Out-1185342689) (= |P1Thread1of1ForFork1_#in~arg.base_In-1185342689| P1Thread1of1ForFork1_~arg.base_Out-1185342689) (= ~x$w_buff0_used~0_Out-1185342689 1) (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1185342689| 1) (= ~x$w_buff1_used~0_Out-1185342689 ~x$w_buff0_used~0_In-1185342689) (= |P1Thread1of1ForFork1_#in~arg.offset_In-1185342689| P1Thread1of1ForFork1_~arg.offset_Out-1185342689)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1185342689, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-1185342689|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-1185342689|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1185342689} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-1185342689, ~x$w_buff0~0=~x$w_buff0~0_Out-1185342689, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out-1185342689, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1185342689|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out-1185342689, ~x$w_buff1~0=~x$w_buff1~0_Out-1185342689, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-1185342689|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-1185342689|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1185342689, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1185342689} 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 08:07:42,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L726-2-->L726-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In535165553 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In535165553 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out535165553| |P0Thread1of1ForFork0_#t~ite3_Out535165553|))) (or (and (not .cse0) (not .cse1) .cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out535165553| ~x$w_buff1~0_In535165553)) (and (or .cse0 .cse1) .cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out535165553| ~x~0_In535165553)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In535165553, ~x$w_buff1_used~0=~x$w_buff1_used~0_In535165553, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In535165553, ~x~0=~x~0_In535165553} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out535165553|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out535165553|, ~x$w_buff1~0=~x$w_buff1~0_In535165553, ~x$w_buff1_used~0=~x$w_buff1_used~0_In535165553, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In535165553, ~x~0=~x~0_In535165553} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 08:07:42,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-478029892 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-478029892 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-478029892|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-478029892 |P1Thread1of1ForFork1_#t~ite11_Out-478029892|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-478029892, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-478029892} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-478029892|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-478029892, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-478029892} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 08:07:42,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L727-->L727-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In728450581 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In728450581 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out728450581| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out728450581| ~x$w_buff0_used~0_In728450581) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In728450581, ~x$w_buff0_used~0=~x$w_buff0_used~0_In728450581} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out728450581|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In728450581, ~x$w_buff0_used~0=~x$w_buff0_used~0_In728450581} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 08:07:42,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L728-->L728-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In215810691 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In215810691 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In215810691 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In215810691 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out215810691| ~x$w_buff1_used~0_In215810691) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out215810691| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In215810691, ~x$w_buff1_used~0=~x$w_buff1_used~0_In215810691, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In215810691, ~x$w_buff0_used~0=~x$w_buff0_used~0_In215810691} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out215810691|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In215810691, ~x$w_buff1_used~0=~x$w_buff1_used~0_In215810691, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In215810691, ~x$w_buff0_used~0=~x$w_buff0_used~0_In215810691} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 08:07:42,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L729-->L729-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1729461046 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In1729461046 256) 0))) (or (and (= ~x$r_buff0_thd1~0_In1729461046 |P0Thread1of1ForFork0_#t~ite7_Out1729461046|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1729461046|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1729461046, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1729461046} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1729461046, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1729461046|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1729461046} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 08:07:42,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L730-->L730-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2015714118 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-2015714118 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-2015714118 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2015714118 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-2015714118| ~x$r_buff1_thd1~0_In-2015714118) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out-2015714118| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2015714118, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2015714118, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2015714118, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2015714118} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2015714118, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2015714118|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2015714118, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2015714118, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2015714118} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 08:07:42,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L730-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_13 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} 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_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_13} 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 08:07:42,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L756-->L756-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In1403978686 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1403978686 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1403978686 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1403978686 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1403978686 |P1Thread1of1ForFork1_#t~ite12_Out1403978686|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1403978686|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1403978686, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1403978686, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1403978686, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1403978686} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1403978686, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1403978686, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1403978686|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1403978686, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1403978686} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 08:07:42,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L757-->L758: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-858971958 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-858971958 256)))) (or (and (= 0 ~x$r_buff0_thd2~0_Out-858971958) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-858971958 ~x$r_buff0_thd2~0_Out-858971958) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-858971958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-858971958} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-858971958|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-858971958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-858971958} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 08:07:42,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L758-->L758-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-494064678 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-494064678 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-494064678 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-494064678 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-494064678| ~x$r_buff1_thd2~0_In-494064678) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-494064678|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-494064678, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-494064678, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-494064678, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-494064678} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-494064678, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-494064678, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-494064678, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-494064678|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-494064678} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 08:07:42,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L758-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_11 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, 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_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, 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 08:07:42,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [585] [585] L783-->L785-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~x$r_buff0_thd0~0_47 256) 0) (= (mod v_~x$w_buff0_used~0_70 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 08:07:42,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L785-2-->L785-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-473066989 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-473066989 256)))) (or (and (= ~x$w_buff1~0_In-473066989 |ULTIMATE.start_main_#t~ite17_Out-473066989|) (not .cse0) (not .cse1)) (and (= ~x~0_In-473066989 |ULTIMATE.start_main_#t~ite17_Out-473066989|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-473066989, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-473066989, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-473066989, ~x~0=~x~0_In-473066989} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-473066989|, ~x$w_buff1~0=~x$w_buff1~0_In-473066989, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-473066989, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-473066989, ~x~0=~x~0_In-473066989} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 08:07:42,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L785-4-->L786: Formula: (= v_~x~0_19 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-27 08:07:42,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In386449535 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In386449535 256)))) (or (and (= ~x$w_buff0_used~0_In386449535 |ULTIMATE.start_main_#t~ite19_Out386449535|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out386449535|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In386449535, ~x$w_buff0_used~0=~x$w_buff0_used~0_In386449535} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In386449535, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out386449535|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In386449535} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 08:07:42,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-->L787-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In-1127477899 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1127477899 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1127477899 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1127477899 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite20_Out-1127477899|)) (and (= ~x$w_buff1_used~0_In-1127477899 |ULTIMATE.start_main_#t~ite20_Out-1127477899|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1127477899, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1127477899, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1127477899, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1127477899} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1127477899, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1127477899, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1127477899|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1127477899, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1127477899} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 08:07:42,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In593421342 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In593421342 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In593421342 |ULTIMATE.start_main_#t~ite21_Out593421342|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out593421342|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In593421342, ~x$w_buff0_used~0=~x$w_buff0_used~0_In593421342} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In593421342, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out593421342|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In593421342} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 08:07:42,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1133523257 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1133523257 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1133523257 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1133523257 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-1133523257 |ULTIMATE.start_main_#t~ite22_Out-1133523257|)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-1133523257|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1133523257, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1133523257, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1133523257, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1133523257} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1133523257, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1133523257, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1133523257, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1133523257|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1133523257} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 08:07:42,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L800-->L800-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-93569361 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-93569361 256))) (.cse5 (= (mod ~x$w_buff0_used~0_In-93569361 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite38_Out-93569361| |ULTIMATE.start_main_#t~ite37_Out-93569361|)) (.cse4 (= 0 (mod ~x$r_buff1_thd0~0_In-93569361 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-93569361 256)))) (or (and (or (and .cse0 .cse1 (= ~x$w_buff1_used~0_In-93569361 |ULTIMATE.start_main_#t~ite37_Out-93569361|) (or (and .cse2 .cse3) (and .cse4 .cse2) .cse5)) (and (= |ULTIMATE.start_main_#t~ite37_In-93569361| |ULTIMATE.start_main_#t~ite37_Out-93569361|) (not .cse0) (= ~x$w_buff1_used~0_In-93569361 |ULTIMATE.start_main_#t~ite38_Out-93569361|))) (= |ULTIMATE.start_main_#t~ite36_In-93569361| |ULTIMATE.start_main_#t~ite36_Out-93569361|)) (let ((.cse6 (not .cse2))) (and .cse0 (= |ULTIMATE.start_main_#t~ite36_Out-93569361| 0) (or (not .cse3) .cse6) (not .cse5) .cse1 (= |ULTIMATE.start_main_#t~ite36_Out-93569361| |ULTIMATE.start_main_#t~ite37_Out-93569361|) (or .cse6 (not .cse4)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-93569361, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-93569361, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In-93569361|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-93569361|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-93569361, ~weak$$choice2~0=~weak$$choice2~0_In-93569361, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-93569361} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-93569361, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-93569361, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-93569361|, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-93569361|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-93569361|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-93569361, ~weak$$choice2~0=~weak$$choice2~0_In-93569361, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-93569361} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 08:07:42,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [590] [590] L801-->L802: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd0~0_51 v_~x$r_buff0_thd0~0_50)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 08:07:42,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L804-->L4: Formula: (and (= 0 v_~x$flush_delayed~0_9) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~x$flush_delayed~0_10 256))) (= v_~x$mem_tmp~0_6 v_~x~0_23)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 08:07:42,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 08:07:42,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:07:42 BasicIcfg [2019-12-27 08:07:42,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:07:42,629 INFO L168 Benchmark]: Toolchain (without parser) took 18536.04 ms. Allocated memory was 138.9 MB in the beginning and 891.8 MB in the end (delta: 752.9 MB). Free memory was 102.6 MB in the beginning and 342.3 MB in the end (delta: -239.7 MB). Peak memory consumption was 513.2 MB. Max. memory is 7.1 GB. [2019-12-27 08:07:42,630 INFO L168 Benchmark]: CDTParser took 1.65 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 08:07:42,632 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.91 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.2 MB in the beginning and 158.1 MB in the end (delta: -55.9 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-12-27 08:07:42,633 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.67 ms. Allocated memory is still 203.4 MB. Free memory was 158.1 MB in the beginning and 155.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 08:07:42,634 INFO L168 Benchmark]: Boogie Preprocessor took 41.23 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 08:07:42,634 INFO L168 Benchmark]: RCFGBuilder took 722.26 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 109.3 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. [2019-12-27 08:07:42,637 INFO L168 Benchmark]: TraceAbstraction took 16915.29 ms. Allocated memory was 203.4 MB in the beginning and 891.8 MB in the end (delta: 688.4 MB). Free memory was 108.6 MB in the beginning and 342.3 MB in the end (delta: -233.6 MB). Peak memory consumption was 454.8 MB. Max. memory is 7.1 GB. [2019-12-27 08:07:42,644 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.65 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 768.91 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.2 MB in the beginning and 158.1 MB in the end (delta: -55.9 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.67 ms. Allocated memory is still 203.4 MB. Free memory was 158.1 MB in the beginning and 155.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.23 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 722.26 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 109.3 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16915.29 ms. Allocated memory was 203.4 MB in the beginning and 891.8 MB in the end (delta: 688.4 MB). Free memory was 108.6 MB in the beginning and 342.3 MB in the end (delta: -233.6 MB). Peak memory consumption was 454.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 145 ProgramPointsBefore, 79 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 26 ChoiceCompositions, 3565 VarBasedMoverChecksPositive, 152 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48808 CheckedPairsTotal, 95 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2479, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] FCALL, FORK 0 pthread_create(&t2480, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 2 x$r_buff0_thd2 = (_Bool)1 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 y = 2 [L723] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L726] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L727] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L728] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L729] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L756] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L788] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 x$flush_delayed = weak$$choice2 [L795] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L797] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L798] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L799] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L800] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1781 SDtfs, 1736 SDslu, 4413 SDs, 0 SdLazy, 3743 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 17 SyntacticMatches, 12 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14414occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 19770 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 577 NumberOfCodeBlocks, 577 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 89136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...