/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix048_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:15:03,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:15:03,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:15:03,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:15:03,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:15:03,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:15:03,873 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:15:03,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:15:03,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:15:03,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:15:03,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:15:03,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:15:03,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:15:03,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:15:03,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:15:03,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:15:03,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:15:03,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:15:03,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:15:03,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:15:03,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:15:03,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:15:03,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:15:03,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:15:03,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:15:03,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:15:03,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:15:03,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:15:03,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:15:03,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:15:03,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:15:03,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:15:03,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:15:03,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:15:03,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:15:03,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:15:03,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:15:03,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:15:03,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:15:03,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:15:03,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:15:03,931 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-SemanticLbe-MCR.epf [2019-12-27 17:15:03,966 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:15:03,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:15:03,967 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:15:03,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:15:03,968 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:15:03,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:15:03,968 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:15:03,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:15:03,968 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:15:03,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:15:03,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:15:03,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:15:03,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:15:03,969 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:15:03,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:15:03,973 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:15:03,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:15:03,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:15:03,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:15:03,974 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:15:03,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:15:03,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:15:03,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:15:03,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:15:03,975 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:15:03,975 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:15:03,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:15:03,975 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:15:03,975 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:15:03,976 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:15:03,980 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:15:04,269 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:15:04,283 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:15:04,286 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:15:04,288 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:15:04,288 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:15:04,289 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix048_tso.opt.i [2019-12-27 17:15:04,352 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9602b38d0/21d3dbb5ae8943d8b996f8abfe4c81df/FLAG5f7769d9c [2019-12-27 17:15:04,897 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:15:04,901 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix048_tso.opt.i [2019-12-27 17:15:04,923 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9602b38d0/21d3dbb5ae8943d8b996f8abfe4c81df/FLAG5f7769d9c [2019-12-27 17:15:05,127 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9602b38d0/21d3dbb5ae8943d8b996f8abfe4c81df [2019-12-27 17:15:05,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:15:05,138 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:15:05,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:15:05,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:15:05,145 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:15:05,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:15:05" (1/1) ... [2019-12-27 17:15:05,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a953db3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:05, skipping insertion in model container [2019-12-27 17:15:05,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:15:05" (1/1) ... [2019-12-27 17:15:05,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:15:05,207 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:15:05,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:15:05,766 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:15:05,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:15:05,923 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:15:05,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:05 WrapperNode [2019-12-27 17:15:05,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:15:05,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:15:05,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:15:05,925 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:15:05,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:05" (1/1) ... [2019-12-27 17:15:05,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 05:15:05" (1/1) ... [2019-12-27 17:15:05,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:15:05,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:15:05,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:15:05,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:15:06,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:05" (1/1) ... [2019-12-27 17:15:06,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:05" (1/1) ... [2019-12-27 17:15:06,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:05" (1/1) ... [2019-12-27 17:15:06,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:05" (1/1) ... [2019-12-27 17:15:06,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:05" (1/1) ... [2019-12-27 17:15:06,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:05" (1/1) ... [2019-12-27 17:15:06,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:05" (1/1) ... [2019-12-27 17:15:06,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:15:06,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:15:06,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:15:06,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:15:06,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:15:06,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:15:06,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:15:06,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:15:06,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:15:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:15:06,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:15:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:15:06,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:15:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:15:06,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:15:06,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:15:06,106 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 17:15:06,807 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:15:06,808 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:15:06,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:15:06 BoogieIcfgContainer [2019-12-27 17:15:06,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:15:06,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:15:06,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:15:06,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:15:06,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:15:05" (1/3) ... [2019-12-27 17:15:06,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40edd62c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:15:06, skipping insertion in model container [2019-12-27 17:15:06,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:05" (2/3) ... [2019-12-27 17:15:06,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40edd62c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:15:06, skipping insertion in model container [2019-12-27 17:15:06,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:15:06" (3/3) ... [2019-12-27 17:15:06,822 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_tso.opt.i [2019-12-27 17:15:06,833 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:15:06,833 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:15:06,846 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:15:06,847 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:15:06,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,903 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,903 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,904 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,904 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,905 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,917 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,918 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,970 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,971 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,971 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,980 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:06,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:07,023 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:15:07,044 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:15:07,044 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:15:07,045 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:15:07,045 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:15:07,045 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:15:07,045 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:15:07,045 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:15:07,045 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:15:07,067 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 17:15:07,069 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 17:15:07,177 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 17:15:07,177 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:15:07,192 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:15:07,211 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 17:15:07,276 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 17:15:07,276 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:15:07,282 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:15:07,296 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 17:15:07,297 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:15:12,416 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 17:15:12,542 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 17:15:12,621 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-27 17:15:12,621 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-27 17:15:12,624 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-27 17:15:13,092 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-27 17:15:13,094 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-27 17:15:13,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:15:13,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:13,102 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:15:13,102 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:13,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:13,110 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-27 17:15:13,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:13,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356962912] [2019-12-27 17:15:13,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:13,384 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 17:15:13,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356962912] [2019-12-27 17:15:13,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:13,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:15:13,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1879919142] [2019-12-27 17:15:13,390 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:13,394 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:13,404 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:15:13,405 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:13,408 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:15:13,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:15:13,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:13,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:15:13,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:15:13,425 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-27 17:15:13,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:13,660 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-27 17:15:13,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:15:13,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:15:13,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:13,749 INFO L225 Difference]: With dead ends: 8074 [2019-12-27 17:15:13,749 INFO L226 Difference]: Without dead ends: 7606 [2019-12-27 17:15:13,751 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 17:15:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-27 17:15:14,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-27 17:15:14,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-27 17:15:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-27 17:15:14,128 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-27 17:15:14,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:14,128 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-27 17:15:14,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:15:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-27 17:15:14,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:15:14,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:14,132 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:15:14,133 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:14,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:14,133 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-27 17:15:14,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:14,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400549910] [2019-12-27 17:15:14,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:14,219 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 17:15:14,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400549910] [2019-12-27 17:15:14,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:14,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:15:14,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1016100181] [2019-12-27 17:15:14,221 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:14,222 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:14,224 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:15:14,224 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:14,225 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:15:14,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:15:14,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:14,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:15:14,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:15:14,227 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-27 17:15:14,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:14,719 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-27 17:15:14,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:15:14,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:15:14,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:14,807 INFO L225 Difference]: With dead ends: 11630 [2019-12-27 17:15:14,807 INFO L226 Difference]: Without dead ends: 11623 [2019-12-27 17:15:14,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:15:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-27 17:15:15,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-27 17:15:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-27 17:15:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-27 17:15:15,198 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-27 17:15:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:15,198 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-27 17:15:15,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:15:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-27 17:15:15,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:15:15,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:15,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:15:15,204 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:15,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:15,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-27 17:15:15,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:15,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446579099] [2019-12-27 17:15:15,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:15:15,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446579099] [2019-12-27 17:15:15,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:15,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:15:15,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1844007287] [2019-12-27 17:15:15,303 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:15,306 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:15,310 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 17:15:15,311 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:15,311 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:15:15,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:15:15,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:15,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:15:15,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:15:15,312 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-27 17:15:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:15,780 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-27 17:15:15,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:15:15,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 17:15:15,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:15,828 INFO L225 Difference]: With dead ends: 14471 [2019-12-27 17:15:15,828 INFO L226 Difference]: Without dead ends: 14471 [2019-12-27 17:15:15,828 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 17:15:15,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-27 17:15:16,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-27 17:15:16,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-27 17:15:16,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-27 17:15:16,252 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-27 17:15:16,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:16,253 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-27 17:15:16,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:15:16,253 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-27 17:15:16,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:15:16,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:16,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:15:16,257 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:16,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:16,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-27 17:15:16,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:16,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746891335] [2019-12-27 17:15:16,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:16,322 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 17:15:16,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746891335] [2019-12-27 17:15:16,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:16,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:15:16,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [757715043] [2019-12-27 17:15:16,324 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:16,325 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:16,327 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 17:15:16,328 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:16,329 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:15:16,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:15:16,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:16,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:15:16,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:15:16,330 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-12-27 17:15:16,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:16,380 INFO L93 Difference]: Finished difference Result 10750 states and 33336 transitions. [2019-12-27 17:15:16,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:15:16,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 17:15:16,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:16,405 INFO L225 Difference]: With dead ends: 10750 [2019-12-27 17:15:16,406 INFO L226 Difference]: Without dead ends: 10750 [2019-12-27 17:15:16,406 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 17:15:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10750 states. [2019-12-27 17:15:17,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10750 to 10670. [2019-12-27 17:15:17,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10670 states. [2019-12-27 17:15:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10670 states to 10670 states and 33104 transitions. [2019-12-27 17:15:17,315 INFO L78 Accepts]: Start accepts. Automaton has 10670 states and 33104 transitions. Word has length 16 [2019-12-27 17:15:17,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:17,315 INFO L462 AbstractCegarLoop]: Abstraction has 10670 states and 33104 transitions. [2019-12-27 17:15:17,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:15:17,316 INFO L276 IsEmpty]: Start isEmpty. Operand 10670 states and 33104 transitions. [2019-12-27 17:15:17,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:15:17,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:17,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:15:17,319 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:17,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:17,320 INFO L82 PathProgramCache]: Analyzing trace with hash 2099964683, now seen corresponding path program 1 times [2019-12-27 17:15:17,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:17,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515097645] [2019-12-27 17:15:17,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:17,407 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 17:15:17,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515097645] [2019-12-27 17:15:17,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:17,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:15:17,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1103595991] [2019-12-27 17:15:17,408 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:17,409 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:17,411 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:15:17,411 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:17,411 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:15:17,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:15:17,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:17,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:15:17,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:15:17,412 INFO L87 Difference]: Start difference. First operand 10670 states and 33104 transitions. Second operand 4 states. [2019-12-27 17:15:17,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:17,446 INFO L93 Difference]: Finished difference Result 2054 states and 5113 transitions. [2019-12-27 17:15:17,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:15:17,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 17:15:17,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:17,451 INFO L225 Difference]: With dead ends: 2054 [2019-12-27 17:15:17,451 INFO L226 Difference]: Without dead ends: 1457 [2019-12-27 17:15:17,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:15:17,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-12-27 17:15:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1457. [2019-12-27 17:15:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2019-12-27 17:15:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 3211 transitions. [2019-12-27 17:15:17,477 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 3211 transitions. Word has length 16 [2019-12-27 17:15:17,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:17,477 INFO L462 AbstractCegarLoop]: Abstraction has 1457 states and 3211 transitions. [2019-12-27 17:15:17,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:15:17,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 3211 transitions. [2019-12-27 17:15:17,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 17:15:17,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:17,479 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] [2019-12-27 17:15:17,480 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:17,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:17,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-27 17:15:17,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:17,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686597010] [2019-12-27 17:15:17,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:17,586 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 17:15:17,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686597010] [2019-12-27 17:15:17,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:17,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:15:17,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1202255253] [2019-12-27 17:15:17,588 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:17,593 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:17,599 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 24 transitions. [2019-12-27 17:15:17,599 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:17,600 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:15:17,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:15:17,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:17,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:15:17,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:15:17,601 INFO L87 Difference]: Start difference. First operand 1457 states and 3211 transitions. Second operand 6 states. [2019-12-27 17:15:17,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:17,988 INFO L93 Difference]: Finished difference Result 2249 states and 4761 transitions. [2019-12-27 17:15:17,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:15:17,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 17:15:17,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:17,993 INFO L225 Difference]: With dead ends: 2249 [2019-12-27 17:15:17,994 INFO L226 Difference]: Without dead ends: 2197 [2019-12-27 17:15:17,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:15:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2019-12-27 17:15:18,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 1428. [2019-12-27 17:15:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-27 17:15:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 3147 transitions. [2019-12-27 17:15:18,028 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 3147 transitions. Word has length 24 [2019-12-27 17:15:18,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:18,028 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 3147 transitions. [2019-12-27 17:15:18,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:15:18,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 3147 transitions. [2019-12-27 17:15:18,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:15:18,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:18,031 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 17:15:18,031 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:18,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:18,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-12-27 17:15:18,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:18,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172552996] [2019-12-27 17:15:18,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:18,157 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 17:15:18,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172552996] [2019-12-27 17:15:18,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:18,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:15:18,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1136743421] [2019-12-27 17:15:18,158 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:18,163 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:18,172 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 71 transitions. [2019-12-27 17:15:18,172 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:18,213 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:15:18,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:15:18,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:18,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:15:18,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:15:18,214 INFO L87 Difference]: Start difference. First operand 1428 states and 3147 transitions. Second operand 6 states. [2019-12-27 17:15:18,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:18,336 INFO L93 Difference]: Finished difference Result 752 states and 1639 transitions. [2019-12-27 17:15:18,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:15:18,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 17:15:18,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:18,338 INFO L225 Difference]: With dead ends: 752 [2019-12-27 17:15:18,338 INFO L226 Difference]: Without dead ends: 689 [2019-12-27 17:15:18,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:15:18,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-12-27 17:15:18,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-12-27 17:15:18,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-12-27 17:15:18,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1501 transitions. [2019-12-27 17:15:18,351 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1501 transitions. Word has length 27 [2019-12-27 17:15:18,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:18,351 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1501 transitions. [2019-12-27 17:15:18,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:15:18,352 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1501 transitions. [2019-12-27 17:15:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:15:18,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:18,354 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 17:15:18,355 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:18,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:18,355 INFO L82 PathProgramCache]: Analyzing trace with hash 178128967, now seen corresponding path program 1 times [2019-12-27 17:15:18,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:18,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74007537] [2019-12-27 17:15:18,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:18,441 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 17:15:18,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74007537] [2019-12-27 17:15:18,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:18,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:15:18,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [382583224] [2019-12-27 17:15:18,442 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:18,456 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:18,496 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 64 transitions. [2019-12-27 17:15:18,497 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:18,499 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:15:18,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:15:18,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:18,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:15:18,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:15:18,500 INFO L87 Difference]: Start difference. First operand 689 states and 1501 transitions. Second operand 4 states. [2019-12-27 17:15:18,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:18,522 INFO L93 Difference]: Finished difference Result 1118 states and 2458 transitions. [2019-12-27 17:15:18,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:15:18,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-27 17:15:18,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:18,524 INFO L225 Difference]: With dead ends: 1118 [2019-12-27 17:15:18,524 INFO L226 Difference]: Without dead ends: 471 [2019-12-27 17:15:18,524 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 17:15:18,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-27 17:15:18,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2019-12-27 17:15:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-12-27 17:15:18,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1036 transitions. [2019-12-27 17:15:18,532 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1036 transitions. Word has length 51 [2019-12-27 17:15:18,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:18,533 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 1036 transitions. [2019-12-27 17:15:18,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:15:18,533 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1036 transitions. [2019-12-27 17:15:18,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:15:18,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:18,535 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 17:15:18,535 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:18,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:18,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1382412251, now seen corresponding path program 2 times [2019-12-27 17:15:18,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:18,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249849586] [2019-12-27 17:15:18,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:18,635 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 17:15:18,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249849586] [2019-12-27 17:15:18,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:18,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:15:18,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [50404330] [2019-12-27 17:15:18,636 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:18,650 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:18,695 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 96 transitions. [2019-12-27 17:15:18,695 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:18,751 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:15:18,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:15:18,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:18,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:15:18,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:15:18,753 INFO L87 Difference]: Start difference. First operand 471 states and 1036 transitions. Second operand 9 states. [2019-12-27 17:15:19,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:19,040 INFO L93 Difference]: Finished difference Result 982 states and 2086 transitions. [2019-12-27 17:15:19,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:15:19,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 17:15:19,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:19,041 INFO L225 Difference]: With dead ends: 982 [2019-12-27 17:15:19,042 INFO L226 Difference]: Without dead ends: 683 [2019-12-27 17:15:19,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:15:19,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-12-27 17:15:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 529. [2019-12-27 17:15:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-27 17:15:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1137 transitions. [2019-12-27 17:15:19,052 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1137 transitions. Word has length 51 [2019-12-27 17:15:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:19,052 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1137 transitions. [2019-12-27 17:15:19,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:15:19,053 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1137 transitions. [2019-12-27 17:15:19,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:15:19,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:19,055 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 17:15:19,056 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:19,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:19,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1158154681, now seen corresponding path program 3 times [2019-12-27 17:15:19,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:19,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000960173] [2019-12-27 17:15:19,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:19,230 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 17:15:19,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000960173] [2019-12-27 17:15:19,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:19,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:15:19,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [580984262] [2019-12-27 17:15:19,231 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:19,247 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:19,313 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 98 transitions. [2019-12-27 17:15:19,314 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:19,439 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-12-27 17:15:19,439 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:15:19,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:15:19,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:19,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:15:19,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:15:19,441 INFO L87 Difference]: Start difference. First operand 529 states and 1137 transitions. Second operand 6 states. [2019-12-27 17:15:19,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:19,864 INFO L93 Difference]: Finished difference Result 885 states and 1849 transitions. [2019-12-27 17:15:19,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:15:19,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-27 17:15:19,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:19,866 INFO L225 Difference]: With dead ends: 885 [2019-12-27 17:15:19,866 INFO L226 Difference]: Without dead ends: 861 [2019-12-27 17:15:19,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:15:19,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-12-27 17:15:19,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 712. [2019-12-27 17:15:19,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-12-27 17:15:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1532 transitions. [2019-12-27 17:15:19,877 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1532 transitions. Word has length 51 [2019-12-27 17:15:19,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:19,877 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 1532 transitions. [2019-12-27 17:15:19,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:15:19,878 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1532 transitions. [2019-12-27 17:15:19,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:15:19,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:19,880 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 17:15:19,880 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:19,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:19,880 INFO L82 PathProgramCache]: Analyzing trace with hash -320603405, now seen corresponding path program 4 times [2019-12-27 17:15:19,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:19,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303488312] [2019-12-27 17:15:19,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:19,942 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 17:15:19,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303488312] [2019-12-27 17:15:19,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:19,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:15:19,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1308634235] [2019-12-27 17:15:19,943 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:19,957 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:20,002 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 101 transitions. [2019-12-27 17:15:20,002 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:20,003 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:15:20,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:15:20,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:20,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:15:20,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:15:20,004 INFO L87 Difference]: Start difference. First operand 712 states and 1532 transitions. Second operand 3 states. [2019-12-27 17:15:20,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:20,056 INFO L93 Difference]: Finished difference Result 923 states and 1980 transitions. [2019-12-27 17:15:20,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:15:20,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 17:15:20,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:20,058 INFO L225 Difference]: With dead ends: 923 [2019-12-27 17:15:20,058 INFO L226 Difference]: Without dead ends: 923 [2019-12-27 17:15:20,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:15:20,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-12-27 17:15:20,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 754. [2019-12-27 17:15:20,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-27 17:15:20,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-27 17:15:20,072 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-27 17:15:20,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:20,072 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-27 17:15:20,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:15:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-27 17:15:20,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:15:20,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:20,075 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 17:15:20,076 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:20,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:20,076 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-27 17:15:20,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:20,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535757480] [2019-12-27 17:15:20,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:15:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:15:20,184 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:15:20,184 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:15:20,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= 0 |v_ULTIMATE.start_main_~#t1295~0.offset_27|) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1295~0.base_40|) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (= (select .cse0 |v_ULTIMATE.start_main_~#t1295~0.base_40|) 0) (= v_~y$read_delayed~0_6 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1295~0.base_40| 4)) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1295~0.base_40| 1)) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= v_~y$r_buff1_thd1~0_115 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1295~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1295~0.base_40|) |v_ULTIMATE.start_main_~#t1295~0.offset_27| 0)) |v_#memory_int_17|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ULTIMATE.start_main_~#t1296~0.offset=|v_ULTIMATE.start_main_~#t1296~0.offset_27|, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1295~0.base=|v_ULTIMATE.start_main_~#t1295~0.base_40|, ULTIMATE.start_main_~#t1295~0.offset=|v_ULTIMATE.start_main_~#t1295~0.offset_27|, ULTIMATE.start_main_~#t1296~0.base=|v_ULTIMATE.start_main_~#t1296~0.base_41|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #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_~#t1296~0.offset, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1295~0.base, ULTIMATE.start_main_~#t1295~0.offset, ULTIMATE.start_main_~#t1296~0.base, ~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_#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, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:15:20,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1296~0.base_13| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1296~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1296~0.base_13|) |v_ULTIMATE.start_main_~#t1296~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1296~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1296~0.offset_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1296~0.base_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1296~0.base_13|)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1296~0.base_13| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1296~0.base=|v_ULTIMATE.start_main_~#t1296~0.base_13|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1296~0.offset=|v_ULTIMATE.start_main_~#t1296~0.offset_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1296~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1296~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 17:15:20,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff0_thd1~0_In-2017101125 ~y$r_buff1_thd1~0_Out-2017101125) (= ~y$r_buff1_thd0~0_Out-2017101125 ~y$r_buff0_thd0~0_In-2017101125) (= ~x~0_In-2017101125 ~__unbuffered_p0_EAX~0_Out-2017101125) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-2017101125)) (= ~y$r_buff1_thd2~0_Out-2017101125 ~y$r_buff0_thd2~0_In-2017101125) (= 1 ~y$r_buff0_thd1~0_Out-2017101125)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2017101125, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2017101125, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2017101125, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-2017101125, ~x~0=~x~0_In-2017101125} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-2017101125, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-2017101125, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-2017101125, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2017101125, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2017101125, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2017101125, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-2017101125, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-2017101125, ~x~0=~x~0_In-2017101125} 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 17:15:20,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1710377424 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1710377424 256) 0))) (or (and (= ~y$w_buff0_used~0_In1710377424 |P0Thread1of1ForFork0_#t~ite5_Out1710377424|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1710377424|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1710377424, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1710377424} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1710377424|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1710377424, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1710377424} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:15:20,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1801789108 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-1801789108| |P1Thread1of1ForFork1_#t~ite20_Out-1801789108|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1801789108 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1801789108 256)) (and (= (mod ~y$r_buff1_thd2~0_In-1801789108 256) 0) .cse0) (and .cse0 (= (mod ~y$w_buff1_used~0_In-1801789108 256) 0)))) .cse1 (= |P1Thread1of1ForFork1_#t~ite20_Out-1801789108| ~y$w_buff0_used~0_In-1801789108)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In-1801789108| |P1Thread1of1ForFork1_#t~ite20_Out-1801789108|) (= |P1Thread1of1ForFork1_#t~ite21_Out-1801789108| ~y$w_buff0_used~0_In-1801789108)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1801789108, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1801789108, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1801789108|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1801789108, ~weak$$choice2~0=~weak$$choice2~0_In-1801789108, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1801789108} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1801789108, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1801789108, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1801789108|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1801789108, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1801789108|, ~weak$$choice2~0=~weak$$choice2~0_In-1801789108, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1801789108} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 17:15:20,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out-1845706918| |P1Thread1of1ForFork1_#t~ite23_Out-1845706918|)) (.cse1 (= 0 (mod ~weak$$choice2~0_In-1845706918 256))) (.cse5 (= (mod ~y$r_buff1_thd2~0_In-1845706918 256) 0)) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In-1845706918 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1845706918 256))) (.cse4 (= 0 (mod ~y$w_buff0_used~0_In-1845706918 256)))) (or (let ((.cse2 (not .cse6))) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out-1845706918| |P1Thread1of1ForFork1_#t~ite22_Out-1845706918|) .cse1 (= |P1Thread1of1ForFork1_#t~ite22_Out-1845706918| 0) (or .cse2 (not .cse3)) (not .cse4) (or .cse2 (not .cse5)))) (and (= |P1Thread1of1ForFork1_#t~ite22_In-1845706918| |P1Thread1of1ForFork1_#t~ite22_Out-1845706918|) (or (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite23_Out-1845706918| |P1Thread1of1ForFork1_#t~ite23_In-1845706918|) (= |P1Thread1of1ForFork1_#t~ite24_Out-1845706918| ~y$w_buff1_used~0_In-1845706918)) (and .cse0 .cse1 (or (and .cse6 .cse5) (and .cse6 .cse3) .cse4) (= |P1Thread1of1ForFork1_#t~ite23_Out-1845706918| ~y$w_buff1_used~0_In-1845706918)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1845706918, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1845706918, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1845706918, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1845706918|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1845706918|, ~weak$$choice2~0=~weak$$choice2~0_In-1845706918, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1845706918} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1845706918, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1845706918, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1845706918, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1845706918|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1845706918|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1845706918|, ~weak$$choice2~0=~weak$$choice2~0_In-1845706918, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1845706918} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 17:15:20,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1661722769 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1661722769 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1661722769 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-1661722769 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1661722769| ~y$w_buff1_used~0_In-1661722769)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1661722769| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1661722769, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1661722769, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1661722769, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1661722769} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1661722769|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1661722769, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1661722769, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1661722769, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1661722769} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:15:20,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1713075500 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1713075500 256) 0))) (or (and (= ~y$r_buff0_thd1~0_In1713075500 ~y$r_buff0_thd1~0_Out1713075500) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out1713075500) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1713075500, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1713075500} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1713075500, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1713075500|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1713075500} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:15:20,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd1~0_In-1797513130 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1797513130 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1797513130 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1797513130 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1797513130| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1797513130| ~y$r_buff1_thd1~0_In-1797513130) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1797513130, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1797513130, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1797513130, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1797513130} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1797513130, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1797513130, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1797513130|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1797513130, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1797513130} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:15:20,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:15:20,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In896364601 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In896364601| |P1Thread1of1ForFork1_#t~ite29_Out896364601|) (= |P1Thread1of1ForFork1_#t~ite30_Out896364601| ~y$r_buff1_thd2~0_In896364601)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In896364601 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In896364601 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In896364601 256)) .cse1) (= (mod ~y$w_buff0_used~0_In896364601 256) 0))) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out896364601| |P1Thread1of1ForFork1_#t~ite30_Out896364601|) (= |P1Thread1of1ForFork1_#t~ite29_Out896364601| ~y$r_buff1_thd2~0_In896364601)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In896364601, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In896364601|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In896364601, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In896364601, ~weak$$choice2~0=~weak$$choice2~0_In896364601, ~y$w_buff1_used~0=~y$w_buff1_used~0_In896364601} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In896364601, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out896364601|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out896364601|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In896364601, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In896364601, ~weak$$choice2~0=~weak$$choice2~0_In896364601, ~y$w_buff1_used~0=~y$w_buff1_used~0_In896364601} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 17:15:20,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 17:15:20,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1260133924 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1260133924 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-1260133924 |P1Thread1of1ForFork1_#t~ite32_Out-1260133924|)) (and (or .cse0 .cse1) (= ~y~0_In-1260133924 |P1Thread1of1ForFork1_#t~ite32_Out-1260133924|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1260133924, ~y$w_buff1~0=~y$w_buff1~0_In-1260133924, ~y~0=~y~0_In-1260133924, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1260133924} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1260133924, ~y$w_buff1~0=~y$w_buff1~0_In-1260133924, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1260133924|, ~y~0=~y~0_In-1260133924, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1260133924} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 17:15:20,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 17:15:20,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In622795648 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In622795648 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out622795648| ~y$w_buff0_used~0_In622795648)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out622795648|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In622795648, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In622795648} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In622795648, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In622795648, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out622795648|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 17:15:20,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1595191104 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1595191104 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1595191104 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1595191104 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out1595191104| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1595191104 |P1Thread1of1ForFork1_#t~ite35_Out1595191104|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1595191104, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1595191104, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1595191104, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1595191104} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1595191104, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1595191104, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1595191104, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1595191104|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1595191104} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 17:15:20,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-431842084 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-431842084 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-431842084| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-431842084| ~y$r_buff0_thd2~0_In-431842084)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-431842084, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-431842084} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-431842084, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-431842084, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-431842084|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 17:15:20,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1107118427 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1107118427 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1107118427 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1107118427 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1107118427|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In-1107118427 |P1Thread1of1ForFork1_#t~ite37_Out-1107118427|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1107118427, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1107118427, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1107118427, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1107118427} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1107118427, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1107118427, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1107118427, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1107118427|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1107118427} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 17:15:20,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} 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 17:15:20,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} 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 17:15:20,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:15:20,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-477802941 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-477802941 256)))) (or (and (= ~y~0_In-477802941 |ULTIMATE.start_main_#t~ite40_Out-477802941|) (or .cse0 .cse1)) (and (= ~y$w_buff1~0_In-477802941 |ULTIMATE.start_main_#t~ite40_Out-477802941|) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-477802941, ~y~0=~y~0_In-477802941, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-477802941, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-477802941} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-477802941|, ~y$w_buff1~0=~y$w_buff1~0_In-477802941, ~y~0=~y~0_In-477802941, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-477802941, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-477802941} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 17:15:20,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 17:15:20,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1122845835 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1122845835 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1122845835|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1122845835 |ULTIMATE.start_main_#t~ite42_Out-1122845835|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1122845835, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1122845835} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1122845835, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1122845835, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1122845835|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:15:20,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-469596817 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-469596817 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-469596817 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-469596817 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-469596817| ~y$w_buff1_used~0_In-469596817)) (and (= |ULTIMATE.start_main_#t~ite43_Out-469596817| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-469596817, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-469596817, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-469596817, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-469596817} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-469596817, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-469596817, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-469596817|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-469596817, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-469596817} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 17:15:20,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In975574325 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In975574325 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out975574325| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out975574325| ~y$r_buff0_thd0~0_In975574325) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In975574325, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In975574325} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In975574325, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In975574325, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out975574325|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 17:15:20,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1128314580 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1128314580 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1128314580 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1128314580 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In1128314580 |ULTIMATE.start_main_#t~ite45_Out1128314580|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out1128314580|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1128314580, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1128314580, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1128314580, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1128314580} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1128314580, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1128314580, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1128314580, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1128314580|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1128314580} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 17:15:20,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} 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 17:15:20,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:15:20 BasicIcfg [2019-12-27 17:15:20,265 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:15:20,267 INFO L168 Benchmark]: Toolchain (without parser) took 15129.10 ms. Allocated memory was 136.8 MB in the beginning and 610.3 MB in the end (delta: 473.4 MB). Free memory was 100.1 MB in the beginning and 253.5 MB in the end (delta: -153.4 MB). Peak memory consumption was 320.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:15:20,268 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 17:15:20,269 INFO L168 Benchmark]: CACSL2BoogieTranslator took 785.21 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 99.7 MB in the beginning and 155.9 MB in the end (delta: -56.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:15:20,269 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.77 ms. Allocated memory is still 201.9 MB. Free memory was 155.9 MB in the beginning and 153.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:15:20,270 INFO L168 Benchmark]: Boogie Preprocessor took 38.23 ms. Allocated memory is still 201.9 MB. Free memory was 153.9 MB in the beginning and 151.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:15:20,271 INFO L168 Benchmark]: RCFGBuilder took 781.46 ms. Allocated memory is still 201.9 MB. Free memory was 151.1 MB in the beginning and 107.1 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:15:20,272 INFO L168 Benchmark]: TraceAbstraction took 13453.80 ms. Allocated memory was 201.9 MB in the beginning and 610.3 MB in the end (delta: 408.4 MB). Free memory was 106.4 MB in the beginning and 253.5 MB in the end (delta: -147.1 MB). Peak memory consumption was 261.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:15:20,276 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.17 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 785.21 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 99.7 MB in the beginning and 155.9 MB in the end (delta: -56.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.77 ms. Allocated memory is still 201.9 MB. Free memory was 155.9 MB in the beginning and 153.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.23 ms. Allocated memory is still 201.9 MB. Free memory was 153.9 MB in the beginning and 151.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 781.46 ms. Allocated memory is still 201.9 MB. Free memory was 151.1 MB in the beginning and 107.1 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13453.80 ms. Allocated memory was 201.9 MB in the beginning and 610.3 MB in the end (delta: 408.4 MB). Free memory was 106.4 MB in the beginning and 253.5 MB in the end (delta: -147.1 MB). Peak memory consumption was 261.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1295, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1296, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L738] 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, 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] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L759] 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=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] [L738] 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) [L759] 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) [L760] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 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)) [L761] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_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))=0, 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] [L761] 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)) [L762] 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)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 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 [L765] 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)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 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 [L805] 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, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.1s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1295 SDtfs, 1498 SDslu, 2451 SDs, 0 SdLazy, 1214 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 5640 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 304 ConstructedInterpolants, 0 QuantifiedInterpolants, 32918 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...