/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/mix009_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:14:03,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:14:03,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:14:03,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:14:03,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:14:03,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:14:03,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:14:03,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:14:03,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:14:03,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:14:03,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:14:03,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:14:03,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:14:03,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:14:03,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:14:03,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:14:03,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:14:03,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:14:03,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:14:03,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:14:03,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:14:03,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:14:03,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:14:03,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:14:03,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:14:03,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:14:03,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:14:03,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:14:03,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:14:03,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:14:03,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:14:03,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:14:03,915 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:14:03,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:14:03,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:14:03,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:14:03,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:14:03,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:14:03,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:14:03,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:14:03,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:14:03,920 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 20:14:03,940 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:14:03,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:14:03,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:14:03,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:14:03,942 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:14:03,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:14:03,943 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:14:03,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:14:03,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:14:03,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:14:03,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:14:03,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:14:03,945 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:14:03,945 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:14:03,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:14:03,946 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:14:03,946 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:14:03,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:14:03,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:14:03,946 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:14:03,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:14:03,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:14:03,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:14:03,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:14:03,947 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:14:03,948 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:14:03,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:14:03,948 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:14:03,948 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:14:03,948 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:14:04,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:14:04,233 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:14:04,237 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:14:04,239 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:14:04,239 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:14:04,240 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009_power.oepc.i [2019-12-18 20:14:04,309 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/168257473/83b3062474514e1eacd00fb78a3adc4d/FLAGc82ba1bba [2019-12-18 20:14:04,858 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:14:04,858 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009_power.oepc.i [2019-12-18 20:14:04,884 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/168257473/83b3062474514e1eacd00fb78a3adc4d/FLAGc82ba1bba [2019-12-18 20:14:05,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/168257473/83b3062474514e1eacd00fb78a3adc4d [2019-12-18 20:14:05,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:14:05,194 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:14:05,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:14:05,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:14:05,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:14:05,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:14:05" (1/1) ... [2019-12-18 20:14:05,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:14:05, skipping insertion in model container [2019-12-18 20:14:05,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:14:05" (1/1) ... [2019-12-18 20:14:05,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:14:05,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:14:05,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:14:05,854 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:14:05,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:14:05,990 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:14:05,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:14:05 WrapperNode [2019-12-18 20:14:05,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:14:05,992 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:14:05,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:14:05,992 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:14:06,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:14:05" (1/1) ... [2019-12-18 20:14:06,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:14:05" (1/1) ... [2019-12-18 20:14:06,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:14:06,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:14:06,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:14:06,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:14:06,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:14:05" (1/1) ... [2019-12-18 20:14:06,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:14:05" (1/1) ... [2019-12-18 20:14:06,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:14:05" (1/1) ... [2019-12-18 20:14:06,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:14:05" (1/1) ... [2019-12-18 20:14:06,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:14:05" (1/1) ... [2019-12-18 20:14:06,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:14:05" (1/1) ... [2019-12-18 20:14:06,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:14:05" (1/1) ... [2019-12-18 20:14:06,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:14:06,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:14:06,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:14:06,090 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:14:06,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:14:05" (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 20:14:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:14:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:14:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:14:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:14:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:14:06,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:14:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:14:06,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:14:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:14:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:14:06,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:14:06,169 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 20:14:06,869 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:14:06,869 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:14:06,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:14:06 BoogieIcfgContainer [2019-12-18 20:14:06,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:14:06,872 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:14:06,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:14:06,875 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:14:06,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:14:05" (1/3) ... [2019-12-18 20:14:06,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678438ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:14:06, skipping insertion in model container [2019-12-18 20:14:06,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:14:05" (2/3) ... [2019-12-18 20:14:06,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678438ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:14:06, skipping insertion in model container [2019-12-18 20:14:06,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:14:06" (3/3) ... [2019-12-18 20:14:06,879 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_power.oepc.i [2019-12-18 20:14:06,889 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:14:06,890 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:14:06,897 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:14:06,897 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:14:06,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,935 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,935 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,935 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,936 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,936 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,947 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,947 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,996 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,997 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:06,997 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,003 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,006 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:14:07,021 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 20:14:07,043 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:14:07,043 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:14:07,043 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:14:07,043 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:14:07,043 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:14:07,044 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:14:07,044 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:14:07,044 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:14:07,060 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 184 transitions [2019-12-18 20:14:07,062 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 184 transitions [2019-12-18 20:14:07,151 INFO L126 PetriNetUnfolder]: 41/182 cut-off events. [2019-12-18 20:14:07,152 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:14:07,171 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 182 events. 41/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 6/145 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 20:14:07,197 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 184 transitions [2019-12-18 20:14:07,244 INFO L126 PetriNetUnfolder]: 41/182 cut-off events. [2019-12-18 20:14:07,245 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:14:07,253 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 182 events. 41/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 6/145 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 20:14:07,271 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 20:14:07,272 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:14:10,222 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 20:14:10,338 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 20:14:10,711 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 20:14:10,830 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 20:14:10,853 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55163 [2019-12-18 20:14:10,853 INFO L214 etLargeBlockEncoding]: Total number of compositions: 104 [2019-12-18 20:14:10,857 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 88 transitions [2019-12-18 20:14:11,356 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-18 20:14:11,358 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-18 20:14:11,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 20:14:11,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:14:11,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 20:14:11,365 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:14:11,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:14:11,372 INFO L82 PathProgramCache]: Analyzing trace with hash 797231, now seen corresponding path program 1 times [2019-12-18 20:14:11,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:14:11,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431563314] [2019-12-18 20:14:11,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:14:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:14:11,596 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 20:14:11,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431563314] [2019-12-18 20:14:11,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:14:11,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:14:11,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903222454] [2019-12-18 20:14:11,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:14:11,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:14:11,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:14:11,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:14:11,620 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-18 20:14:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:14:11,899 INFO L93 Difference]: Finished difference Result 8466 states and 27782 transitions. [2019-12-18 20:14:11,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:14:11,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 20:14:11,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:14:11,997 INFO L225 Difference]: With dead ends: 8466 [2019-12-18 20:14:11,997 INFO L226 Difference]: Without dead ends: 7974 [2019-12-18 20:14:11,999 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 20:14:12,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7974 states. [2019-12-18 20:14:12,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7974 to 7974. [2019-12-18 20:14:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7974 states. [2019-12-18 20:14:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7974 states to 7974 states and 26121 transitions. [2019-12-18 20:14:12,569 INFO L78 Accepts]: Start accepts. Automaton has 7974 states and 26121 transitions. Word has length 3 [2019-12-18 20:14:12,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:14:12,570 INFO L462 AbstractCegarLoop]: Abstraction has 7974 states and 26121 transitions. [2019-12-18 20:14:12,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:14:12,570 INFO L276 IsEmpty]: Start isEmpty. Operand 7974 states and 26121 transitions. [2019-12-18 20:14:12,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:14:12,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:14:12,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:14:12,577 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:14:12,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:14:12,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1900393747, now seen corresponding path program 1 times [2019-12-18 20:14:12,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:14:12,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33956505] [2019-12-18 20:14:12,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:14:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:14:12,687 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 20:14:12,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33956505] [2019-12-18 20:14:12,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:14:12,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:14:12,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11928839] [2019-12-18 20:14:12,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:14:12,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:14:12,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:14:12,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:14:12,692 INFO L87 Difference]: Start difference. First operand 7974 states and 26121 transitions. Second operand 3 states. [2019-12-18 20:14:12,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:14:12,731 INFO L93 Difference]: Finished difference Result 1283 states and 2944 transitions. [2019-12-18 20:14:12,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:14:12,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 20:14:12,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:14:12,740 INFO L225 Difference]: With dead ends: 1283 [2019-12-18 20:14:12,740 INFO L226 Difference]: Without dead ends: 1283 [2019-12-18 20:14:12,742 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 20:14:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-12-18 20:14:12,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-12-18 20:14:12,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-12-18 20:14:12,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 2944 transitions. [2019-12-18 20:14:12,788 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 2944 transitions. Word has length 11 [2019-12-18 20:14:12,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:14:12,788 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 2944 transitions. [2019-12-18 20:14:12,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:14:12,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 2944 transitions. [2019-12-18 20:14:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:14:12,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:14:12,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:14:12,794 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:14:12,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:14:12,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1145267858, now seen corresponding path program 1 times [2019-12-18 20:14:12,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:14:12,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307517793] [2019-12-18 20:14:12,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:14:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:14:12,973 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 20:14:12,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307517793] [2019-12-18 20:14:12,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:14:12,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:14:12,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535810928] [2019-12-18 20:14:12,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:14:12,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:14:12,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:14:12,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:14:12,976 INFO L87 Difference]: Start difference. First operand 1283 states and 2944 transitions. Second operand 5 states. [2019-12-18 20:14:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:14:13,343 INFO L93 Difference]: Finished difference Result 1902 states and 4249 transitions. [2019-12-18 20:14:13,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:14:13,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 20:14:13,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:14:13,355 INFO L225 Difference]: With dead ends: 1902 [2019-12-18 20:14:13,355 INFO L226 Difference]: Without dead ends: 1902 [2019-12-18 20:14:13,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:14:13,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2019-12-18 20:14:13,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1604. [2019-12-18 20:14:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2019-12-18 20:14:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 3640 transitions. [2019-12-18 20:14:13,411 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 3640 transitions. Word has length 14 [2019-12-18 20:14:13,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:14:13,412 INFO L462 AbstractCegarLoop]: Abstraction has 1604 states and 3640 transitions. [2019-12-18 20:14:13,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:14:13,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 3640 transitions. [2019-12-18 20:14:13,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:14:13,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:14:13,415 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:14:13,415 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:14:13,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:14:13,416 INFO L82 PathProgramCache]: Analyzing trace with hash 318167262, now seen corresponding path program 1 times [2019-12-18 20:14:13,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:14:13,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317164929] [2019-12-18 20:14:13,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:14:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:14:13,580 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 20:14:13,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317164929] [2019-12-18 20:14:13,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:14:13,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:14:13,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189323684] [2019-12-18 20:14:13,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:14:13,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:14:13,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:14:13,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:14:13,582 INFO L87 Difference]: Start difference. First operand 1604 states and 3640 transitions. Second operand 6 states. [2019-12-18 20:14:14,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:14:14,020 INFO L93 Difference]: Finished difference Result 2385 states and 5172 transitions. [2019-12-18 20:14:14,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 20:14:14,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 20:14:14,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:14:14,034 INFO L225 Difference]: With dead ends: 2385 [2019-12-18 20:14:14,035 INFO L226 Difference]: Without dead ends: 2385 [2019-12-18 20:14:14,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:14:14,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2019-12-18 20:14:14,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1725. [2019-12-18 20:14:14,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1725 states. [2019-12-18 20:14:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 3880 transitions. [2019-12-18 20:14:14,085 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 3880 transitions. Word has length 25 [2019-12-18 20:14:14,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:14:14,086 INFO L462 AbstractCegarLoop]: Abstraction has 1725 states and 3880 transitions. [2019-12-18 20:14:14,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:14:14,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 3880 transitions. [2019-12-18 20:14:14,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 20:14:14,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:14:14,088 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 20:14:14,089 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:14:14,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:14:14,089 INFO L82 PathProgramCache]: Analyzing trace with hash 105464887, now seen corresponding path program 1 times [2019-12-18 20:14:14,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:14:14,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886275569] [2019-12-18 20:14:14,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:14:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:14:14,146 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 20:14:14,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886275569] [2019-12-18 20:14:14,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:14:14,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:14:14,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527387451] [2019-12-18 20:14:14,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:14:14,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:14:14,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:14:14,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:14:14,149 INFO L87 Difference]: Start difference. First operand 1725 states and 3880 transitions. Second operand 3 states. [2019-12-18 20:14:14,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:14:14,163 INFO L93 Difference]: Finished difference Result 1724 states and 3878 transitions. [2019-12-18 20:14:14,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:14:14,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 20:14:14,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:14:14,174 INFO L225 Difference]: With dead ends: 1724 [2019-12-18 20:14:14,174 INFO L226 Difference]: Without dead ends: 1724 [2019-12-18 20:14:14,175 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 20:14:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2019-12-18 20:14:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1724. [2019-12-18 20:14:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2019-12-18 20:14:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 3878 transitions. [2019-12-18 20:14:14,289 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 3878 transitions. Word has length 26 [2019-12-18 20:14:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:14:14,289 INFO L462 AbstractCegarLoop]: Abstraction has 1724 states and 3878 transitions. [2019-12-18 20:14:14,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:14:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 3878 transitions. [2019-12-18 20:14:14,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:14:14,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:14:14,293 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] [2019-12-18 20:14:14,293 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:14:14,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:14:14,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1972444125, now seen corresponding path program 1 times [2019-12-18 20:14:14,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:14:14,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699038582] [2019-12-18 20:14:14,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:14:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:14:14,411 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 20:14:14,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699038582] [2019-12-18 20:14:14,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:14:14,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:14:14,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311485946] [2019-12-18 20:14:14,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:14:14,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:14:14,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:14:14,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:14:14,414 INFO L87 Difference]: Start difference. First operand 1724 states and 3878 transitions. Second operand 5 states. [2019-12-18 20:14:14,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:14:14,915 INFO L93 Difference]: Finished difference Result 2512 states and 5536 transitions. [2019-12-18 20:14:14,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:14:14,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 20:14:14,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:14:14,943 INFO L225 Difference]: With dead ends: 2512 [2019-12-18 20:14:14,944 INFO L226 Difference]: Without dead ends: 2512 [2019-12-18 20:14:14,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:14:14,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2019-12-18 20:14:14,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 2217. [2019-12-18 20:14:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2217 states. [2019-12-18 20:14:14,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 4954 transitions. [2019-12-18 20:14:14,997 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 4954 transitions. Word has length 27 [2019-12-18 20:14:14,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:14:14,997 INFO L462 AbstractCegarLoop]: Abstraction has 2217 states and 4954 transitions. [2019-12-18 20:14:14,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:14:14,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 4954 transitions. [2019-12-18 20:14:15,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:14:15,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:14:15,001 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] [2019-12-18 20:14:15,001 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:14:15,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:14:15,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1233611304, now seen corresponding path program 1 times [2019-12-18 20:14:15,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:14:15,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505558629] [2019-12-18 20:14:15,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:14:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:14:15,046 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 20:14:15,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505558629] [2019-12-18 20:14:15,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:14:15,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:14:15,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274153939] [2019-12-18 20:14:15,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:14:15,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:14:15,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:14:15,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:14:15,048 INFO L87 Difference]: Start difference. First operand 2217 states and 4954 transitions. Second operand 4 states. [2019-12-18 20:14:15,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:14:15,065 INFO L93 Difference]: Finished difference Result 1233 states and 2633 transitions. [2019-12-18 20:14:15,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:14:15,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 20:14:15,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:14:15,069 INFO L225 Difference]: With dead ends: 1233 [2019-12-18 20:14:15,069 INFO L226 Difference]: Without dead ends: 1233 [2019-12-18 20:14:15,069 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 20:14:15,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2019-12-18 20:14:15,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1144. [2019-12-18 20:14:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2019-12-18 20:14:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 2469 transitions. [2019-12-18 20:14:15,096 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 2469 transitions. Word has length 28 [2019-12-18 20:14:15,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:14:15,096 INFO L462 AbstractCegarLoop]: Abstraction has 1144 states and 2469 transitions. [2019-12-18 20:14:15,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:14:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 2469 transitions. [2019-12-18 20:14:15,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 20:14:15,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:14:15,100 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:14:15,100 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:14:15,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:14:15,100 INFO L82 PathProgramCache]: Analyzing trace with hash -103643440, now seen corresponding path program 1 times [2019-12-18 20:14:15,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:14:15,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758880287] [2019-12-18 20:14:15,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:14:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:14:15,138 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 20:14:15,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758880287] [2019-12-18 20:14:15,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:14:15,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:14:15,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928241068] [2019-12-18 20:14:15,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:14:15,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:14:15,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:14:15,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:14:15,141 INFO L87 Difference]: Start difference. First operand 1144 states and 2469 transitions. Second operand 3 states. [2019-12-18 20:14:15,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:14:15,189 INFO L93 Difference]: Finished difference Result 1748 states and 3666 transitions. [2019-12-18 20:14:15,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:14:15,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 20:14:15,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:14:15,194 INFO L225 Difference]: With dead ends: 1748 [2019-12-18 20:14:15,194 INFO L226 Difference]: Without dead ends: 1748 [2019-12-18 20:14:15,194 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 20:14:15,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2019-12-18 20:14:15,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1269. [2019-12-18 20:14:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1269 states. [2019-12-18 20:14:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2718 transitions. [2019-12-18 20:14:15,226 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2718 transitions. Word has length 51 [2019-12-18 20:14:15,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:14:15,228 INFO L462 AbstractCegarLoop]: Abstraction has 1269 states and 2718 transitions. [2019-12-18 20:14:15,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:14:15,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2718 transitions. [2019-12-18 20:14:15,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 20:14:15,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:14:15,232 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:14:15,232 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:14:15,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:14:15,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1679671031, now seen corresponding path program 1 times [2019-12-18 20:14:15,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:14:15,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420147370] [2019-12-18 20:14:15,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:14:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:14:15,308 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 20:14:15,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420147370] [2019-12-18 20:14:15,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:14:15,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:14:15,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91814863] [2019-12-18 20:14:15,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:14:15,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:14:15,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:14:15,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:14:15,311 INFO L87 Difference]: Start difference. First operand 1269 states and 2718 transitions. Second operand 3 states. [2019-12-18 20:14:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:14:15,372 INFO L93 Difference]: Finished difference Result 1638 states and 3474 transitions. [2019-12-18 20:14:15,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:14:15,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 20:14:15,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:14:15,377 INFO L225 Difference]: With dead ends: 1638 [2019-12-18 20:14:15,377 INFO L226 Difference]: Without dead ends: 1638 [2019-12-18 20:14:15,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 20:14:15,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2019-12-18 20:14:15,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1309. [2019-12-18 20:14:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-12-18 20:14:15,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 2822 transitions. [2019-12-18 20:14:15,409 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 2822 transitions. Word has length 51 [2019-12-18 20:14:15,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:14:15,410 INFO L462 AbstractCegarLoop]: Abstraction has 1309 states and 2822 transitions. [2019-12-18 20:14:15,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:14:15,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 2822 transitions. [2019-12-18 20:14:15,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 20:14:15,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:14:15,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:14:15,414 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:14:15,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:14:15,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1121458904, now seen corresponding path program 1 times [2019-12-18 20:14:15,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:14:15,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458047305] [2019-12-18 20:14:15,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:14:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:14:15,778 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 20:14:15,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458047305] [2019-12-18 20:14:15,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:14:15,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:14:15,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778105010] [2019-12-18 20:14:15,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:14:15,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:14:15,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:14:15,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:14:15,781 INFO L87 Difference]: Start difference. First operand 1309 states and 2822 transitions. Second operand 10 states. [2019-12-18 20:14:17,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:14:17,154 INFO L93 Difference]: Finished difference Result 2136 states and 4445 transitions. [2019-12-18 20:14:17,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 20:14:17,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-12-18 20:14:17,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:14:17,162 INFO L225 Difference]: With dead ends: 2136 [2019-12-18 20:14:17,162 INFO L226 Difference]: Without dead ends: 2136 [2019-12-18 20:14:17,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2019-12-18 20:14:17,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2019-12-18 20:14:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 1260. [2019-12-18 20:14:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1260 states. [2019-12-18 20:14:17,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 2688 transitions. [2019-12-18 20:14:17,196 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 2688 transitions. Word has length 52 [2019-12-18 20:14:17,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:14:17,196 INFO L462 AbstractCegarLoop]: Abstraction has 1260 states and 2688 transitions. [2019-12-18 20:14:17,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:14:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 2688 transitions. [2019-12-18 20:14:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 20:14:17,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:14:17,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:14:17,200 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:14:17,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:14:17,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1607564162, now seen corresponding path program 2 times [2019-12-18 20:14:17,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:14:17,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21121299] [2019-12-18 20:14:17,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:14:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:14:17,282 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 20:14:17,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21121299] [2019-12-18 20:14:17,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:14:17,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:14:17,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749085025] [2019-12-18 20:14:17,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:14:17,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:14:17,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:14:17,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:14:17,285 INFO L87 Difference]: Start difference. First operand 1260 states and 2688 transitions. Second operand 3 states. [2019-12-18 20:14:17,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:14:17,302 INFO L93 Difference]: Finished difference Result 1259 states and 2686 transitions. [2019-12-18 20:14:17,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:14:17,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 20:14:17,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:14:17,306 INFO L225 Difference]: With dead ends: 1259 [2019-12-18 20:14:17,307 INFO L226 Difference]: Without dead ends: 1259 [2019-12-18 20:14:17,307 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 20:14:17,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2019-12-18 20:14:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 927. [2019-12-18 20:14:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-12-18 20:14:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2008 transitions. [2019-12-18 20:14:17,329 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2008 transitions. Word has length 52 [2019-12-18 20:14:17,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:14:17,330 INFO L462 AbstractCegarLoop]: Abstraction has 927 states and 2008 transitions. [2019-12-18 20:14:17,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:14:17,330 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2008 transitions. [2019-12-18 20:14:17,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 20:14:17,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:14:17,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:14:17,333 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:14:17,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:14:17,334 INFO L82 PathProgramCache]: Analyzing trace with hash 622873229, now seen corresponding path program 1 times [2019-12-18 20:14:17,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:14:17,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928975861] [2019-12-18 20:14:17,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:14:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:14:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:14:17,523 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:14:17,523 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:14:17,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] ULTIMATE.startENTRY-->L809: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= v_~z$r_buff0_thd0~0_22 0) (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= v_~x~0_11 0) (= |v_ULTIMATE.start_main_~#t241~0.offset_18| 0) (= 0 v_~weak$$choice0~0_8) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t241~0.base_26|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t241~0.base_26| 4)) (= 0 v_~z$r_buff1_thd2~0_53) (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~__unbuffered_p1_EAX~0_11) (= v_~z$w_buff0_used~0_101 0) (= v_~z~0_26 0) (= 0 v_~z$r_buff1_thd0~0_21) (= v_~z$read_delayed~0_8 0) (= 0 v_~z$w_buff1~0_21) (= v_~z$r_buff0_thd1~0_30 0) (= v_~z$read_delayed_var~0.base_8 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t241~0.base_26|) 0) (= 0 v_~__unbuffered_cnt~0_14) (= 0 v_~z$r_buff1_thd1~0_21) (= 0 v_~z$flush_delayed~0_14) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd2~0_77 0) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t241~0.base_26| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t241~0.base_26|) |v_ULTIMATE.start_main_~#t241~0.offset_18| 0)) |v_#memory_int_15|) (= v_~y~0_10 0) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t241~0.base_26| 1)) (= 0 v_~z$w_buff0~0_25) (= v_~__unbuffered_p1_EBX~0_12 0) (= 0 v_~z$w_buff1_used~0_66) (= v_~z$read_delayed_var~0.offset_8 0) (< 0 |v_#StackHeapBarrier_13|) (= v_~__unbuffered_p0_EBX~0_15 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_53, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_21, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_~#t241~0.base=|v_ULTIMATE.start_main_~#t241~0.base_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_~#t241~0.offset=|v_ULTIMATE.start_main_~#t241~0.offset_18|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t242~0.base=|v_ULTIMATE.start_main_~#t242~0.base_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_21, #length=|v_#length_19|, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_77, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_101, ~z$w_buff0~0=v_~z$w_buff0~0_25, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_66, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_49|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_21, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_30, ~x~0=v_~x~0_11, ULTIMATE.start_main_~#t242~0.offset=|v_ULTIMATE.start_main_~#t242~0.offset_17|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t241~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t241~0.offset, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t242~0.base, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0, ULTIMATE.start_main_~#t242~0.offset] because there is no mapped edge [2019-12-18 20:14:17,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L4-->L750: Formula: (and (= ~z$r_buff1_thd2~0_Out-599082125 ~z$r_buff0_thd2~0_In-599082125) (= ~__unbuffered_p0_EBX~0_Out-599082125 ~y~0_In-599082125) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-599082125 0)) (= ~z$r_buff0_thd1~0_In-599082125 ~z$r_buff1_thd1~0_Out-599082125) (= ~x~0_Out-599082125 ~__unbuffered_p0_EAX~0_Out-599082125) (= ~x~0_Out-599082125 1) (= ~z$r_buff1_thd0~0_Out-599082125 ~z$r_buff0_thd0~0_In-599082125) (= ~z$r_buff0_thd1~0_Out-599082125 1)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-599082125, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-599082125, ~y~0=~y~0_In-599082125, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-599082125, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-599082125} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-599082125, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-599082125, ~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out-599082125, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-599082125, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-599082125, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-599082125, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-599082125, ~y~0=~y~0_In-599082125, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-599082125, ~x~0=~x~0_Out-599082125, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-599082125} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 20:14:17,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L809-1-->L811: Formula: (and (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t242~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t242~0.offset_11| 0) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t242~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t242~0.base_12|) |v_ULTIMATE.start_main_~#t242~0.offset_11| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t242~0.base_12|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t242~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t242~0.base_12| 0)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t242~0.base_12| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t242~0.base=|v_ULTIMATE.start_main_~#t242~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t242~0.offset=|v_ULTIMATE.start_main_~#t242~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t242~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t242~0.offset] because there is no mapped edge [2019-12-18 20:14:17,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L777-->L777-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1626594613 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out1626594613| |P1Thread1of1ForFork1_#t~ite20_Out1626594613|) (= ~z$w_buff0_used~0_In1626594613 |P1Thread1of1ForFork1_#t~ite20_Out1626594613|) (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1626594613 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1626594613 256)) (and (= (mod ~z$w_buff1_used~0_In1626594613 256) 0) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd2~0_In1626594613 256) 0))))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out1626594613| ~z$w_buff0_used~0_In1626594613) (= |P1Thread1of1ForFork1_#t~ite20_In1626594613| |P1Thread1of1ForFork1_#t~ite20_Out1626594613|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1626594613, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1626594613|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1626594613, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1626594613, ~weak$$choice2~0=~weak$$choice2~0_In1626594613, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1626594613} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1626594613, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1626594613|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1626594613, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1626594613, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1626594613|, ~weak$$choice2~0=~weak$$choice2~0_In1626594613, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1626594613} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 20:14:17,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L779-->L780: Formula: (and (= v_~z$r_buff0_thd2~0_58 v_~z$r_buff0_thd2~0_57) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_20, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_58} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 20:14:17,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In989035777 256)))) (or (and (= ~z$r_buff1_thd2~0_In989035777 |P1Thread1of1ForFork1_#t~ite30_Out989035777|) (= |P1Thread1of1ForFork1_#t~ite29_In989035777| |P1Thread1of1ForFork1_#t~ite29_Out989035777|) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out989035777| |P1Thread1of1ForFork1_#t~ite30_Out989035777|) (= |P1Thread1of1ForFork1_#t~ite29_Out989035777| ~z$r_buff1_thd2~0_In989035777) (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In989035777 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In989035777 256) 0) .cse1) (and (= (mod ~z$r_buff1_thd2~0_In989035777 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In989035777 256))))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In989035777|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In989035777, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In989035777, ~z$w_buff1_used~0=~z$w_buff1_used~0_In989035777, ~weak$$choice2~0=~weak$$choice2~0_In989035777, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In989035777} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out989035777|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out989035777|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In989035777, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In989035777, ~z$w_buff1_used~0=~z$w_buff1_used~0_In989035777, ~weak$$choice2~0=~weak$$choice2~0_In989035777, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In989035777} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 20:14:17,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-->L786: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_19 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 20:14:17,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L786-2-->L786-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out-588404070| |P1Thread1of1ForFork1_#t~ite32_Out-588404070|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-588404070 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-588404070 256)))) (or (and (not .cse0) (not .cse1) .cse2 (= ~z$w_buff1~0_In-588404070 |P1Thread1of1ForFork1_#t~ite32_Out-588404070|)) (and (= ~z~0_In-588404070 |P1Thread1of1ForFork1_#t~ite32_Out-588404070|) .cse2 (or .cse0 .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-588404070, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-588404070, ~z$w_buff1~0=~z$w_buff1~0_In-588404070, ~z~0=~z~0_In-588404070} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-588404070, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-588404070, ~z$w_buff1~0=~z$w_buff1~0_In-588404070, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-588404070|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-588404070|, ~z~0=~z~0_In-588404070} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 20:14:17,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In433693143 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In433693143 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out433693143| 0)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out433693143| ~z$w_buff0_used~0_In433693143) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In433693143, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In433693143} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In433693143, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out433693143|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In433693143} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 20:14:17,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-737918992 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-737918992 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-737918992 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-737918992 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-737918992| ~z$w_buff1_used~0_In-737918992)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-737918992|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-737918992, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-737918992, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-737918992, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-737918992} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-737918992, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-737918992, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-737918992, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-737918992|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-737918992} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 20:14:17,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In2124312925 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2124312925 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In2124312925 |P1Thread1of1ForFork1_#t~ite36_Out2124312925|)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out2124312925| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2124312925, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2124312925} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2124312925, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2124312925, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out2124312925|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 20:14:17,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1286798623 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1286798623 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1286798623|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1286798623 |P0Thread1of1ForFork0_#t~ite5_Out-1286798623|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1286798623, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1286798623} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1286798623|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1286798623, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1286798623} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 20:14:17,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-886871821 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-886871821 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-886871821 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-886871821 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-886871821| 0)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-886871821 |P0Thread1of1ForFork0_#t~ite6_Out-886871821|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-886871821, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-886871821, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-886871821, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-886871821} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-886871821|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-886871821, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-886871821, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-886871821, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-886871821} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 20:14:17,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-884031542 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-884031542 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-884031542 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-884031542 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out-884031542| ~z$r_buff1_thd2~0_In-884031542) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-884031542| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-884031542, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-884031542, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-884031542, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-884031542} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-884031542, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-884031542, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-884031542, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-884031542, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-884031542|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 20:14:17,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L790-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~z$r_buff1_thd2~0_43 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 20:14:17,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L753-->L754: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In1551650700 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1551650700 256)))) (or (and (= ~z$r_buff0_thd1~0_In1551650700 ~z$r_buff0_thd1~0_Out1551650700) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out1551650700)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1551650700, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1551650700} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1551650700, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1551650700|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1551650700} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:14:17,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L754-->L754-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1434277379 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1434277379 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1434277379 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-1434277379 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1434277379| ~z$r_buff1_thd1~0_In-1434277379) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1434277379| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1434277379, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1434277379, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1434277379, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1434277379} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1434277379, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1434277379|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1434277379, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1434277379, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1434277379} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 20:14:17,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_15) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:14:17,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L811-1-->L817: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_3|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 20:14:17,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L817-2-->L817-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In992985070 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In992985070 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In992985070 |ULTIMATE.start_main_#t~ite40_Out992985070|)) (and (= ~z~0_In992985070 |ULTIMATE.start_main_#t~ite40_Out992985070|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In992985070, ~z$w_buff1_used~0=~z$w_buff1_used~0_In992985070, ~z$w_buff1~0=~z$w_buff1~0_In992985070, ~z~0=~z~0_In992985070} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out992985070|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In992985070, ~z$w_buff1_used~0=~z$w_buff1_used~0_In992985070, ~z$w_buff1~0=~z$w_buff1~0_In992985070, ~z~0=~z~0_In992985070} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 20:14:17,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L817-4-->L818: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-18 20:14:17,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1203445965 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1203445965 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-1203445965|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1203445965 |ULTIMATE.start_main_#t~ite42_Out-1203445965|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1203445965, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1203445965} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1203445965, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1203445965, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1203445965|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:14:17,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In305630865 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In305630865 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In305630865 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In305630865 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out305630865| ~z$w_buff1_used~0_In305630865) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite43_Out305630865| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In305630865, ~z$w_buff0_used~0=~z$w_buff0_used~0_In305630865, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In305630865, ~z$w_buff1_used~0=~z$w_buff1_used~0_In305630865} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In305630865, ~z$w_buff0_used~0=~z$w_buff0_used~0_In305630865, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In305630865, ~z$w_buff1_used~0=~z$w_buff1_used~0_In305630865, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out305630865|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 20:14:17,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1239260051 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1239260051 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out1239260051|)) (and (= ~z$r_buff0_thd0~0_In1239260051 |ULTIMATE.start_main_#t~ite44_Out1239260051|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1239260051, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1239260051} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1239260051, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1239260051, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1239260051|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:14:17,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1127793731 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1127793731 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1127793731 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1127793731 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1127793731|)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1127793731| ~z$r_buff1_thd0~0_In-1127793731) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1127793731, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1127793731, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1127793731, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1127793731} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1127793731, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1127793731, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1127793731, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1127793731, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1127793731|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:14:17,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L821-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_12 256)) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 1 v_~__unbuffered_p1_EAX~0_7) (= v_~__unbuffered_p0_EBX~0_11 0) (= 1 v_~__unbuffered_p0_EAX~0_11) (= v_~main$tmp_guard1~0_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_11| v_~z$r_buff1_thd0~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_11, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_11, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:14:17,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:14:17 BasicIcfg [2019-12-18 20:14:17,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:14:17,695 INFO L168 Benchmark]: Toolchain (without parser) took 12502.22 ms. Allocated memory was 137.9 MB in the beginning and 413.7 MB in the end (delta: 275.8 MB). Free memory was 100.6 MB in the beginning and 316.9 MB in the end (delta: -216.3 MB). Peak memory consumption was 328.5 MB. Max. memory is 7.1 GB. [2019-12-18 20:14:17,696 INFO L168 Benchmark]: CDTParser took 1.24 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 20:14:17,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 795.56 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.4 MB in the beginning and 153.9 MB in the end (delta: -53.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 20:14:17,698 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.06 ms. Allocated memory is still 201.3 MB. Free memory was 153.9 MB in the beginning and 151.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:14:17,698 INFO L168 Benchmark]: Boogie Preprocessor took 37.44 ms. Allocated memory is still 201.3 MB. Free memory was 151.1 MB in the beginning and 149.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 20:14:17,699 INFO L168 Benchmark]: RCFGBuilder took 780.94 ms. Allocated memory is still 201.3 MB. Free memory was 148.3 MB in the beginning and 104.1 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-18 20:14:17,700 INFO L168 Benchmark]: TraceAbstraction took 10820.61 ms. Allocated memory was 201.3 MB in the beginning and 413.7 MB in the end (delta: 212.3 MB). Free memory was 103.4 MB in the beginning and 316.9 MB in the end (delta: -213.5 MB). Peak memory consumption was 267.9 MB. Max. memory is 7.1 GB. [2019-12-18 20:14:17,703 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.24 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 795.56 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.4 MB in the beginning and 153.9 MB in the end (delta: -53.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.06 ms. Allocated memory is still 201.3 MB. Free memory was 153.9 MB in the beginning and 151.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.44 ms. Allocated memory is still 201.3 MB. Free memory was 151.1 MB in the beginning and 149.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 780.94 ms. Allocated memory is still 201.3 MB. Free memory was 148.3 MB in the beginning and 104.1 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10820.61 ms. Allocated memory was 201.3 MB in the beginning and 413.7 MB in the end (delta: 212.3 MB). Free memory was 103.4 MB in the beginning and 316.9 MB in the end (delta: -213.5 MB). Peak memory consumption was 267.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 150 ProgramPointsBefore, 77 ProgramPointsAfterwards, 184 TransitionsBefore, 88 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4562 VarBasedMoverChecksPositive, 167 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 55163 CheckedPairsTotal, 104 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L809] FCALL, FORK 0 pthread_create(&t241, ((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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 1 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK 0 pthread_create(&t242, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 [L767] 2 __unbuffered_p1_EAX = y [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 z$flush_delayed = weak$$choice2 [L773] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L775] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L777] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L778] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L789] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.4s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1253 SDtfs, 1193 SDslu, 2120 SDs, 0 SdLazy, 2007 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 15 SyntacticMatches, 9 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred 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: 1.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 3358 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 393 NumberOfCodeBlocks, 393 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 329 ConstructedInterpolants, 0 QuantifiedInterpolants, 49789 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...