/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix031_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:08:16,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:08:16,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:08:16,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:08:16,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:08:16,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:08:16,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:08:16,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:08:16,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:08:16,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:08:16,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:08:16,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:08:16,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:08:16,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:08:16,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:08:16,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:08:16,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:08:16,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:08:16,915 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:08:16,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:08:16,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:08:16,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:08:16,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:08:16,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:08:16,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:08:16,926 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:08:16,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:08:16,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:08:16,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:08:16,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:08:16,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:08:16,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:08:16,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:08:16,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:08:16,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:08:16,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:08:16,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:08:16,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:08:16,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:08:16,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:08:16,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:08:16,936 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:08:16,964 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:08:16,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:08:16,967 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:08:16,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:08:16,967 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:08:16,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:08:16,968 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:08:16,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:08:16,968 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:08:16,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:08:16,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:08:16,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:08:16,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:08:16,970 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:08:16,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:08:16,971 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:08:16,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:08:16,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:08:16,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:08:16,971 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:08:16,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:08:16,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:08:16,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:08:16,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:08:16,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:08:16,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:08:16,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:08:16,973 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:08:16,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:08:16,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:08:17,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:08:17,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:08:17,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:08:17,268 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:08:17,269 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:08:17,270 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_rmo.opt.i [2019-12-18 21:08:17,336 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ccd86bc8/1ce2e1107a094ed2abfff979cf933b30/FLAG958e655f0 [2019-12-18 21:08:17,836 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:08:17,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_rmo.opt.i [2019-12-18 21:08:17,856 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ccd86bc8/1ce2e1107a094ed2abfff979cf933b30/FLAG958e655f0 [2019-12-18 21:08:18,167 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ccd86bc8/1ce2e1107a094ed2abfff979cf933b30 [2019-12-18 21:08:18,176 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:08:18,178 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:08:18,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:08:18,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:08:18,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:08:18,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:08:18" (1/1) ... [2019-12-18 21:08:18,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d6fe52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:18, skipping insertion in model container [2019-12-18 21:08:18,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:08:18" (1/1) ... [2019-12-18 21:08:18,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:08:18,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:08:18,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:08:18,836 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:08:18,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:08:18,982 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:08:18,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:18 WrapperNode [2019-12-18 21:08:18,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:08:18,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:08:18,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:08:18,984 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:08:18,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:18" (1/1) ... [2019-12-18 21:08:19,012 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:18" (1/1) ... [2019-12-18 21:08:19,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:08:19,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:08:19,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:08:19,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:08:19,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:18" (1/1) ... [2019-12-18 21:08:19,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:18" (1/1) ... [2019-12-18 21:08:19,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:18" (1/1) ... [2019-12-18 21:08:19,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:18" (1/1) ... [2019-12-18 21:08:19,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:18" (1/1) ... [2019-12-18 21:08:19,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:18" (1/1) ... [2019-12-18 21:08:19,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:18" (1/1) ... [2019-12-18 21:08:19,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:08:19,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:08:19,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:08:19,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:08:19,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:18" (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 21:08:19,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:08:19,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:08:19,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:08:19,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:08:19,168 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:08:19,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:08:19,169 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:08:19,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:08:19,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:08:19,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:08:19,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:08:19,171 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 21:08:19,872 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:08:19,872 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:08:19,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:08:19 BoogieIcfgContainer [2019-12-18 21:08:19,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:08:19,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:08:19,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:08:19,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:08:19,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:08:18" (1/3) ... [2019-12-18 21:08:19,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62258527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:08:19, skipping insertion in model container [2019-12-18 21:08:19,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:18" (2/3) ... [2019-12-18 21:08:19,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62258527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:08:19, skipping insertion in model container [2019-12-18 21:08:19,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:08:19" (3/3) ... [2019-12-18 21:08:19,882 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_rmo.opt.i [2019-12-18 21:08:19,893 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:08:19,893 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:08:19,901 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:08:19,902 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:08:19,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,939 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,939 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,962 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,963 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,963 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,963 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,964 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,975 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,977 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,984 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:19,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:20,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:20,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:20,015 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:08:20,033 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:08:20,033 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:08:20,033 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:08:20,033 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:08:20,033 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:08:20,033 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:08:20,033 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:08:20,034 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:08:20,049 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 167 transitions [2019-12-18 21:08:20,052 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-18 21:08:20,123 INFO L126 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-18 21:08:20,123 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:08:20,138 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 6/134 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 21:08:20,157 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-18 21:08:20,214 INFO L126 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-18 21:08:20,216 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:08:20,221 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 6/134 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 21:08:20,233 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-18 21:08:20,234 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:08:23,195 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-12-18 21:08:23,485 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-12-18 21:08:23,598 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-18 21:08:23,752 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 21:08:23,871 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 21:08:23,904 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46171 [2019-12-18 21:08:23,904 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-18 21:08:23,908 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68 places, 79 transitions [2019-12-18 21:08:24,280 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6786 states. [2019-12-18 21:08:24,283 INFO L276 IsEmpty]: Start isEmpty. Operand 6786 states. [2019-12-18 21:08:24,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 21:08:24,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:24,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 21:08:24,290 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:08:24,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:24,297 INFO L82 PathProgramCache]: Analyzing trace with hash 687166048, now seen corresponding path program 1 times [2019-12-18 21:08:24,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:24,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045056025] [2019-12-18 21:08:24,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:24,549 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 21:08:24,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045056025] [2019-12-18 21:08:24,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:24,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:08:24,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615043310] [2019-12-18 21:08:24,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:08:24,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:24,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:08:24,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:08:24,573 INFO L87 Difference]: Start difference. First operand 6786 states. Second operand 3 states. [2019-12-18 21:08:24,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:24,781 INFO L93 Difference]: Finished difference Result 6626 states and 22242 transitions. [2019-12-18 21:08:24,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:08:24,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 21:08:24,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:24,858 INFO L225 Difference]: With dead ends: 6626 [2019-12-18 21:08:24,858 INFO L226 Difference]: Without dead ends: 6242 [2019-12-18 21:08:24,859 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 21:08:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6242 states. [2019-12-18 21:08:25,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6242 to 6242. [2019-12-18 21:08:25,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6242 states. [2019-12-18 21:08:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6242 states to 6242 states and 20914 transitions. [2019-12-18 21:08:25,260 INFO L78 Accepts]: Start accepts. Automaton has 6242 states and 20914 transitions. Word has length 5 [2019-12-18 21:08:25,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:25,261 INFO L462 AbstractCegarLoop]: Abstraction has 6242 states and 20914 transitions. [2019-12-18 21:08:25,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:08:25,261 INFO L276 IsEmpty]: Start isEmpty. Operand 6242 states and 20914 transitions. [2019-12-18 21:08:25,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:08:25,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:25,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:08:25,267 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:08:25,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:25,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1092588283, now seen corresponding path program 1 times [2019-12-18 21:08:25,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:25,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832818236] [2019-12-18 21:08:25,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:25,343 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 21:08:25,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832818236] [2019-12-18 21:08:25,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:25,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:08:25,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845712963] [2019-12-18 21:08:25,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:08:25,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:25,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:08:25,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:08:25,347 INFO L87 Difference]: Start difference. First operand 6242 states and 20914 transitions. Second operand 3 states. [2019-12-18 21:08:25,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:25,390 INFO L93 Difference]: Finished difference Result 1244 states and 3068 transitions. [2019-12-18 21:08:25,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:08:25,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 21:08:25,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:25,397 INFO L225 Difference]: With dead ends: 1244 [2019-12-18 21:08:25,398 INFO L226 Difference]: Without dead ends: 1244 [2019-12-18 21:08:25,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:08:25,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2019-12-18 21:08:25,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1244. [2019-12-18 21:08:25,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2019-12-18 21:08:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 3068 transitions. [2019-12-18 21:08:25,430 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 3068 transitions. Word has length 11 [2019-12-18 21:08:25,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:25,431 INFO L462 AbstractCegarLoop]: Abstraction has 1244 states and 3068 transitions. [2019-12-18 21:08:25,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:08:25,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 3068 transitions. [2019-12-18 21:08:25,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:08:25,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:25,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:08:25,438 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:08:25,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:25,439 INFO L82 PathProgramCache]: Analyzing trace with hash 97322610, now seen corresponding path program 1 times [2019-12-18 21:08:25,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:25,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319349696] [2019-12-18 21:08:25,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:25,548 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 21:08:25,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319349696] [2019-12-18 21:08:25,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:25,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:08:25,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368683297] [2019-12-18 21:08:25,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:08:25,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:25,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:08:25,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:08:25,550 INFO L87 Difference]: Start difference. First operand 1244 states and 3068 transitions. Second operand 3 states. [2019-12-18 21:08:25,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:25,619 INFO L93 Difference]: Finished difference Result 1899 states and 4747 transitions. [2019-12-18 21:08:25,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:08:25,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 21:08:25,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:25,631 INFO L225 Difference]: With dead ends: 1899 [2019-12-18 21:08:25,631 INFO L226 Difference]: Without dead ends: 1899 [2019-12-18 21:08:25,631 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 21:08:25,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2019-12-18 21:08:25,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1383. [2019-12-18 21:08:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2019-12-18 21:08:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 3459 transitions. [2019-12-18 21:08:25,673 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 3459 transitions. Word has length 14 [2019-12-18 21:08:25,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:25,673 INFO L462 AbstractCegarLoop]: Abstraction has 1383 states and 3459 transitions. [2019-12-18 21:08:25,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:08:25,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 3459 transitions. [2019-12-18 21:08:25,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:08:25,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:25,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:08:25,675 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:08:25,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:25,675 INFO L82 PathProgramCache]: Analyzing trace with hash 234592346, now seen corresponding path program 1 times [2019-12-18 21:08:25,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:25,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086238428] [2019-12-18 21:08:25,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:25,736 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 21:08:25,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086238428] [2019-12-18 21:08:25,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:25,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:08:25,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467097591] [2019-12-18 21:08:25,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:08:25,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:25,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:08:25,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:08:25,742 INFO L87 Difference]: Start difference. First operand 1383 states and 3459 transitions. Second operand 4 states. [2019-12-18 21:08:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:25,905 INFO L93 Difference]: Finished difference Result 1804 states and 4372 transitions. [2019-12-18 21:08:25,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:08:25,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:08:25,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:25,916 INFO L225 Difference]: With dead ends: 1804 [2019-12-18 21:08:25,916 INFO L226 Difference]: Without dead ends: 1804 [2019-12-18 21:08:25,917 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 21:08:25,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2019-12-18 21:08:25,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1672. [2019-12-18 21:08:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-12-18 21:08:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 4077 transitions. [2019-12-18 21:08:25,959 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 4077 transitions. Word has length 14 [2019-12-18 21:08:25,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:25,960 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 4077 transitions. [2019-12-18 21:08:25,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:08:25,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 4077 transitions. [2019-12-18 21:08:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:08:25,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:25,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:08:25,961 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:08:25,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:25,962 INFO L82 PathProgramCache]: Analyzing trace with hash -489618057, now seen corresponding path program 1 times [2019-12-18 21:08:25,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:25,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100318738] [2019-12-18 21:08:25,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:26,007 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 21:08:26,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100318738] [2019-12-18 21:08:26,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:26,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:08:26,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416703680] [2019-12-18 21:08:26,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:08:26,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:26,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:08:26,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:08:26,010 INFO L87 Difference]: Start difference. First operand 1672 states and 4077 transitions. Second operand 4 states. [2019-12-18 21:08:26,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:26,163 INFO L93 Difference]: Finished difference Result 2061 states and 4940 transitions. [2019-12-18 21:08:26,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:08:26,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:08:26,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:26,175 INFO L225 Difference]: With dead ends: 2061 [2019-12-18 21:08:26,176 INFO L226 Difference]: Without dead ends: 2061 [2019-12-18 21:08:26,177 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 21:08:26,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2019-12-18 21:08:26,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 1689. [2019-12-18 21:08:26,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1689 states. [2019-12-18 21:08:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 4121 transitions. [2019-12-18 21:08:26,219 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 4121 transitions. Word has length 14 [2019-12-18 21:08:26,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:26,220 INFO L462 AbstractCegarLoop]: Abstraction has 1689 states and 4121 transitions. [2019-12-18 21:08:26,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:08:26,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 4121 transitions. [2019-12-18 21:08:26,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:08:26,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:26,223 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] [2019-12-18 21:08:26,223 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:08:26,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:26,224 INFO L82 PathProgramCache]: Analyzing trace with hash 266256386, now seen corresponding path program 1 times [2019-12-18 21:08:26,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:26,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104059193] [2019-12-18 21:08:26,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:26,305 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 21:08:26,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104059193] [2019-12-18 21:08:26,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:26,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:08:26,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342610495] [2019-12-18 21:08:26,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:08:26,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:26,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:08:26,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:08:26,309 INFO L87 Difference]: Start difference. First operand 1689 states and 4121 transitions. Second operand 4 states. [2019-12-18 21:08:26,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:26,335 INFO L93 Difference]: Finished difference Result 735 states and 1676 transitions. [2019-12-18 21:08:26,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:08:26,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-18 21:08:26,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:26,340 INFO L225 Difference]: With dead ends: 735 [2019-12-18 21:08:26,404 INFO L226 Difference]: Without dead ends: 735 [2019-12-18 21:08:26,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:08:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-12-18 21:08:26,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 715. [2019-12-18 21:08:26,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-12-18 21:08:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1636 transitions. [2019-12-18 21:08:26,421 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1636 transitions. Word has length 26 [2019-12-18 21:08:26,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:26,422 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1636 transitions. [2019-12-18 21:08:26,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:08:26,422 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1636 transitions. [2019-12-18 21:08:26,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 21:08:26,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:26,424 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] [2019-12-18 21:08:26,425 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:08:26,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:26,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1261986746, now seen corresponding path program 1 times [2019-12-18 21:08:26,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:26,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008120885] [2019-12-18 21:08:26,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:26,549 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 21:08:26,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008120885] [2019-12-18 21:08:26,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:26,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:08:26,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841851807] [2019-12-18 21:08:26,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:08:26,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:26,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:08:26,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:08:26,552 INFO L87 Difference]: Start difference. First operand 715 states and 1636 transitions. Second operand 4 states. [2019-12-18 21:08:26,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:26,571 INFO L93 Difference]: Finished difference Result 1135 states and 2642 transitions. [2019-12-18 21:08:26,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:08:26,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-18 21:08:26,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:26,575 INFO L225 Difference]: With dead ends: 1135 [2019-12-18 21:08:26,575 INFO L226 Difference]: Without dead ends: 439 [2019-12-18 21:08:26,575 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 21:08:26,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-12-18 21:08:26,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2019-12-18 21:08:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-12-18 21:08:26,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1037 transitions. [2019-12-18 21:08:26,589 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1037 transitions. Word has length 41 [2019-12-18 21:08:26,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:26,589 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 1037 transitions. [2019-12-18 21:08:26,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:08:26,589 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1037 transitions. [2019-12-18 21:08:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 21:08:26,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:26,593 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] [2019-12-18 21:08:26,593 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:08:26,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:26,594 INFO L82 PathProgramCache]: Analyzing trace with hash 798425448, now seen corresponding path program 2 times [2019-12-18 21:08:26,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:26,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563544814] [2019-12-18 21:08:26,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:26,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 21:08:26,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563544814] [2019-12-18 21:08:26,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:26,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:08:26,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358536001] [2019-12-18 21:08:26,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:08:26,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:26,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:08:26,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:08:26,696 INFO L87 Difference]: Start difference. First operand 439 states and 1037 transitions. Second operand 7 states. [2019-12-18 21:08:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:26,896 INFO L93 Difference]: Finished difference Result 844 states and 1939 transitions. [2019-12-18 21:08:26,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:08:26,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-18 21:08:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:26,901 INFO L225 Difference]: With dead ends: 844 [2019-12-18 21:08:26,902 INFO L226 Difference]: Without dead ends: 548 [2019-12-18 21:08:26,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:08:26,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-12-18 21:08:26,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 488. [2019-12-18 21:08:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-12-18 21:08:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1120 transitions. [2019-12-18 21:08:26,913 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1120 transitions. Word has length 41 [2019-12-18 21:08:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:26,914 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 1120 transitions. [2019-12-18 21:08:26,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:08:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1120 transitions. [2019-12-18 21:08:26,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 21:08:26,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:26,917 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] [2019-12-18 21:08:26,917 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:08:26,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:26,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1598750312, now seen corresponding path program 3 times [2019-12-18 21:08:26,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:26,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825175746] [2019-12-18 21:08:26,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:27,077 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 21:08:27,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825175746] [2019-12-18 21:08:27,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:27,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:08:27,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489287060] [2019-12-18 21:08:27,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:08:27,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:27,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:08:27,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:08:27,079 INFO L87 Difference]: Start difference. First operand 488 states and 1120 transitions. Second operand 6 states. [2019-12-18 21:08:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:27,478 INFO L93 Difference]: Finished difference Result 830 states and 1839 transitions. [2019-12-18 21:08:27,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:08:27,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 21:08:27,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:27,483 INFO L225 Difference]: With dead ends: 830 [2019-12-18 21:08:27,483 INFO L226 Difference]: Without dead ends: 818 [2019-12-18 21:08:27,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:08:27,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-12-18 21:08:27,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 774. [2019-12-18 21:08:27,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-12-18 21:08:27,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1733 transitions. [2019-12-18 21:08:27,499 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1733 transitions. Word has length 41 [2019-12-18 21:08:27,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:27,500 INFO L462 AbstractCegarLoop]: Abstraction has 774 states and 1733 transitions. [2019-12-18 21:08:27,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:08:27,500 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1733 transitions. [2019-12-18 21:08:27,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 21:08:27,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:27,502 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] [2019-12-18 21:08:27,502 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:08:27,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:27,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2012611512, now seen corresponding path program 4 times [2019-12-18 21:08:27,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:27,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369451064] [2019-12-18 21:08:27,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:27,559 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 21:08:27,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369451064] [2019-12-18 21:08:27,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:27,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:08:27,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647772787] [2019-12-18 21:08:27,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:08:27,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:27,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:08:27,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:08:27,562 INFO L87 Difference]: Start difference. First operand 774 states and 1733 transitions. Second operand 3 states. [2019-12-18 21:08:27,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:27,589 INFO L93 Difference]: Finished difference Result 772 states and 1728 transitions. [2019-12-18 21:08:27,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:08:27,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 21:08:27,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:27,599 INFO L225 Difference]: With dead ends: 772 [2019-12-18 21:08:27,599 INFO L226 Difference]: Without dead ends: 772 [2019-12-18 21:08:27,599 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 21:08:27,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-12-18 21:08:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 707. [2019-12-18 21:08:27,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-12-18 21:08:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1604 transitions. [2019-12-18 21:08:27,663 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1604 transitions. Word has length 41 [2019-12-18 21:08:27,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:27,665 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 1604 transitions. [2019-12-18 21:08:27,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:08:27,665 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1604 transitions. [2019-12-18 21:08:27,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 21:08:27,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:27,670 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] [2019-12-18 21:08:27,671 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:08:27,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:27,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1633589471, now seen corresponding path program 1 times [2019-12-18 21:08:27,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:27,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209611446] [2019-12-18 21:08:27,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:08:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:08:27,828 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:08:27,828 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:08:27,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t843~0.base_24| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t843~0.base_24|) |v_ULTIMATE.start_main_~#t843~0.offset_19| 0)) |v_#memory_int_15|) (= 0 v_~y$r_buff1_thd1~0_42) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$read_delayed_var~0.offset_8) (= 0 v_~y$w_buff1~0_24) (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~z~0_11 0) (= |v_#NULL.offset_3| 0) (= v_~y$read_delayed~0_8 0) (= |v_ULTIMATE.start_main_~#t843~0.offset_19| 0) (= 0 v_~y$flush_delayed~0_14) (= 0 v_~x~0_9) (= v_~y$r_buff0_thd2~0_29 0) (= 0 v_~y$r_buff1_thd0~0_24) (= v_~y$w_buff1_used~0_57 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t843~0.base_24|)) (= 0 v_~y$w_buff0_used~0_92) (= 0 v_~y$r_buff1_thd2~0_19) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t843~0.base_24|) (< 0 |v_#StackHeapBarrier_14|) (= v_~y~0_22 0) (= v_~y$r_buff0_thd0~0_21 0) (= |v_#valid_40| (store .cse0 |v_ULTIMATE.start_main_~#t843~0.base_24| 1)) (= v_~y$r_buff0_thd1~0_69 0) (= 0 v_~y$w_buff0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 |v_#NULL.base_3|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t843~0.base_24| 4)) (= 0 v_~y$read_delayed_var~0.base_8) (= v_~a~0_12 0) (= v_~y$mem_tmp~0_10 0) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~__unbuffered_cnt~0_18) (= 0 v_~weak$$choice2~0_31) (= v_~__unbuffered_p0_EBX~0_17 0) (= v_~__unbuffered_p1_EBX~0_18 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_92, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_~#t844~0.base=|v_ULTIMATE.start_main_~#t844~0.base_18|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_42, ~a~0=v_~a~0_12, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_main_~#t843~0.base=|v_ULTIMATE.start_main_~#t843~0.base_24|, ~y$w_buff0~0=v_~y$w_buff0~0_24, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_69, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_15|, ~y~0=v_~y~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_17, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_22|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_10|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ULTIMATE.start_main_~#t844~0.offset=|v_ULTIMATE.start_main_~#t844~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, #valid=|v_#valid_40|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~z~0=v_~z~0_11, ULTIMATE.start_main_~#t843~0.offset=|v_ULTIMATE.start_main_~#t843~0.offset_19|, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_9, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t844~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t843~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t844~0.offset, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ULTIMATE.start_main_~#t843~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:08:27,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L810-1-->L812: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t844~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t844~0.base_12| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t844~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t844~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t844~0.base_12| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t844~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t844~0.base_12|) |v_ULTIMATE.start_main_~#t844~0.offset_10| 1))) (= 0 |v_ULTIMATE.start_main_~#t844~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t844~0.offset=|v_ULTIMATE.start_main_~#t844~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t844~0.base=|v_ULTIMATE.start_main_~#t844~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t844~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t844~0.base] because there is no mapped edge [2019-12-18 21:08:27,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L5-->L787: Formula: (and (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-214814136)) (= ~y$r_buff1_thd0~0_Out-214814136 ~y$r_buff0_thd0~0_In-214814136) (= 1 ~z~0_Out-214814136) (= ~__unbuffered_p1_EAX~0_Out-214814136 ~z~0_Out-214814136) (= ~y$r_buff1_thd2~0_Out-214814136 ~y$r_buff0_thd2~0_In-214814136) (= 1 ~y$r_buff0_thd2~0_Out-214814136) (= ~y$r_buff0_thd1~0_In-214814136 ~y$r_buff1_thd1~0_Out-214814136) (= ~__unbuffered_p1_EBX~0_Out-214814136 ~a~0_In-214814136)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-214814136, ~a~0=~a~0_In-214814136, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-214814136, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-214814136, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-214814136} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-214814136, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-214814136, ~a~0=~a~0_In-214814136, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-214814136, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-214814136, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-214814136, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-214814136, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-214814136, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-214814136, ~z~0=~z~0_Out-214814136, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-214814136} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 21:08:27,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In2116319710 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2116319710 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_Out2116319710| ~y$w_buff0_used~0_In2116319710) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out2116319710| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2116319710, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2116319710} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2116319710, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2116319710, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out2116319710|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 21:08:27,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1926115410 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1926115410 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1926115410 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1926115410 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite29_Out1926115410| ~y$w_buff1_used~0_In1926115410)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite29_Out1926115410|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1926115410, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1926115410, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1926115410, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1926115410} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1926115410, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1926115410|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1926115410, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1926115410, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1926115410} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 21:08:27,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_44 v_~y$r_buff0_thd1~0_43) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_44, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_9|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_43, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-18 21:08:27,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L752-->L752-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1924739419 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite23_In1924739419| |P0Thread1of1ForFork0_#t~ite23_Out1924739419|) (= |P0Thread1of1ForFork0_#t~ite24_Out1924739419| ~y$r_buff1_thd1~0_In1924739419)) (and (= |P0Thread1of1ForFork0_#t~ite23_Out1924739419| ~y$r_buff1_thd1~0_In1924739419) (= |P0Thread1of1ForFork0_#t~ite23_Out1924739419| |P0Thread1of1ForFork0_#t~ite24_Out1924739419|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1924739419 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1924739419 256))) (and (= 0 (mod ~y$r_buff1_thd1~0_In1924739419 256)) .cse1) (= (mod ~y$w_buff0_used~0_In1924739419 256) 0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1924739419, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1924739419, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1924739419, ~weak$$choice2~0=~weak$$choice2~0_In1924739419, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1924739419, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In1924739419|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1924739419, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1924739419, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1924739419, ~weak$$choice2~0=~weak$$choice2~0_In1924739419, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out1924739419|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out1924739419|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1924739419} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-18 21:08:27,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= v_~y~0_15 v_~y$mem_tmp~0_4) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 21:08:27,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1405549978 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1405549978 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In-1405549978 ~y$r_buff0_thd2~0_Out-1405549978) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out-1405549978)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1405549978, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1405549978} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1405549978|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1405549978, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1405549978} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 21:08:27,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-230232475 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-230232475 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-230232475 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-230232475 256)))) (or (and (= ~y$r_buff1_thd2~0_In-230232475 |P1Thread1of1ForFork1_#t~ite31_Out-230232475|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite31_Out-230232475|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-230232475, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-230232475, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-230232475, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-230232475} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-230232475, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-230232475, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-230232475|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-230232475, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-230232475} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 21:08:27,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L791-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite31_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:08:27,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:08:27,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1693690401 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1693690401 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite34_Out-1693690401| ~y$w_buff1~0_In-1693690401) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-1693690401| ~y~0_In-1693690401)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1693690401, ~y~0=~y~0_In-1693690401, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1693690401, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1693690401} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1693690401, ~y~0=~y~0_In-1693690401, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1693690401, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1693690401|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1693690401} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 21:08:27,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite34_8|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 21:08:27,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1450586962 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1450586962 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite36_Out1450586962|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out1450586962| ~y$w_buff0_used~0_In1450586962)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1450586962, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1450586962} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1450586962, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1450586962, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1450586962|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 21:08:27,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In147239881 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In147239881 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In147239881 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In147239881 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out147239881| 0)) (and (= |ULTIMATE.start_main_#t~ite37_Out147239881| ~y$w_buff1_used~0_In147239881) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In147239881, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In147239881, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In147239881, ~y$w_buff1_used~0=~y$w_buff1_used~0_In147239881} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In147239881, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In147239881, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out147239881|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In147239881, ~y$w_buff1_used~0=~y$w_buff1_used~0_In147239881} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 21:08:27,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1045225568 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1045225568 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-1045225568| ~y$r_buff0_thd0~0_In-1045225568) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out-1045225568|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1045225568, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1045225568} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1045225568, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1045225568, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1045225568|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 21:08:27,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1942651516 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1942651516 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1942651516 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1942651516 256) 0))) (or (and (= ~y$r_buff1_thd0~0_In1942651516 |ULTIMATE.start_main_#t~ite39_Out1942651516|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out1942651516|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1942651516, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1942651516, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1942651516, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1942651516} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1942651516, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1942651516|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1942651516, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1942651516, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1942651516} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:08:27,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EBX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite39_12| v_~y$r_buff1_thd0~0_16) (= 1 v_~__unbuffered_p1_EAX~0_10) (= v_~__unbuffered_p1_EBX~0_10 0) (= v_~__unbuffered_p0_EAX~0_8 1) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_8 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:08:27,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:08:27 BasicIcfg [2019-12-18 21:08:27,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:08:27,913 INFO L168 Benchmark]: Toolchain (without parser) took 9736.19 ms. Allocated memory was 138.9 MB in the beginning and 370.7 MB in the end (delta: 231.7 MB). Free memory was 102.3 MB in the beginning and 263.7 MB in the end (delta: -161.4 MB). Peak memory consumption was 70.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:08:27,914 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 21:08:27,915 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.45 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.9 MB in the beginning and 156.3 MB in the end (delta: -54.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:08:27,916 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.62 ms. Allocated memory is still 203.4 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:08:27,916 INFO L168 Benchmark]: Boogie Preprocessor took 36.22 ms. Allocated memory is still 203.4 MB. Free memory was 153.6 MB in the beginning and 151.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:08:27,917 INFO L168 Benchmark]: RCFGBuilder took 792.27 ms. Allocated memory is still 203.4 MB. Free memory was 151.6 MB in the beginning and 109.8 MB in the end (delta: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:08:27,918 INFO L168 Benchmark]: TraceAbstraction took 8037.16 ms. Allocated memory was 203.4 MB in the beginning and 370.7 MB in the end (delta: 167.2 MB). Free memory was 109.1 MB in the beginning and 263.7 MB in the end (delta: -154.6 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:08:27,921 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.50 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.45 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.9 MB in the beginning and 156.3 MB in the end (delta: -54.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.62 ms. Allocated memory is still 203.4 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.22 ms. Allocated memory is still 203.4 MB. Free memory was 153.6 MB in the beginning and 151.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 792.27 ms. Allocated memory is still 203.4 MB. Free memory was 151.6 MB in the beginning and 109.8 MB in the end (delta: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8037.16 ms. Allocated memory was 203.4 MB in the beginning and 370.7 MB in the end (delta: 167.2 MB). Free memory was 109.1 MB in the beginning and 263.7 MB in the end (delta: -154.6 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 139 ProgramPointsBefore, 68 ProgramPointsAfterwards, 167 TransitionsBefore, 79 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 20 ChoiceCompositions, 4338 VarBasedMoverChecksPositive, 128 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 46171 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t843, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L812] FCALL, FORK 0 pthread_create(&t844, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L787] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 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) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 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 [L818] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 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 [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.7s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1042 SDtfs, 796 SDslu, 1671 SDs, 0 SdLazy, 786 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6786occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 1209 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 25542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...