/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:06:26,847 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:06:26,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:06:26,869 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:06:26,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:06:26,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:06:26,873 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:06:26,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:06:26,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:06:26,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:06:26,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:06:26,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:06:26,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:06:26,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:06:26,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:06:26,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:06:26,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:06:26,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:06:26,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:06:26,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:06:26,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:06:26,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:06:26,916 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:06:26,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:06:26,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:06:26,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:06:26,919 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:06:26,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:06:26,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:06:26,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:06:26,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:06:26,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:06:26,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:06:26,927 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:06:26,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:06:26,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:06:26,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:06:26,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:06:26,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:06:26,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:06:26,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:06:26,933 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:06:26,961 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:06:26,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:06:26,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:06:26,963 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:06:26,963 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:06:26,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:06:26,964 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:06:26,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:06:26,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:06:26,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:06:26,966 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:06:26,966 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:06:26,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:06:26,966 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:06:26,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:06:26,967 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:06:26,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:06:26,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:06:26,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:06:26,967 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:06:26,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:06:26,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:06:26,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:06:26,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:06:26,968 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:06:26,969 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:06:26,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:06:26,974 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:06:26,974 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:06:26,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:06:27,255 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:06:27,268 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:06:27,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:06:27,273 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:06:27,273 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:06:27,274 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i [2019-12-18 14:06:27,340 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdffff402/cdc8016272a74634b83c73dbbddd55a5/FLAG78f15e198 [2019-12-18 14:06:27,891 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:06:27,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i [2019-12-18 14:06:27,923 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdffff402/cdc8016272a74634b83c73dbbddd55a5/FLAG78f15e198 [2019-12-18 14:06:28,189 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdffff402/cdc8016272a74634b83c73dbbddd55a5 [2019-12-18 14:06:28,199 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:06:28,201 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:06:28,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:06:28,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:06:28,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:06:28,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:06:28" (1/1) ... [2019-12-18 14:06:28,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a58602b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:28, skipping insertion in model container [2019-12-18 14:06:28,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:06:28" (1/1) ... [2019-12-18 14:06:28,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:06:28,288 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:06:28,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:06:28,843 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:06:28,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:06:28,976 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:06:28,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:28 WrapperNode [2019-12-18 14:06:28,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:06:28,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:06:28,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:06:28,978 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:06:28,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:28" (1/1) ... [2019-12-18 14:06:29,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:28" (1/1) ... [2019-12-18 14:06:29,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:06:29,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:06:29,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:06:29,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:06:29,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:28" (1/1) ... [2019-12-18 14:06:29,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:28" (1/1) ... [2019-12-18 14:06:29,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:28" (1/1) ... [2019-12-18 14:06:29,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:28" (1/1) ... [2019-12-18 14:06:29,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:28" (1/1) ... [2019-12-18 14:06:29,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:28" (1/1) ... [2019-12-18 14:06:29,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:28" (1/1) ... [2019-12-18 14:06:29,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:06:29,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:06:29,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:06:29,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:06:29,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:06:29,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:06:29,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:06:29,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:06:29,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:06:29,184 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:06:29,185 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:06:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:06:29,185 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:06:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:06:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:06:29,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:06:29,188 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:06:29,873 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:06:29,874 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:06:29,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:06:29 BoogieIcfgContainer [2019-12-18 14:06:29,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:06:29,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:06:29,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:06:29,880 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:06:29,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:06:28" (1/3) ... [2019-12-18 14:06:29,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cd2927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:06:29, skipping insertion in model container [2019-12-18 14:06:29,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:28" (2/3) ... [2019-12-18 14:06:29,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cd2927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:06:29, skipping insertion in model container [2019-12-18 14:06:29,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:06:29" (3/3) ... [2019-12-18 14:06:29,884 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_rmo.opt.i [2019-12-18 14:06:29,895 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:06:29,895 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:06:29,903 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:06:29,904 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:06:29,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,941 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,941 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,951 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,951 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,951 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,964 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,964 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,967 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,967 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,968 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:29,986 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:06:30,008 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:06:30,008 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:06:30,008 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:06:30,008 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:06:30,008 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:06:30,009 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:06:30,009 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:06:30,009 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:06:30,053 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-18 14:06:30,055 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 14:06:30,144 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 14:06:30,144 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:06:30,160 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 14:06:30,176 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 14:06:30,255 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 14:06:30,256 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:06:30,264 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 14:06:30,283 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 14:06:30,285 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:06:34,382 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 14:06:34,485 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 14:06:34,519 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46553 [2019-12-18 14:06:34,519 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-18 14:06:34,523 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-18 14:06:35,036 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8413 states. [2019-12-18 14:06:35,038 INFO L276 IsEmpty]: Start isEmpty. Operand 8413 states. [2019-12-18 14:06:35,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:06:35,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:35,045 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:06:35,046 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:35,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:35,052 INFO L82 PathProgramCache]: Analyzing trace with hash 698534967, now seen corresponding path program 1 times [2019-12-18 14:06:35,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:35,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422757810] [2019-12-18 14:06:35,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:06:35,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422757810] [2019-12-18 14:06:35,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:35,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:06:35,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92462076] [2019-12-18 14:06:35,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:06:35,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:35,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:06:35,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:06:35,327 INFO L87 Difference]: Start difference. First operand 8413 states. Second operand 3 states. [2019-12-18 14:06:35,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:35,535 INFO L93 Difference]: Finished difference Result 8365 states and 27377 transitions. [2019-12-18 14:06:35,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:06:35,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:06:35,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:35,629 INFO L225 Difference]: With dead ends: 8365 [2019-12-18 14:06:35,629 INFO L226 Difference]: Without dead ends: 8196 [2019-12-18 14:06:35,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:06:35,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8196 states. [2019-12-18 14:06:35,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8196 to 8196. [2019-12-18 14:06:35,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2019-12-18 14:06:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 26857 transitions. [2019-12-18 14:06:36,128 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 26857 transitions. Word has length 5 [2019-12-18 14:06:36,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:36,129 INFO L462 AbstractCegarLoop]: Abstraction has 8196 states and 26857 transitions. [2019-12-18 14:06:36,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:06:36,129 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 26857 transitions. [2019-12-18 14:06:36,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:06:36,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:36,132 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:06:36,132 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:36,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:36,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1108629868, now seen corresponding path program 1 times [2019-12-18 14:06:36,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:36,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812858779] [2019-12-18 14:06:36,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:06:36,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812858779] [2019-12-18 14:06:36,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:36,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:06:36,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817400918] [2019-12-18 14:06:36,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:06:36,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:36,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:06:36,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:06:36,268 INFO L87 Difference]: Start difference. First operand 8196 states and 26857 transitions. Second operand 4 states. [2019-12-18 14:06:36,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:36,633 INFO L93 Difference]: Finished difference Result 13084 states and 41046 transitions. [2019-12-18 14:06:36,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:06:36,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:06:36,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:36,728 INFO L225 Difference]: With dead ends: 13084 [2019-12-18 14:06:36,729 INFO L226 Difference]: Without dead ends: 13077 [2019-12-18 14:06:36,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:06:36,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13077 states. [2019-12-18 14:06:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13077 to 11568. [2019-12-18 14:06:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11568 states. [2019-12-18 14:06:37,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11568 states to 11568 states and 36838 transitions. [2019-12-18 14:06:37,726 INFO L78 Accepts]: Start accepts. Automaton has 11568 states and 36838 transitions. Word has length 11 [2019-12-18 14:06:37,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:37,727 INFO L462 AbstractCegarLoop]: Abstraction has 11568 states and 36838 transitions. [2019-12-18 14:06:37,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:06:37,727 INFO L276 IsEmpty]: Start isEmpty. Operand 11568 states and 36838 transitions. [2019-12-18 14:06:37,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:06:37,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:37,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:06:37,737 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:37,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:37,738 INFO L82 PathProgramCache]: Analyzing trace with hash 531606898, now seen corresponding path program 1 times [2019-12-18 14:06:37,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:37,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729537628] [2019-12-18 14:06:37,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:06:37,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729537628] [2019-12-18 14:06:37,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:37,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:06:37,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331644073] [2019-12-18 14:06:37,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:06:37,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:37,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:06:37,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:06:37,855 INFO L87 Difference]: Start difference. First operand 11568 states and 36838 transitions. Second operand 4 states. [2019-12-18 14:06:38,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:38,091 INFO L93 Difference]: Finished difference Result 14627 states and 46118 transitions. [2019-12-18 14:06:38,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:06:38,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:06:38,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:38,136 INFO L225 Difference]: With dead ends: 14627 [2019-12-18 14:06:38,136 INFO L226 Difference]: Without dead ends: 14627 [2019-12-18 14:06:38,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:06:38,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14627 states. [2019-12-18 14:06:38,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14627 to 12851. [2019-12-18 14:06:38,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12851 states. [2019-12-18 14:06:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12851 states to 12851 states and 40863 transitions. [2019-12-18 14:06:38,671 INFO L78 Accepts]: Start accepts. Automaton has 12851 states and 40863 transitions. Word has length 11 [2019-12-18 14:06:38,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:38,671 INFO L462 AbstractCegarLoop]: Abstraction has 12851 states and 40863 transitions. [2019-12-18 14:06:38,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:06:38,671 INFO L276 IsEmpty]: Start isEmpty. Operand 12851 states and 40863 transitions. [2019-12-18 14:06:38,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 14:06:38,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:38,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:06:38,676 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:38,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:38,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1151367975, now seen corresponding path program 1 times [2019-12-18 14:06:38,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:38,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869562390] [2019-12-18 14:06:38,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:06:38,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869562390] [2019-12-18 14:06:38,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:38,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:06:38,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501836363] [2019-12-18 14:06:38,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:06:38,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:38,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:06:38,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:06:38,809 INFO L87 Difference]: Start difference. First operand 12851 states and 40863 transitions. Second operand 5 states. [2019-12-18 14:06:39,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:39,288 INFO L93 Difference]: Finished difference Result 17501 states and 54434 transitions. [2019-12-18 14:06:39,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:06:39,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 14:06:39,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:39,329 INFO L225 Difference]: With dead ends: 17501 [2019-12-18 14:06:39,329 INFO L226 Difference]: Without dead ends: 17494 [2019-12-18 14:06:39,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:06:39,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17494 states. [2019-12-18 14:06:39,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17494 to 12893. [2019-12-18 14:06:39,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12893 states. [2019-12-18 14:06:39,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12893 states to 12893 states and 40855 transitions. [2019-12-18 14:06:39,921 INFO L78 Accepts]: Start accepts. Automaton has 12893 states and 40855 transitions. Word has length 17 [2019-12-18 14:06:39,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:39,921 INFO L462 AbstractCegarLoop]: Abstraction has 12893 states and 40855 transitions. [2019-12-18 14:06:39,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:06:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 12893 states and 40855 transitions. [2019-12-18 14:06:39,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:06:39,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:39,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:06:39,936 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:39,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:39,937 INFO L82 PathProgramCache]: Analyzing trace with hash -2101636237, now seen corresponding path program 1 times [2019-12-18 14:06:39,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:39,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159628062] [2019-12-18 14:06:39,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:40,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:06:40,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159628062] [2019-12-18 14:06:40,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:40,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:06:40,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164235675] [2019-12-18 14:06:40,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:06:40,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:40,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:06:40,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:06:40,013 INFO L87 Difference]: Start difference. First operand 12893 states and 40855 transitions. Second operand 3 states. [2019-12-18 14:06:40,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:40,122 INFO L93 Difference]: Finished difference Result 15714 states and 49940 transitions. [2019-12-18 14:06:40,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:06:40,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 14:06:40,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:40,161 INFO L225 Difference]: With dead ends: 15714 [2019-12-18 14:06:40,161 INFO L226 Difference]: Without dead ends: 15714 [2019-12-18 14:06:40,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:06:40,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15714 states. [2019-12-18 14:06:40,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15714 to 14811. [2019-12-18 14:06:40,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14811 states. [2019-12-18 14:06:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14811 states to 14811 states and 47249 transitions. [2019-12-18 14:06:40,590 INFO L78 Accepts]: Start accepts. Automaton has 14811 states and 47249 transitions. Word has length 25 [2019-12-18 14:06:40,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:40,592 INFO L462 AbstractCegarLoop]: Abstraction has 14811 states and 47249 transitions. [2019-12-18 14:06:40,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:06:40,592 INFO L276 IsEmpty]: Start isEmpty. Operand 14811 states and 47249 transitions. [2019-12-18 14:06:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:06:41,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:41,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:06:41,387 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:41,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:41,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1939096541, now seen corresponding path program 1 times [2019-12-18 14:06:41,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:41,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712132775] [2019-12-18 14:06:41,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:06:41,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712132775] [2019-12-18 14:06:41,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:41,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:06:41,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430052992] [2019-12-18 14:06:41,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:06:41,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:41,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:06:41,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:06:41,476 INFO L87 Difference]: Start difference. First operand 14811 states and 47249 transitions. Second operand 4 states. [2019-12-18 14:06:41,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:41,508 INFO L93 Difference]: Finished difference Result 2380 states and 5507 transitions. [2019-12-18 14:06:41,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:06:41,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:06:41,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:41,512 INFO L225 Difference]: With dead ends: 2380 [2019-12-18 14:06:41,512 INFO L226 Difference]: Without dead ends: 2094 [2019-12-18 14:06:41,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:06:41,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2019-12-18 14:06:41,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2094. [2019-12-18 14:06:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2019-12-18 14:06:41,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 4716 transitions. [2019-12-18 14:06:41,552 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 4716 transitions. Word has length 25 [2019-12-18 14:06:41,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:41,552 INFO L462 AbstractCegarLoop]: Abstraction has 2094 states and 4716 transitions. [2019-12-18 14:06:41,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:06:41,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 4716 transitions. [2019-12-18 14:06:41,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 14:06:41,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:41,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:06:41,557 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:41,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:41,557 INFO L82 PathProgramCache]: Analyzing trace with hash -673430796, now seen corresponding path program 1 times [2019-12-18 14:06:41,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:41,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393135934] [2019-12-18 14:06:41,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:06:41,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393135934] [2019-12-18 14:06:41,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:41,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:06:41,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989031459] [2019-12-18 14:06:41,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:06:41,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:41,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:06:41,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:06:41,697 INFO L87 Difference]: Start difference. First operand 2094 states and 4716 transitions. Second operand 5 states. [2019-12-18 14:06:41,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:41,743 INFO L93 Difference]: Finished difference Result 429 states and 783 transitions. [2019-12-18 14:06:41,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:06:41,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 14:06:41,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:41,744 INFO L225 Difference]: With dead ends: 429 [2019-12-18 14:06:41,744 INFO L226 Difference]: Without dead ends: 383 [2019-12-18 14:06:41,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:06:41,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-12-18 14:06:41,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 348. [2019-12-18 14:06:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-18 14:06:41,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 628 transitions. [2019-12-18 14:06:41,750 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 628 transitions. Word has length 37 [2019-12-18 14:06:41,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:41,751 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 628 transitions. [2019-12-18 14:06:41,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:06:41,751 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 628 transitions. [2019-12-18 14:06:41,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 14:06:41,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:41,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:06:41,753 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:41,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:41,753 INFO L82 PathProgramCache]: Analyzing trace with hash 939573543, now seen corresponding path program 1 times [2019-12-18 14:06:41,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:41,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458051044] [2019-12-18 14:06:41,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:06:41,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458051044] [2019-12-18 14:06:41,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:41,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:06:41,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094541533] [2019-12-18 14:06:41,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:06:41,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:41,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:06:41,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:06:41,830 INFO L87 Difference]: Start difference. First operand 348 states and 628 transitions. Second operand 3 states. [2019-12-18 14:06:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:41,868 INFO L93 Difference]: Finished difference Result 352 states and 622 transitions. [2019-12-18 14:06:41,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:06:41,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 14:06:41,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:41,870 INFO L225 Difference]: With dead ends: 352 [2019-12-18 14:06:41,870 INFO L226 Difference]: Without dead ends: 352 [2019-12-18 14:06:41,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:06:41,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-12-18 14:06:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2019-12-18 14:06:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-18 14:06:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 614 transitions. [2019-12-18 14:06:41,875 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 614 transitions. Word has length 52 [2019-12-18 14:06:41,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:41,875 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 614 transitions. [2019-12-18 14:06:41,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:06:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 614 transitions. [2019-12-18 14:06:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 14:06:41,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:41,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:06:41,877 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:41,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:41,878 INFO L82 PathProgramCache]: Analyzing trace with hash 933754688, now seen corresponding path program 1 times [2019-12-18 14:06:41,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:41,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033541864] [2019-12-18 14:06:41,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:41,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:06:41,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033541864] [2019-12-18 14:06:41,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:41,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:06:41,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952001389] [2019-12-18 14:06:41,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:06:41,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:41,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:06:41,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:06:41,937 INFO L87 Difference]: Start difference. First operand 344 states and 614 transitions. Second operand 3 states. [2019-12-18 14:06:41,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:41,949 INFO L93 Difference]: Finished difference Result 344 states and 601 transitions. [2019-12-18 14:06:41,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:06:41,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 14:06:41,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:41,950 INFO L225 Difference]: With dead ends: 344 [2019-12-18 14:06:41,950 INFO L226 Difference]: Without dead ends: 344 [2019-12-18 14:06:41,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:06:41,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-12-18 14:06:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-12-18 14:06:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-18 14:06:41,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 601 transitions. [2019-12-18 14:06:41,955 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 601 transitions. Word has length 52 [2019-12-18 14:06:41,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:41,956 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 601 transitions. [2019-12-18 14:06:41,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:06:41,956 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 601 transitions. [2019-12-18 14:06:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:06:41,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:41,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:06:41,957 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:41,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:41,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1595558797, now seen corresponding path program 1 times [2019-12-18 14:06:41,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:41,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866968637] [2019-12-18 14:06:41,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:06:42,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866968637] [2019-12-18 14:06:42,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:42,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:06:42,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492266448] [2019-12-18 14:06:42,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:06:42,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:42,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:06:42,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:06:42,253 INFO L87 Difference]: Start difference. First operand 344 states and 601 transitions. Second operand 9 states. [2019-12-18 14:06:42,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:42,780 INFO L93 Difference]: Finished difference Result 582 states and 1009 transitions. [2019-12-18 14:06:42,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 14:06:42,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 14:06:42,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:42,782 INFO L225 Difference]: With dead ends: 582 [2019-12-18 14:06:42,782 INFO L226 Difference]: Without dead ends: 582 [2019-12-18 14:06:42,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:06:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-12-18 14:06:42,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 432. [2019-12-18 14:06:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-12-18 14:06:42,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 756 transitions. [2019-12-18 14:06:42,788 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 756 transitions. Word has length 53 [2019-12-18 14:06:42,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:42,789 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 756 transitions. [2019-12-18 14:06:42,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:06:42,789 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 756 transitions. [2019-12-18 14:06:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:06:42,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:42,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:06:42,791 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:42,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:42,791 INFO L82 PathProgramCache]: Analyzing trace with hash 165214383, now seen corresponding path program 2 times [2019-12-18 14:06:42,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:42,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210904349] [2019-12-18 14:06:42,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:42,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:06:42,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210904349] [2019-12-18 14:06:42,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:42,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:06:42,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101146890] [2019-12-18 14:06:42,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:06:42,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:42,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:06:42,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:06:42,848 INFO L87 Difference]: Start difference. First operand 432 states and 756 transitions. Second operand 3 states. [2019-12-18 14:06:42,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:42,883 INFO L93 Difference]: Finished difference Result 431 states and 754 transitions. [2019-12-18 14:06:42,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:06:42,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 14:06:42,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:42,885 INFO L225 Difference]: With dead ends: 431 [2019-12-18 14:06:42,885 INFO L226 Difference]: Without dead ends: 431 [2019-12-18 14:06:42,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:06:42,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-12-18 14:06:42,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 343. [2019-12-18 14:06:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-18 14:06:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 590 transitions. [2019-12-18 14:06:42,889 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 590 transitions. Word has length 53 [2019-12-18 14:06:42,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:42,890 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 590 transitions. [2019-12-18 14:06:42,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:06:42,890 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 590 transitions. [2019-12-18 14:06:42,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:06:42,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:42,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:06:42,891 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:42,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:42,891 INFO L82 PathProgramCache]: Analyzing trace with hash -798816837, now seen corresponding path program 1 times [2019-12-18 14:06:42,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:42,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441558177] [2019-12-18 14:06:42,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:06:43,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441558177] [2019-12-18 14:06:43,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:43,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:06:43,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737923179] [2019-12-18 14:06:43,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:06:43,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:43,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:06:43,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:06:43,033 INFO L87 Difference]: Start difference. First operand 343 states and 590 transitions. Second operand 7 states. [2019-12-18 14:06:43,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:43,147 INFO L93 Difference]: Finished difference Result 546 states and 939 transitions. [2019-12-18 14:06:43,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:06:43,147 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 14:06:43,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:43,148 INFO L225 Difference]: With dead ends: 546 [2019-12-18 14:06:43,148 INFO L226 Difference]: Without dead ends: 220 [2019-12-18 14:06:43,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:06:43,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-12-18 14:06:43,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 196. [2019-12-18 14:06:43,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-12-18 14:06:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 330 transitions. [2019-12-18 14:06:43,152 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 330 transitions. Word has length 54 [2019-12-18 14:06:43,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:43,152 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 330 transitions. [2019-12-18 14:06:43,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:06:43,153 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 330 transitions. [2019-12-18 14:06:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:06:43,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:43,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:06:43,154 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:43,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:43,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1731930561, now seen corresponding path program 2 times [2019-12-18 14:06:43,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:43,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321344906] [2019-12-18 14:06:43,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:06:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:06:43,266 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:06:43,266 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:06:43,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~z~0_122 0) (= v_~y$mem_tmp~0_21 0) (= v_~y$r_buff1_thd1~0_178 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1611~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1611~0.base_19|) |v_ULTIMATE.start_main_~#t1611~0.offset_14| 0)) |v_#memory_int_15|) (= 0 v_~__unbuffered_p1_EBX~0_131) (= v_~weak$$choice2~0_120 0) (= v_~__unbuffered_p1_EAX~0_131 0) (= v_~y$r_buff0_thd0~0_347 0) (= 0 |v_ULTIMATE.start_main_~#t1611~0.offset_14|) (= 0 v_~y$r_buff1_thd2~0_171) (= v_~x~0_94 0) (= 0 v_~weak$$choice0~0_15) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff0_thd2~0_225) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~__unbuffered_cnt~0_63) (= v_~y$r_buff0_thd1~0_109 0) (= v_~y$w_buff0_used~0_663 0) (= |v_#valid_40| (store .cse0 |v_ULTIMATE.start_main_~#t1611~0.base_19| 1)) (= v_~y$w_buff1~0_180 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1611~0.base_19| 4)) (= 0 v_~y$flush_delayed~0_36) (= |v_#NULL.offset_5| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1611~0.base_19|) (= v_~y~0_158 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff1_thd0~0_274 0) (= 0 v_~y$w_buff0~0_245) (= (select .cse0 |v_ULTIMATE.start_main_~#t1611~0.base_19|) 0) (= v_~main$tmp_guard1~0_25 0) (= v_~y$w_buff1_used~0_350 0) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_44|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t1611~0.base=|v_ULTIMATE.start_main_~#t1611~0.base_19|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_33|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_47|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_131, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_109, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_30|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_23|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_28|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_46|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ~y$w_buff1~0=v_~y$w_buff1~0_180, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_225, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_274, ~x~0=v_~x~0_94, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_663, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_25|, ULTIMATE.start_main_~#t1611~0.offset=|v_ULTIMATE.start_main_~#t1611~0.offset_14|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_25|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_44|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_25|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_45|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_42|, ~y$w_buff0~0=v_~y$w_buff0~0_245, ~y~0=v_~y~0_158, ULTIMATE.start_main_~#t1612~0.base=|v_ULTIMATE.start_main_~#t1612~0.base_16|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_31|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_23|, ULTIMATE.start_main_~#t1612~0.offset=|v_ULTIMATE.start_main_~#t1612~0.offset_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_29|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_34|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_171, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_347, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_16|, ~z~0=v_~z~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_~#t1611~0.base, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1611~0.offset, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1612~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_~#t1612~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:06:43,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L789-1-->L791: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1612~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1612~0.base_11|) |v_ULTIMATE.start_main_~#t1612~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1612~0.base_11|)) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1612~0.base_11| 1) |v_#valid_23|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1612~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1612~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1612~0.base_11|) (= |v_ULTIMATE.start_main_~#t1612~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1612~0.base=|v_ULTIMATE.start_main_~#t1612~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1612~0.offset=|v_ULTIMATE.start_main_~#t1612~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1612~0.base, ULTIMATE.start_main_~#t1612~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 14:06:43,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] P1ENTRY-->L4-3: Formula: (and (= 0 (mod v_~y$w_buff1_used~0_47 256)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1) (= 1 v_~y$w_buff0_used~0_86) (= 2 v_~y$w_buff0~0_19) (= v_~y$w_buff0~0_20 v_~y$w_buff1~0_21) (= v_~y$w_buff1_used~0_47 v_~y$w_buff0_used~0_87)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff0~0=v_~y$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_86, ~y$w_buff1~0=v_~y$w_buff1~0_21, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~y$w_buff0~0=v_~y$w_buff0~0_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_47} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:06:43,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L732-2-->L732-5: Formula: (let ((.cse1 (= |P0Thread1of1ForFork0_#t~ite4_Out-1190736437| |P0Thread1of1ForFork0_#t~ite3_Out-1190736437|)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1190736437 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1190736437 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out-1190736437| ~y$w_buff1~0_In-1190736437)) (and (= ~y~0_In-1190736437 |P0Thread1of1ForFork0_#t~ite3_Out-1190736437|) .cse1 (or .cse2 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1190736437, ~y$w_buff1~0=~y$w_buff1~0_In-1190736437, ~y~0=~y~0_In-1190736437, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1190736437} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1190736437, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1190736437|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1190736437|, ~y$w_buff1~0=~y$w_buff1~0_In-1190736437, ~y~0=~y~0_In-1190736437, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1190736437} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 14:06:43,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L733-->L733-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1882786605 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1882786605 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1882786605 |P0Thread1of1ForFork0_#t~ite5_Out-1882786605|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1882786605|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1882786605, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1882786605} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1882786605|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1882786605, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1882786605} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:06:43,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L734-->L734-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1991960590 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-1991960590 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1991960590 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-1991960590 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1991960590| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out-1991960590| ~y$w_buff1_used~0_In-1991960590)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1991960590, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1991960590, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1991960590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1991960590} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1991960590|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1991960590, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1991960590, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1991960590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1991960590} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:06:43,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In907993851 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In907993851 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out907993851| ~y$r_buff0_thd1~0_In907993851)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out907993851| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In907993851, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In907993851} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In907993851, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out907993851|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In907993851} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 14:06:43,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L736-->L736-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1015651121 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1015651121 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In1015651121 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1015651121 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1015651121| ~y$r_buff1_thd1~0_In1015651121) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out1015651121| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1015651121, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1015651121, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1015651121, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1015651121} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1015651121, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1015651121, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1015651121|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1015651121, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1015651121} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:06:43,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L736-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (= v_~y$r_buff1_thd1~0_125 |v_P0Thread1of1ForFork0_#t~ite8_32|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_125, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 14:06:43,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1829915026 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1829915026 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1829915026| ~y$w_buff0_used~0_In-1829915026)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1829915026| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1829915026, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1829915026} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1829915026, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1829915026, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1829915026|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 14:06:43,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1627965754 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1627965754 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1627965754 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1627965754 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1627965754|)) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-1627965754 |P1Thread1of1ForFork1_#t~ite12_Out-1627965754|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1627965754, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1627965754, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1627965754, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1627965754} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1627965754, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1627965754, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1627965754, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1627965754|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1627965754} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 14:06:43,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L769-->L770: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-274718066 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-274718066 256) 0))) (or (and (= ~y$r_buff0_thd2~0_Out-274718066 ~y$r_buff0_thd2~0_In-274718066) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd2~0_Out-274718066 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-274718066, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-274718066} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-274718066, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-274718066, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-274718066|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 14:06:43,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1972312025 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1972312025 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1972312025 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1972312025 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-1972312025| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-1972312025| ~y$r_buff1_thd2~0_In-1972312025) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1972312025, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1972312025, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1972312025, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1972312025} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1972312025, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1972312025, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1972312025, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1972312025|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1972312025} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:06:43,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_144 |v_P1Thread1of1ForFork1_#t~ite14_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_144, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 14:06:43,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_132 256)) (= 0 (mod v_~y$w_buff0_used~0_236 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_236, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_236, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:06:43,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In862393392 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In862393392 256)))) (or (and (= ~y~0_In862393392 |ULTIMATE.start_main_#t~ite17_Out862393392|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite17_Out862393392| ~y$w_buff1~0_In862393392)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In862393392, ~y~0=~y~0_In862393392, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In862393392, ~y$w_buff1_used~0=~y$w_buff1_used~0_In862393392} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out862393392|, ~y$w_buff1~0=~y$w_buff1~0_In862393392, ~y~0=~y~0_In862393392, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In862393392, ~y$w_buff1_used~0=~y$w_buff1_used~0_In862393392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 14:06:43,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [619] [619] L797-4-->L798: Formula: (= v_~y~0_44 |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_7|, ~y~0=v_~y~0_44} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-18 14:06:43,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1241746968 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1241746968 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-1241746968| 0)) (and (= |ULTIMATE.start_main_#t~ite19_Out-1241746968| ~y$w_buff0_used~0_In-1241746968) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1241746968, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1241746968} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1241746968, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1241746968|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1241746968} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 14:06:43,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In393813203 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In393813203 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In393813203 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In393813203 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out393813203|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In393813203 |ULTIMATE.start_main_#t~ite20_Out393813203|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In393813203, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In393813203, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In393813203, ~y$w_buff1_used~0=~y$w_buff1_used~0_In393813203} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In393813203, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In393813203, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out393813203|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In393813203, ~y$w_buff1_used~0=~y$w_buff1_used~0_In393813203} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 14:06:43,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In881334189 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In881334189 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out881334189| ~y$r_buff0_thd0~0_In881334189)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out881334189|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In881334189, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In881334189} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In881334189, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In881334189, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out881334189|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 14:06:43,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-93076455 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-93076455 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-93076455 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-93076455 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out-93076455| ~y$r_buff1_thd0~0_In-93076455)) (and (= |ULTIMATE.start_main_#t~ite22_Out-93076455| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-93076455, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-93076455, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-93076455, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-93076455} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-93076455, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-93076455, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-93076455, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-93076455|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-93076455} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 14:06:43,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L812-->L812-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1035066722 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out1035066722| ~y$w_buff1_used~0_In1035066722) (= |ULTIMATE.start_main_#t~ite37_In1035066722| |ULTIMATE.start_main_#t~ite37_Out1035066722|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1035066722 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd0~0_In1035066722 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1035066722 256)) (and (= 0 (mod ~y$w_buff1_used~0_In1035066722 256)) .cse1))) (= ~y$w_buff1_used~0_In1035066722 |ULTIMATE.start_main_#t~ite37_Out1035066722|) .cse0 (= |ULTIMATE.start_main_#t~ite38_Out1035066722| |ULTIMATE.start_main_#t~ite37_Out1035066722|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1035066722, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1035066722, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In1035066722|, ~weak$$choice2~0=~weak$$choice2~0_In1035066722, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1035066722, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1035066722} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1035066722, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1035066722, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1035066722|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1035066722|, ~weak$$choice2~0=~weak$$choice2~0_In1035066722, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1035066722, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1035066722} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 14:06:43,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [607] [607] L813-->L814: Formula: (and (= v_~y$r_buff0_thd0~0_98 v_~y$r_buff0_thd0~0_97) (not (= 0 (mod v_~weak$$choice2~0_26 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_26} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-18 14:06:43,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L816-->L819-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_16 256)) (not (= (mod v_~y$flush_delayed~0_27 256) 0)) (= v_~y~0_114 v_~y$mem_tmp~0_17) (= 0 v_~y$flush_delayed~0_26)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_114, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_18|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:06:43,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 14:06:43,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:06:43 BasicIcfg [2019-12-18 14:06:43,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:06:43,353 INFO L168 Benchmark]: Toolchain (without parser) took 15152.65 ms. Allocated memory was 146.3 MB in the beginning and 783.8 MB in the end (delta: 637.5 MB). Free memory was 102.7 MB in the beginning and 631.5 MB in the end (delta: -528.8 MB). Peak memory consumption was 108.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:06:43,354 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 14:06:43,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.79 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.3 MB in the beginning and 157.9 MB in the end (delta: -55.6 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-18 14:06:43,355 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.74 ms. Allocated memory is still 203.4 MB. Free memory was 157.9 MB in the beginning and 154.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 14:06:43,356 INFO L168 Benchmark]: Boogie Preprocessor took 35.04 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 152.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:06:43,357 INFO L168 Benchmark]: RCFGBuilder took 777.91 ms. Allocated memory is still 203.4 MB. Free memory was 152.7 MB in the beginning and 108.0 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:06:43,358 INFO L168 Benchmark]: TraceAbstraction took 13474.77 ms. Allocated memory was 203.4 MB in the beginning and 783.8 MB in the end (delta: 580.4 MB). Free memory was 107.3 MB in the beginning and 631.5 MB in the end (delta: -524.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:06:43,362 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.79 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.3 MB in the beginning and 157.9 MB in the end (delta: -55.6 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 84.74 ms. Allocated memory is still 203.4 MB. Free memory was 157.9 MB in the beginning and 154.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.04 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 152.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 777.91 ms. Allocated memory is still 203.4 MB. Free memory was 152.7 MB in the beginning and 108.0 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13474.77 ms. Allocated memory was 203.4 MB in the beginning and 783.8 MB in the end (delta: 580.4 MB). Free memory was 107.3 MB in the beginning and 631.5 MB in the end (delta: -524.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 148 ProgramPointsBefore, 78 ProgramPointsAfterwards, 182 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 3838 VarBasedMoverChecksPositive, 191 VarBasedMoverChecksNegative, 62 SemBasedMoverChecksPositive, 187 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 46553 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1611, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1612, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L751] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L752] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L753] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = (_Bool)1 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 x = 1 [L729] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L734] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L735] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L800] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 y$flush_delayed = weak$$choice2 [L807] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.2s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1262 SDtfs, 1131 SDslu, 1960 SDs, 0 SdLazy, 1130 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14811occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 9094 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 449 NumberOfCodeBlocks, 449 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 49626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...