/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:02:44,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:02:44,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:02:44,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:02:44,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:02:44,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:02:44,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:02:44,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:02:44,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:02:44,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:02:44,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:02:44,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:02:44,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:02:44,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:02:44,889 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:02:44,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:02:44,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:02:44,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:02:44,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:02:44,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:02:44,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:02:44,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:02:44,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:02:44,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:02:44,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:02:44,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:02:44,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:02:44,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:02:44,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:02:44,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:02:44,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:02:44,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:02:44,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:02:44,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:02:44,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:02:44,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:02:44,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:02:44,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:02:44,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:02:44,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:02:44,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:02:44,914 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-MCR.epf [2019-12-27 20:02:44,928 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:02:44,929 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:02:44,930 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:02:44,930 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:02:44,930 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:02:44,931 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:02:44,931 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:02:44,931 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:02:44,931 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:02:44,931 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:02:44,932 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:02:44,932 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:02:44,932 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:02:44,932 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:02:44,932 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:02:44,933 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:02:44,933 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:02:44,933 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:02:44,933 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:02:44,933 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:02:44,933 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:02:44,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:02:44,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:02:44,934 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:02:44,934 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:02:44,934 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:02:44,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:02:44,935 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:02:44,935 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:02:44,935 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:02:44,935 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:02:44,936 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:02:45,207 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:02:45,226 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:02:45,230 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:02:45,232 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:02:45,233 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:02:45,234 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_power.opt.i [2019-12-27 20:02:45,312 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae7403c7/4bb0b9ec5f3d401ebcbbec226cd74e37/FLAG01037d6e0 [2019-12-27 20:02:45,897 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:02:45,898 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.opt.i [2019-12-27 20:02:45,912 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae7403c7/4bb0b9ec5f3d401ebcbbec226cd74e37/FLAG01037d6e0 [2019-12-27 20:02:46,126 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae7403c7/4bb0b9ec5f3d401ebcbbec226cd74e37 [2019-12-27 20:02:46,138 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:02:46,140 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:02:46,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:02:46,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:02:46,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:02:46,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:02:46" (1/1) ... [2019-12-27 20:02:46,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230b7f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:46, skipping insertion in model container [2019-12-27 20:02:46,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:02:46" (1/1) ... [2019-12-27 20:02:46,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:02:46,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:02:46,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:02:46,798 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:02:46,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:02:46,928 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:02:46,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:46 WrapperNode [2019-12-27 20:02:46,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:02:46,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:02:46,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:02:46,930 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:02:46,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:46" (1/1) ... [2019-12-27 20:02:46,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:46" (1/1) ... [2019-12-27 20:02:46,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:02:46,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:02:46,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:02:46,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:02:46,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:46" (1/1) ... [2019-12-27 20:02:46,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:46" (1/1) ... [2019-12-27 20:02:47,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:46" (1/1) ... [2019-12-27 20:02:47,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:46" (1/1) ... [2019-12-27 20:02:47,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:46" (1/1) ... [2019-12-27 20:02:47,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:46" (1/1) ... [2019-12-27 20:02:47,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:46" (1/1) ... [2019-12-27 20:02:47,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:02:47,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:02:47,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:02:47,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:02:47,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:02:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:02:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:02:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:02:47,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:02:47,099 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:02:47,099 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:02:47,099 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:02:47,099 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:02:47,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:02:47,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:02:47,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:02:47,102 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:02:47,830 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:02:47,830 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:02:47,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:02:47 BoogieIcfgContainer [2019-12-27 20:02:47,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:02:47,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:02:47,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:02:47,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:02:47,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:02:46" (1/3) ... [2019-12-27 20:02:47,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436f05d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:02:47, skipping insertion in model container [2019-12-27 20:02:47,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:46" (2/3) ... [2019-12-27 20:02:47,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436f05d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:02:47, skipping insertion in model container [2019-12-27 20:02:47,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:02:47" (3/3) ... [2019-12-27 20:02:47,843 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_power.opt.i [2019-12-27 20:02:47,854 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:02:47,854 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:02:47,867 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:02:47,868 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:02:47,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,914 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,914 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,915 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,915 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,916 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,927 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,927 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,980 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,980 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,980 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,989 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,991 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:47,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:48,007 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 20:02:48,029 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:02:48,029 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:02:48,029 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:02:48,029 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:02:48,029 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:02:48,029 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:02:48,030 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:02:48,030 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:02:48,056 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 20:02:48,058 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 20:02:48,159 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 20:02:48,159 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:02:48,174 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:02:48,192 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 20:02:48,238 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 20:02:48,238 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:02:48,244 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:02:48,259 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 20:02:48,260 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:02:51,639 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 20:02:51,755 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 20:02:51,783 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49139 [2019-12-27 20:02:51,783 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-27 20:02:51,786 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-27 20:02:52,234 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8357 states. [2019-12-27 20:02:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 8357 states. [2019-12-27 20:02:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:02:52,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:52,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:02:52,244 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:02:52,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:52,250 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-27 20:02:52,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:52,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086871292] [2019-12-27 20:02:52,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:52,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086871292] [2019-12-27 20:02:52,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:52,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:02:52,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1413474066] [2019-12-27 20:02:52,448 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:52,453 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:52,467 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:02:52,467 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:52,471 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:52,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:02:52,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:52,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:02:52,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:52,489 INFO L87 Difference]: Start difference. First operand 8357 states. Second operand 3 states. [2019-12-27 20:02:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:52,777 INFO L93 Difference]: Finished difference Result 8205 states and 26514 transitions. [2019-12-27 20:02:52,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:02:52,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:02:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:52,894 INFO L225 Difference]: With dead ends: 8205 [2019-12-27 20:02:52,894 INFO L226 Difference]: Without dead ends: 7724 [2019-12-27 20:02:52,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:53,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7724 states. [2019-12-27 20:02:53,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7724 to 7724. [2019-12-27 20:02:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7724 states. [2019-12-27 20:02:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7724 states to 7724 states and 24917 transitions. [2019-12-27 20:02:53,376 INFO L78 Accepts]: Start accepts. Automaton has 7724 states and 24917 transitions. Word has length 3 [2019-12-27 20:02:53,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:53,376 INFO L462 AbstractCegarLoop]: Abstraction has 7724 states and 24917 transitions. [2019-12-27 20:02:53,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:02:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 7724 states and 24917 transitions. [2019-12-27 20:02:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:02:53,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:53,380 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:02:53,380 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:02:53,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:53,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-27 20:02:53,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:53,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098553579] [2019-12-27 20:02:53,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:53,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098553579] [2019-12-27 20:02:53,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:53,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:02:53,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2034144162] [2019-12-27 20:02:53,494 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:53,496 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:53,498 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:02:53,498 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:53,498 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:53,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:02:53,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:53,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:02:53,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:53,501 INFO L87 Difference]: Start difference. First operand 7724 states and 24917 transitions. Second operand 3 states. [2019-12-27 20:02:53,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:53,524 INFO L93 Difference]: Finished difference Result 1230 states and 2764 transitions. [2019-12-27 20:02:53,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:02:53,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 20:02:53,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:53,531 INFO L225 Difference]: With dead ends: 1230 [2019-12-27 20:02:53,531 INFO L226 Difference]: Without dead ends: 1230 [2019-12-27 20:02:53,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:53,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-12-27 20:02:53,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2019-12-27 20:02:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-27 20:02:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2764 transitions. [2019-12-27 20:02:53,561 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2764 transitions. Word has length 11 [2019-12-27 20:02:53,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:53,561 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2764 transitions. [2019-12-27 20:02:53,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:02:53,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2764 transitions. [2019-12-27 20:02:53,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:02:53,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:53,563 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:02:53,563 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:02:53,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:53,564 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-27 20:02:53,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:53,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851972075] [2019-12-27 20:02:53,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:53,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:53,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851972075] [2019-12-27 20:02:53,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:53,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:02:53,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [599452922] [2019-12-27 20:02:53,652 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:53,654 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:53,657 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:02:53,658 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:53,658 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:53,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:02:53,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:53,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:02:53,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:02:53,659 INFO L87 Difference]: Start difference. First operand 1230 states and 2764 transitions. Second operand 5 states. [2019-12-27 20:02:53,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:53,915 INFO L93 Difference]: Finished difference Result 1827 states and 4035 transitions. [2019-12-27 20:02:53,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:02:53,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:02:53,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:53,925 INFO L225 Difference]: With dead ends: 1827 [2019-12-27 20:02:53,926 INFO L226 Difference]: Without dead ends: 1827 [2019-12-27 20:02:53,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:02:53,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2019-12-27 20:02:53,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1570. [2019-12-27 20:02:53,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2019-12-27 20:02:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 3505 transitions. [2019-12-27 20:02:53,970 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 3505 transitions. Word has length 14 [2019-12-27 20:02:53,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:53,971 INFO L462 AbstractCegarLoop]: Abstraction has 1570 states and 3505 transitions. [2019-12-27 20:02:53,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:02:53,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 3505 transitions. [2019-12-27 20:02:53,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:02:53,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:53,974 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:02:53,974 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:02:53,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:53,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2113363587, now seen corresponding path program 1 times [2019-12-27 20:02:53,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:53,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620193953] [2019-12-27 20:02:53,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:54,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:54,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620193953] [2019-12-27 20:02:54,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:54,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:02:54,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [369476676] [2019-12-27 20:02:54,164 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:54,172 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:54,179 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:02:54,179 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:54,180 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:54,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:02:54,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:54,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:02:54,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:02:54,181 INFO L87 Difference]: Start difference. First operand 1570 states and 3505 transitions. Second operand 7 states. [2019-12-27 20:02:54,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:54,767 INFO L93 Difference]: Finished difference Result 2216 states and 4786 transitions. [2019-12-27 20:02:54,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 20:02:54,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-27 20:02:54,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:54,779 INFO L225 Difference]: With dead ends: 2216 [2019-12-27 20:02:54,779 INFO L226 Difference]: Without dead ends: 2216 [2019-12-27 20:02:54,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:02:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2019-12-27 20:02:54,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 1703. [2019-12-27 20:02:54,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-12-27 20:02:54,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 3769 transitions. [2019-12-27 20:02:54,828 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 3769 transitions. Word has length 25 [2019-12-27 20:02:54,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:54,828 INFO L462 AbstractCegarLoop]: Abstraction has 1703 states and 3769 transitions. [2019-12-27 20:02:54,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:02:54,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 3769 transitions. [2019-12-27 20:02:54,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:02:54,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:54,831 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-27 20:02:54,831 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:02:54,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:54,832 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-27 20:02:54,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:54,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297272926] [2019-12-27 20:02:54,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:54,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297272926] [2019-12-27 20:02:54,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:54,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:02:54,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1942218287] [2019-12-27 20:02:54,901 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:54,906 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:54,917 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 20:02:54,917 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:54,921 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:54,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:02:54,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:54,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:02:54,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:54,922 INFO L87 Difference]: Start difference. First operand 1703 states and 3769 transitions. Second operand 3 states. [2019-12-27 20:02:54,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:54,942 INFO L93 Difference]: Finished difference Result 1702 states and 3767 transitions. [2019-12-27 20:02:54,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:02:54,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 20:02:54,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:54,953 INFO L225 Difference]: With dead ends: 1702 [2019-12-27 20:02:54,953 INFO L226 Difference]: Without dead ends: 1702 [2019-12-27 20:02:54,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:54,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2019-12-27 20:02:54,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1702. [2019-12-27 20:02:54,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-27 20:02:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3767 transitions. [2019-12-27 20:02:55,003 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3767 transitions. Word has length 26 [2019-12-27 20:02:55,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:55,004 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3767 transitions. [2019-12-27 20:02:55,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:02:55,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3767 transitions. [2019-12-27 20:02:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:02:55,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:55,007 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-27 20:02:55,008 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:02:55,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:55,008 INFO L82 PathProgramCache]: Analyzing trace with hash -691470702, now seen corresponding path program 1 times [2019-12-27 20:02:55,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:55,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258436772] [2019-12-27 20:02:55,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:55,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258436772] [2019-12-27 20:02:55,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:55,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:02:55,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1024632477] [2019-12-27 20:02:55,103 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:55,108 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:55,115 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 33 transitions. [2019-12-27 20:02:55,115 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:55,119 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:02:55,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:02:55,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:55,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:02:55,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:02:55,120 INFO L87 Difference]: Start difference. First operand 1702 states and 3767 transitions. Second operand 4 states. [2019-12-27 20:02:55,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:55,150 INFO L93 Difference]: Finished difference Result 2698 states and 6019 transitions. [2019-12-27 20:02:55,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:02:55,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-27 20:02:55,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:55,160 INFO L225 Difference]: With dead ends: 2698 [2019-12-27 20:02:55,160 INFO L226 Difference]: Without dead ends: 1248 [2019-12-27 20:02:55,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:02:55,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2019-12-27 20:02:55,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1231. [2019-12-27 20:02:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2019-12-27 20:02:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 2688 transitions. [2019-12-27 20:02:55,190 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 2688 transitions. Word has length 27 [2019-12-27 20:02:55,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:55,190 INFO L462 AbstractCegarLoop]: Abstraction has 1231 states and 2688 transitions. [2019-12-27 20:02:55,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:02:55,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 2688 transitions. [2019-12-27 20:02:55,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:02:55,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:55,193 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-27 20:02:55,193 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:02:55,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:55,193 INFO L82 PathProgramCache]: Analyzing trace with hash -250638352, now seen corresponding path program 2 times [2019-12-27 20:02:55,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:55,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861843493] [2019-12-27 20:02:55,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:55,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:55,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861843493] [2019-12-27 20:02:55,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:55,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:02:55,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1522136956] [2019-12-27 20:02:55,293 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:55,299 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:55,311 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 20:02:55,311 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:55,455 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:02:55,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:02:55,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:55,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:02:55,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:02:55,456 INFO L87 Difference]: Start difference. First operand 1231 states and 2688 transitions. Second operand 8 states. [2019-12-27 20:02:56,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:56,420 INFO L93 Difference]: Finished difference Result 1897 states and 4072 transitions. [2019-12-27 20:02:56,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:02:56,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 20:02:56,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:56,431 INFO L225 Difference]: With dead ends: 1897 [2019-12-27 20:02:56,431 INFO L226 Difference]: Without dead ends: 1897 [2019-12-27 20:02:56,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:02:56,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2019-12-27 20:02:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1702. [2019-12-27 20:02:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-27 20:02:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3698 transitions. [2019-12-27 20:02:56,467 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3698 transitions. Word has length 27 [2019-12-27 20:02:56,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:56,468 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3698 transitions. [2019-12-27 20:02:56,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:02:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3698 transitions. [2019-12-27 20:02:56,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:02:56,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:56,470 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-27 20:02:56,471 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:02:56,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:56,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1889347286, now seen corresponding path program 1 times [2019-12-27 20:02:56,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:56,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363842209] [2019-12-27 20:02:56,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:56,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:56,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363842209] [2019-12-27 20:02:56,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:56,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:02:56,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1625688531] [2019-12-27 20:02:56,520 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:56,526 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:56,539 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 20:02:56,540 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:56,560 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:02:56,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:02:56,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:56,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:02:56,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:02:56,562 INFO L87 Difference]: Start difference. First operand 1702 states and 3698 transitions. Second operand 5 states. [2019-12-27 20:02:56,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:56,578 INFO L93 Difference]: Finished difference Result 921 states and 1892 transitions. [2019-12-27 20:02:56,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:02:56,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 20:02:56,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:56,585 INFO L225 Difference]: With dead ends: 921 [2019-12-27 20:02:56,586 INFO L226 Difference]: Without dead ends: 824 [2019-12-27 20:02:56,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:02:56,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-12-27 20:02:56,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 782. [2019-12-27 20:02:56,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-27 20:02:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1664 transitions. [2019-12-27 20:02:56,603 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1664 transitions. Word has length 28 [2019-12-27 20:02:56,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:56,604 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1664 transitions. [2019-12-27 20:02:56,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:02:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1664 transitions. [2019-12-27 20:02:56,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:02:56,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:56,606 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-27 20:02:56,607 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:02:56,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:56,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1472734739, now seen corresponding path program 1 times [2019-12-27 20:02:56,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:56,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655310737] [2019-12-27 20:02:56,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:56,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:56,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655310737] [2019-12-27 20:02:56,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:56,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:02:56,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [671366843] [2019-12-27 20:02:56,693 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:56,710 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:56,845 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 167 transitions. [2019-12-27 20:02:56,846 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:56,904 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:02:56,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:02:56,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:56,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:02:56,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:02:56,905 INFO L87 Difference]: Start difference. First operand 782 states and 1664 transitions. Second operand 9 states. [2019-12-27 20:02:57,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:57,183 INFO L93 Difference]: Finished difference Result 1342 states and 2781 transitions. [2019-12-27 20:02:57,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:02:57,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 20:02:57,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:57,187 INFO L225 Difference]: With dead ends: 1342 [2019-12-27 20:02:57,187 INFO L226 Difference]: Without dead ends: 903 [2019-12-27 20:02:57,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:02:57,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-27 20:02:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 773. [2019-12-27 20:02:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-27 20:02:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1630 transitions. [2019-12-27 20:02:57,204 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1630 transitions. Word has length 51 [2019-12-27 20:02:57,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:57,205 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1630 transitions. [2019-12-27 20:02:57,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:02:57,205 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1630 transitions. [2019-12-27 20:02:57,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:02:57,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:57,207 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-27 20:02:57,207 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:02:57,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:57,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1162443569, now seen corresponding path program 2 times [2019-12-27 20:02:57,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:57,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803921522] [2019-12-27 20:02:57,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:57,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803921522] [2019-12-27 20:02:57,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:57,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:02:57,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1682682315] [2019-12-27 20:02:57,320 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:57,340 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:57,414 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 166 transitions. [2019-12-27 20:02:57,414 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:57,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:02:57,571 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 20:02:57,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:02:57,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:57,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:02:57,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:02:57,573 INFO L87 Difference]: Start difference. First operand 773 states and 1630 transitions. Second operand 10 states. [2019-12-27 20:02:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:58,685 INFO L93 Difference]: Finished difference Result 1157 states and 2371 transitions. [2019-12-27 20:02:58,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 20:02:58,685 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-12-27 20:02:58,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:58,689 INFO L225 Difference]: With dead ends: 1157 [2019-12-27 20:02:58,689 INFO L226 Difference]: Without dead ends: 1157 [2019-12-27 20:02:58,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:02:58,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2019-12-27 20:02:58,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 845. [2019-12-27 20:02:58,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-12-27 20:02:58,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1761 transitions. [2019-12-27 20:02:58,709 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1761 transitions. Word has length 51 [2019-12-27 20:02:58,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:58,709 INFO L462 AbstractCegarLoop]: Abstraction has 845 states and 1761 transitions. [2019-12-27 20:02:58,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:02:58,709 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1761 transitions. [2019-12-27 20:02:58,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:02:58,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:58,711 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-27 20:02:58,712 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:02:58,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:58,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1548839163, now seen corresponding path program 3 times [2019-12-27 20:02:58,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:58,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461300610] [2019-12-27 20:02:58,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:58,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:58,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461300610] [2019-12-27 20:02:58,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:58,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:02:58,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1184326206] [2019-12-27 20:02:58,793 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:58,810 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:58,875 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 129 transitions. [2019-12-27 20:02:58,875 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:58,877 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:02:58,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:02:58,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:58,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:02:58,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:58,878 INFO L87 Difference]: Start difference. First operand 845 states and 1761 transitions. Second operand 3 states. [2019-12-27 20:02:58,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:58,932 INFO L93 Difference]: Finished difference Result 1118 states and 2337 transitions. [2019-12-27 20:02:58,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:02:58,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 20:02:58,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:58,936 INFO L225 Difference]: With dead ends: 1118 [2019-12-27 20:02:58,936 INFO L226 Difference]: Without dead ends: 1118 [2019-12-27 20:02:58,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-27 20:02:58,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2019-12-27 20:02:58,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 902. [2019-12-27 20:02:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2019-12-27 20:02:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1897 transitions. [2019-12-27 20:02:58,955 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1897 transitions. Word has length 51 [2019-12-27 20:02:58,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:58,956 INFO L462 AbstractCegarLoop]: Abstraction has 902 states and 1897 transitions. [2019-12-27 20:02:58,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:02:58,956 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1897 transitions. [2019-12-27 20:02:58,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:02:58,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:58,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:02:58,959 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:02:58,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:58,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2127061277, now seen corresponding path program 1 times [2019-12-27 20:02:58,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:58,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986503261] [2019-12-27 20:02:58,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:59,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986503261] [2019-12-27 20:02:59,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:59,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:02:59,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [706138693] [2019-12-27 20:02:59,031 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:59,050 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:59,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 113 states and 169 transitions. [2019-12-27 20:02:59,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:59,197 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:59,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:02:59,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:59,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:02:59,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:59,198 INFO L87 Difference]: Start difference. First operand 902 states and 1897 transitions. Second operand 3 states. [2019-12-27 20:02:59,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:59,213 INFO L93 Difference]: Finished difference Result 901 states and 1895 transitions. [2019-12-27 20:02:59,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:02:59,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 20:02:59,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:59,216 INFO L225 Difference]: With dead ends: 901 [2019-12-27 20:02:59,216 INFO L226 Difference]: Without dead ends: 901 [2019-12-27 20:02:59,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:59,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-12-27 20:02:59,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 807. [2019-12-27 20:02:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2019-12-27 20:02:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1717 transitions. [2019-12-27 20:02:59,232 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1717 transitions. Word has length 52 [2019-12-27 20:02:59,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:59,232 INFO L462 AbstractCegarLoop]: Abstraction has 807 states and 1717 transitions. [2019-12-27 20:02:59,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:02:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1717 transitions. [2019-12-27 20:02:59,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:02:59,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:59,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:02:59,235 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:02:59,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:59,235 INFO L82 PathProgramCache]: Analyzing trace with hash -445188541, now seen corresponding path program 1 times [2019-12-27 20:02:59,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:59,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182391002] [2019-12-27 20:02:59,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:02:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:02:59,358 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:02:59,358 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:02:59,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$mem_tmp~0_7) (= 0 v_~y$r_buff1_thd2~0_56) (= 0 v_~__unbuffered_cnt~0_17) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t307~0.base_22|) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~weak$$choice2~0_34) (= (select .cse0 |v_ULTIMATE.start_main_~#t307~0.base_22|) 0) (= v_~y~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~y$r_buff1_thd0~0_24) (= 0 v_~y$flush_delayed~0_13) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$r_buff0_thd0~0_21 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t307~0.base_22| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t307~0.base_22|) |v_ULTIMATE.start_main_~#t307~0.offset_17| 0)) |v_#memory_int_11|) (= v_~y$w_buff0_used~0_105 0) (= v_~y$r_buff0_thd2~0_81 0) (= 0 v_~y$w_buff0~0_25) (= 0 v_~__unbuffered_p0_EAX~0_16) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t307~0.base_22| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t307~0.base_22| 4)) (= v_~y$w_buff1_used~0_64 0) (= |v_ULTIMATE.start_main_~#t307~0.offset_17| 0) (= 0 v_~weak$$choice0~0_6))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ULTIMATE.start_main_~#t308~0.offset=|v_ULTIMATE.start_main_~#t308~0.offset_18|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ULTIMATE.start_main_~#t307~0.base=|v_ULTIMATE.start_main_~#t307~0.base_22|, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_17|, ~y~0=v_~y~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_~#t308~0.base=|v_ULTIMATE.start_main_~#t308~0.base_24|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_81, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_11, ULTIMATE.start_main_~#t307~0.offset=|v_ULTIMATE.start_main_~#t307~0.offset_17|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t308~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ULTIMATE.start_main_~#t307~0.base, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t308~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t307~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:02:59,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= |v_ULTIMATE.start_main_~#t308~0.offset_9| 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t308~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t308~0.base_10|) |v_ULTIMATE.start_main_~#t308~0.offset_9| 1))) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t308~0.base_10| 1)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t308~0.base_10| 4) |v_#length_9|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t308~0.base_10|) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t308~0.base_10|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t308~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t308~0.base=|v_ULTIMATE.start_main_~#t308~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#t308~0.offset=|v_ULTIMATE.start_main_~#t308~0.offset_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t308~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t308~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 20:02:59,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~y$r_buff1_thd0~0_Out1548127054 ~y$r_buff0_thd0~0_In1548127054) (= ~x~0_In1548127054 ~__unbuffered_p0_EAX~0_Out1548127054) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1548127054)) (= 1 ~y$r_buff0_thd1~0_Out1548127054) (= ~y$r_buff0_thd1~0_In1548127054 ~y$r_buff1_thd1~0_Out1548127054) (= ~y$r_buff0_thd2~0_In1548127054 ~y$r_buff1_thd2~0_Out1548127054)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1548127054, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1548127054, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1548127054, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1548127054, ~x~0=~x~0_In1548127054} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1548127054, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1548127054, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1548127054, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1548127054, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1548127054, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1548127054, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1548127054, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1548127054, ~x~0=~x~0_In1548127054} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 20:02:59,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-148623877 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-148623877 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-148623877|) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-148623877| ~y$w_buff0_used~0_In-148623877)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-148623877, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-148623877} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-148623877|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-148623877, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-148623877} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 20:02:59,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In1556049804 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1556049804 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1556049804 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1556049804 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1556049804|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1556049804 |P0Thread1of1ForFork0_#t~ite6_Out1556049804|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1556049804, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1556049804, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1556049804, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1556049804} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1556049804|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1556049804, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1556049804, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1556049804, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1556049804} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 20:02:59,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In149784839 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In149784839 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out149784839 ~y$r_buff0_thd1~0_In149784839) (or .cse0 .cse1)) (and (= ~y$r_buff0_thd1~0_Out149784839 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In149784839, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In149784839} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In149784839, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out149784839|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out149784839} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:02:59,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1362027859 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1362027859 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In1362027859 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1362027859 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1362027859| ~y$r_buff1_thd1~0_In1362027859) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out1362027859| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1362027859, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1362027859, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1362027859, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1362027859} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1362027859, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1362027859, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1362027859|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1362027859, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1362027859} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:02:59,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= 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{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:02:59,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1605495669 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In1605495669| |P1Thread1of1ForFork1_#t~ite17_Out1605495669|) (= |P1Thread1of1ForFork1_#t~ite18_Out1605495669| ~y$w_buff1~0_In1605495669) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1605495669 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1605495669 256))) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1605495669 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1605495669 256)))) .cse0 (= |P1Thread1of1ForFork1_#t~ite17_Out1605495669| ~y$w_buff1~0_In1605495669) (= |P1Thread1of1ForFork1_#t~ite17_Out1605495669| |P1Thread1of1ForFork1_#t~ite18_Out1605495669|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1605495669, ~y$w_buff1~0=~y$w_buff1~0_In1605495669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1605495669, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1605495669, ~weak$$choice2~0=~weak$$choice2~0_In1605495669, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1605495669|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1605495669} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1605495669, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1605495669|, ~y$w_buff1~0=~y$w_buff1~0_In1605495669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1605495669, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1605495669, ~weak$$choice2~0=~weak$$choice2~0_In1605495669, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1605495669|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1605495669} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 20:02:59,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-536000277 256)))) (or (and (= ~y$w_buff0_used~0_In-536000277 |P1Thread1of1ForFork1_#t~ite20_Out-536000277|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-536000277 256)))) (or (= (mod ~y$w_buff0_used~0_In-536000277 256) 0) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In-536000277 256) 0)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-536000277 256))))) .cse1 (= |P1Thread1of1ForFork1_#t~ite21_Out-536000277| |P1Thread1of1ForFork1_#t~ite20_Out-536000277|)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out-536000277| ~y$w_buff0_used~0_In-536000277) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In-536000277| |P1Thread1of1ForFork1_#t~ite20_Out-536000277|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-536000277, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-536000277, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-536000277|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-536000277, ~weak$$choice2~0=~weak$$choice2~0_In-536000277, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-536000277} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-536000277, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-536000277, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-536000277|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-536000277, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-536000277|, ~weak$$choice2~0=~weak$$choice2~0_In-536000277, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-536000277} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 20:02:59,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1497949920 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In-1497949920 256))) (.cse4 (= (mod ~y$w_buff0_used~0_In-1497949920 256) 0)) (.cse5 (= |P1Thread1of1ForFork1_#t~ite24_Out-1497949920| |P1Thread1of1ForFork1_#t~ite23_Out-1497949920|)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1497949920 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1497949920 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In-1497949920| |P1Thread1of1ForFork1_#t~ite22_Out-1497949920|) (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out-1497949920| ~y$w_buff1_used~0_In-1497949920) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_Out-1497949920| |P1Thread1of1ForFork1_#t~ite23_In-1497949920|)) (and (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4) (= |P1Thread1of1ForFork1_#t~ite23_Out-1497949920| ~y$w_buff1_used~0_In-1497949920) .cse0 .cse5))) (let ((.cse6 (not .cse2))) (and (or .cse6 (not .cse1)) .cse0 (not .cse4) .cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-1497949920| |P1Thread1of1ForFork1_#t~ite22_Out-1497949920|) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-1497949920|) (or (not .cse3) .cse6))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1497949920, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1497949920, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1497949920, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1497949920|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1497949920|, ~weak$$choice2~0=~weak$$choice2~0_In-1497949920, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1497949920} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1497949920, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1497949920, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1497949920, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1497949920|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1497949920|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1497949920|, ~weak$$choice2~0=~weak$$choice2~0_In-1497949920, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1497949920} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 20:02:59,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L769-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~y$r_buff0_thd2~0_49 v_~y$r_buff0_thd2~0_50)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 20:02:59,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1217025614 256)))) (or (and (= ~y$r_buff1_thd2~0_In-1217025614 |P1Thread1of1ForFork1_#t~ite30_Out-1217025614|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-1217025614| |P1Thread1of1ForFork1_#t~ite29_Out-1217025614|) (= |P1Thread1of1ForFork1_#t~ite28_In-1217025614| |P1Thread1of1ForFork1_#t~ite28_Out-1217025614|)) (let ((.cse1 (not (= 0 (mod ~y$r_buff0_thd2~0_In-1217025614 256))))) (and (not (= 0 (mod ~y$w_buff0_used~0_In-1217025614 256))) (= |P1Thread1of1ForFork1_#t~ite29_Out-1217025614| |P1Thread1of1ForFork1_#t~ite28_Out-1217025614|) .cse0 (= |P1Thread1of1ForFork1_#t~ite28_Out-1217025614| 0) (or .cse1 (not (= 0 (mod ~y$r_buff1_thd2~0_In-1217025614 256)))) (= |P1Thread1of1ForFork1_#t~ite29_Out-1217025614| |P1Thread1of1ForFork1_#t~ite30_Out-1217025614|) (or .cse1 (not (= 0 (mod ~y$w_buff1_used~0_In-1217025614 256)))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1217025614, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1217025614|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1217025614, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1217025614, ~weak$$choice2~0=~weak$$choice2~0_In-1217025614, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-1217025614|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1217025614} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1217025614, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1217025614|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1217025614|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1217025614, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1217025614, ~weak$$choice2~0=~weak$$choice2~0_In-1217025614, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1217025614|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1217025614} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 20:02:59,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_18 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 20:02:59,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1854467361 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1854467361 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out1854467361| |P1Thread1of1ForFork1_#t~ite33_Out1854467361|))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out1854467361| ~y$w_buff1~0_In1854467361) .cse0 (not .cse1) (not .cse2)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out1854467361| ~y~0_In1854467361) (or .cse2 .cse1) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1854467361, ~y$w_buff1~0=~y$w_buff1~0_In1854467361, ~y~0=~y~0_In1854467361, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1854467361} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1854467361, ~y$w_buff1~0=~y$w_buff1~0_In1854467361, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1854467361|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1854467361|, ~y~0=~y~0_In1854467361, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1854467361} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 20:02:59,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-2074354193 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2074354193 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-2074354193|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-2074354193 |P1Thread1of1ForFork1_#t~ite34_Out-2074354193|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2074354193, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2074354193} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2074354193, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2074354193, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2074354193|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 20:02:59,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-2096278970 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-2096278970 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-2096278970 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-2096278970 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-2096278970 |P1Thread1of1ForFork1_#t~ite35_Out-2096278970|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-2096278970|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2096278970, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2096278970, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2096278970, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2096278970} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2096278970, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2096278970, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2096278970, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-2096278970|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2096278970} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 20:02:59,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-99120966 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-99120966 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-99120966| 0)) (and (= ~y$r_buff0_thd2~0_In-99120966 |P1Thread1of1ForFork1_#t~ite36_Out-99120966|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-99120966, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-99120966} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-99120966, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-99120966, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-99120966|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 20:02:59,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In946197832 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In946197832 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In946197832 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In946197832 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In946197832 |P1Thread1of1ForFork1_#t~ite37_Out946197832|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out946197832|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In946197832, ~y$w_buff0_used~0=~y$w_buff0_used~0_In946197832, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In946197832, ~y$w_buff1_used~0=~y$w_buff1_used~0_In946197832} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In946197832, ~y$w_buff0_used~0=~y$w_buff0_used~0_In946197832, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In946197832, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out946197832|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In946197832} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:02:59,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_50, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:02:59,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 20:02:59,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1800182143 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1800182143 256) 0))) (or (and (= ~y~0_In1800182143 |ULTIMATE.start_main_#t~ite40_Out1800182143|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1800182143| ~y$w_buff1~0_In1800182143) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1800182143, ~y~0=~y~0_In1800182143, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1800182143, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1800182143} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1800182143|, ~y$w_buff1~0=~y$w_buff1~0_In1800182143, ~y~0=~y~0_In1800182143, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1800182143, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1800182143} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:02:59,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_17 |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|, ~y~0=v_~y~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 20:02:59,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1120537434 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1120537434 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1120537434 |ULTIMATE.start_main_#t~ite42_Out-1120537434|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1120537434|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1120537434, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1120537434} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1120537434, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1120537434, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1120537434|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:02:59,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1057767915 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1057767915 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1057767915 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1057767915 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1057767915 |ULTIMATE.start_main_#t~ite43_Out1057767915|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1057767915|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1057767915, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1057767915, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1057767915, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1057767915} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1057767915, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1057767915, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1057767915|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1057767915, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1057767915} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:02:59,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1365086145 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1365086145 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1365086145| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1365086145| ~y$r_buff0_thd0~0_In-1365086145)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1365086145, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1365086145} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1365086145, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1365086145, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1365086145|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:02:59,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In360623629 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In360623629 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In360623629 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In360623629 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out360623629| 0)) (and (= |ULTIMATE.start_main_#t~ite45_Out360623629| ~y$r_buff1_thd0~0_In360623629) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In360623629, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In360623629, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In360623629, ~y$w_buff1_used~0=~y$w_buff1_used~0_In360623629} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In360623629, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In360623629, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In360623629, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out360623629|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In360623629} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:02:59,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 0 v_~__unbuffered_p0_EAX~0_10) (= |v_ULTIMATE.start_main_#t~ite45_12| v_~y$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:02:59,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:02:59 BasicIcfg [2019-12-27 20:02:59,483 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:02:59,485 INFO L168 Benchmark]: Toolchain (without parser) took 13345.01 ms. Allocated memory was 138.4 MB in the beginning and 447.2 MB in the end (delta: 308.8 MB). Free memory was 102.1 MB in the beginning and 207.0 MB in the end (delta: -105.0 MB). Peak memory consumption was 203.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:02:59,486 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 20:02:59,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 784.20 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 101.6 MB in the beginning and 157.6 MB in the end (delta: -56.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:02:59,488 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.12 ms. Allocated memory is still 203.4 MB. Free memory was 157.6 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:02:59,489 INFO L168 Benchmark]: Boogie Preprocessor took 39.55 ms. Allocated memory is still 203.4 MB. Free memory was 155.0 MB in the beginning and 153.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:02:59,489 INFO L168 Benchmark]: RCFGBuilder took 801.79 ms. Allocated memory is still 203.4 MB. Free memory was 153.1 MB in the beginning and 108.6 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:02:59,490 INFO L168 Benchmark]: TraceAbstraction took 11648.81 ms. Allocated memory was 203.4 MB in the beginning and 447.2 MB in the end (delta: 243.8 MB). Free memory was 107.9 MB in the beginning and 207.0 MB in the end (delta: -99.1 MB). Peak memory consumption was 144.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:02:59,495 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 784.20 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 101.6 MB in the beginning and 157.6 MB in the end (delta: -56.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.12 ms. Allocated memory is still 203.4 MB. Free memory was 157.6 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.55 ms. Allocated memory is still 203.4 MB. Free memory was 155.0 MB in the beginning and 153.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 801.79 ms. Allocated memory is still 203.4 MB. Free memory was 153.1 MB in the beginning and 108.6 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11648.81 ms. Allocated memory was 203.4 MB in the beginning and 447.2 MB in the end (delta: 243.8 MB). Free memory was 107.9 MB in the beginning and 207.0 MB in the end (delta: -99.1 MB). Peak memory consumption was 144.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 148 ProgramPointsBefore, 74 ProgramPointsAfterwards, 182 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 29 ChoiceCompositions, 4737 VarBasedMoverChecksPositive, 159 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49139 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t307, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t308, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.3s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1442 SDtfs, 1407 SDslu, 3179 SDs, 0 SdLazy, 2223 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 39 SyntacticMatches, 15 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8357occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 1776 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 419 NumberOfCodeBlocks, 419 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 42172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...