/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:48:17,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:48:17,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:48:17,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:48:17,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:48:17,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:48:17,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:48:17,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:48:17,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:48:17,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:48:17,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:48:17,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:48:17,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:48:17,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:48:17,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:48:17,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:48:17,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:48:17,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:48:17,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:48:17,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:48:17,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:48:17,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:48:17,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:48:17,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:48:17,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:48:17,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:48:17,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:48:17,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:48:17,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:48:17,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:48:17,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:48:17,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:48:17,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:48:17,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:48:17,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:48:17,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:48:17,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:48:17,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:48:17,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:48:17,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:48:17,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:48:17,883 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:48:17,916 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:48:17,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:48:17,917 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:48:17,917 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:48:17,921 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:48:17,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:48:17,921 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:48:17,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:48:17,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:48:17,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:48:17,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:48:17,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:48:17,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:48:17,923 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:48:17,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:48:17,923 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:48:17,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:48:17,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:48:17,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:48:17,926 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:48:17,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:48:17,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:48:17,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:48:17,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:48:17,927 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:48:17,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:48:17,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:48:17,928 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:48:17,928 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:48:17,928 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:48:18,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:48:18,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:48:18,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:48:18,212 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:48:18,213 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:48:18,213 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_pso.opt.i [2019-12-27 06:48:18,288 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1f511a4/7647a6b7b6bc421fb98d7abacd4349f3/FLAGee7e20a26 [2019-12-27 06:48:18,938 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:48:18,939 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_pso.opt.i [2019-12-27 06:48:18,953 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1f511a4/7647a6b7b6bc421fb98d7abacd4349f3/FLAGee7e20a26 [2019-12-27 06:48:19,206 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1f511a4/7647a6b7b6bc421fb98d7abacd4349f3 [2019-12-27 06:48:19,215 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:48:19,217 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:48:19,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:48:19,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:48:19,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:48:19,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:48:19" (1/1) ... [2019-12-27 06:48:19,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b535951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:19, skipping insertion in model container [2019-12-27 06:48:19,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:48:19" (1/1) ... [2019-12-27 06:48:19,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:48:19,299 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:48:19,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:48:19,844 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:48:19,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:48:20,014 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:48:20,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:20 WrapperNode [2019-12-27 06:48:20,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:48:20,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:48:20,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:48:20,016 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:48:20,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:20" (1/1) ... [2019-12-27 06:48:20,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:20" (1/1) ... [2019-12-27 06:48:20,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:48:20,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:48:20,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:48:20,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:48:20,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:20" (1/1) ... [2019-12-27 06:48:20,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:20" (1/1) ... [2019-12-27 06:48:20,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:20" (1/1) ... [2019-12-27 06:48:20,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:20" (1/1) ... [2019-12-27 06:48:20,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:20" (1/1) ... [2019-12-27 06:48:20,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:20" (1/1) ... [2019-12-27 06:48:20,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:20" (1/1) ... [2019-12-27 06:48:20,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:48:20,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:48:20,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:48:20,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:48:20,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:20" (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 06:48:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:48:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:48:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:48:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:48:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:48:20,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:48:20,193 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:48:20,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:48:20,193 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:48:20,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:48:20,194 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 06:48:20,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 06:48:20,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:48:20,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:48:20,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:48:20,196 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 06:48:20,904 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:48:20,904 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:48:20,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:48:20 BoogieIcfgContainer [2019-12-27 06:48:20,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:48:20,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:48:20,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:48:20,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:48:20,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:48:19" (1/3) ... [2019-12-27 06:48:20,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc1b099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:48:20, skipping insertion in model container [2019-12-27 06:48:20,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:20" (2/3) ... [2019-12-27 06:48:20,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc1b099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:48:20, skipping insertion in model container [2019-12-27 06:48:20,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:48:20" (3/3) ... [2019-12-27 06:48:20,914 INFO L109 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt.i [2019-12-27 06:48:20,925 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:48:20,925 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:48:20,932 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:48:20,933 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:48:20,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,973 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,974 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,975 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,975 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,978 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,978 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:20,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,002 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,002 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,002 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,023 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,023 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,023 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,024 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,024 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,025 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,025 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,025 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,025 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,025 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,026 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,026 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,026 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,026 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,026 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,027 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,027 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,027 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,027 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,028 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,028 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,028 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,028 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,028 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,029 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,029 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,029 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,029 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,029 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,030 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,030 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,035 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,036 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,041 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,042 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,042 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,042 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,042 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,043 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,043 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,046 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,047 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,049 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,050 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:48:21,065 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 06:48:21,085 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:48:21,085 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:48:21,085 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:48:21,085 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:48:21,085 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:48:21,085 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:48:21,085 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:48:21,086 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:48:21,103 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 190 transitions [2019-12-27 06:48:21,105 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 168 places, 190 transitions [2019-12-27 06:48:21,198 INFO L132 PetriNetUnfolder]: 35/186 cut-off events. [2019-12-27 06:48:21,198 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:48:21,212 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 35/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 06:48:21,234 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 168 places, 190 transitions [2019-12-27 06:48:21,284 INFO L132 PetriNetUnfolder]: 35/186 cut-off events. [2019-12-27 06:48:21,285 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:48:21,291 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 35/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 06:48:21,308 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 06:48:21,309 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:48:25,017 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 06:48:25,165 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 06:48:25,182 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49357 [2019-12-27 06:48:25,182 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 06:48:25,185 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 85 transitions [2019-12-27 06:48:27,011 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 26346 states. [2019-12-27 06:48:27,013 INFO L276 IsEmpty]: Start isEmpty. Operand 26346 states. [2019-12-27 06:48:27,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 06:48:27,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:48:27,022 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:48:27,022 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:48:27,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:48:27,029 INFO L82 PathProgramCache]: Analyzing trace with hash -759634439, now seen corresponding path program 1 times [2019-12-27 06:48:27,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:48:27,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018806006] [2019-12-27 06:48:27,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:48:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:48:27,331 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 06:48:27,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018806006] [2019-12-27 06:48:27,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:48:27,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:48:27,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939293929] [2019-12-27 06:48:27,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:48:27,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:48:27,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:48:27,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:48:27,375 INFO L87 Difference]: Start difference. First operand 26346 states. Second operand 3 states. [2019-12-27 06:48:28,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:48:28,023 INFO L93 Difference]: Finished difference Result 25258 states and 110048 transitions. [2019-12-27 06:48:28,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:48:28,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 06:48:28,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:48:29,134 INFO L225 Difference]: With dead ends: 25258 [2019-12-27 06:48:29,134 INFO L226 Difference]: Without dead ends: 23750 [2019-12-27 06:48:29,135 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 06:48:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23750 states. [2019-12-27 06:48:30,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23750 to 23750. [2019-12-27 06:48:30,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23750 states. [2019-12-27 06:48:30,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23750 states to 23750 states and 103328 transitions. [2019-12-27 06:48:30,308 INFO L78 Accepts]: Start accepts. Automaton has 23750 states and 103328 transitions. Word has length 9 [2019-12-27 06:48:30,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:48:30,310 INFO L462 AbstractCegarLoop]: Abstraction has 23750 states and 103328 transitions. [2019-12-27 06:48:30,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:48:30,310 INFO L276 IsEmpty]: Start isEmpty. Operand 23750 states and 103328 transitions. [2019-12-27 06:48:30,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:48:30,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:48:30,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:48:30,318 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:48:30,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:48:30,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1799856256, now seen corresponding path program 1 times [2019-12-27 06:48:30,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:48:30,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432407383] [2019-12-27 06:48:30,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:48:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:48:30,447 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 06:48:30,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432407383] [2019-12-27 06:48:30,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:48:30,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:48:30,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340401277] [2019-12-27 06:48:30,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:48:30,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:48:30,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:48:30,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:48:30,452 INFO L87 Difference]: Start difference. First operand 23750 states and 103328 transitions. Second operand 4 states. [2019-12-27 06:48:32,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:48:32,016 INFO L93 Difference]: Finished difference Result 35150 states and 147788 transitions. [2019-12-27 06:48:32,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:48:32,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 06:48:32,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:48:32,218 INFO L225 Difference]: With dead ends: 35150 [2019-12-27 06:48:32,218 INFO L226 Difference]: Without dead ends: 35098 [2019-12-27 06:48:32,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 06:48:32,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35098 states. [2019-12-27 06:48:33,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35098 to 31154. [2019-12-27 06:48:33,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31154 states. [2019-12-27 06:48:33,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31154 states to 31154 states and 133236 transitions. [2019-12-27 06:48:33,778 INFO L78 Accepts]: Start accepts. Automaton has 31154 states and 133236 transitions. Word has length 15 [2019-12-27 06:48:33,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:48:33,779 INFO L462 AbstractCegarLoop]: Abstraction has 31154 states and 133236 transitions. [2019-12-27 06:48:33,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:48:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 31154 states and 133236 transitions. [2019-12-27 06:48:33,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 06:48:33,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:48:33,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:48:33,787 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:48:33,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:48:33,788 INFO L82 PathProgramCache]: Analyzing trace with hash 323486730, now seen corresponding path program 1 times [2019-12-27 06:48:33,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:48:33,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229604992] [2019-12-27 06:48:33,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:48:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:48:33,842 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 06:48:33,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229604992] [2019-12-27 06:48:33,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:48:33,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:48:33,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968693697] [2019-12-27 06:48:33,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:48:33,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:48:33,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:48:33,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:48:33,844 INFO L87 Difference]: Start difference. First operand 31154 states and 133236 transitions. Second operand 3 states. [2019-12-27 06:48:34,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:48:34,097 INFO L93 Difference]: Finished difference Result 41786 states and 175188 transitions. [2019-12-27 06:48:34,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:48:34,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 06:48:34,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:48:34,240 INFO L225 Difference]: With dead ends: 41786 [2019-12-27 06:48:34,240 INFO L226 Difference]: Without dead ends: 41786 [2019-12-27 06:48:34,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:48:36,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41786 states. [2019-12-27 06:48:37,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41786 to 33590. [2019-12-27 06:48:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33590 states. [2019-12-27 06:48:37,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33590 states to 33590 states and 143212 transitions. [2019-12-27 06:48:37,146 INFO L78 Accepts]: Start accepts. Automaton has 33590 states and 143212 transitions. Word has length 18 [2019-12-27 06:48:37,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:48:37,146 INFO L462 AbstractCegarLoop]: Abstraction has 33590 states and 143212 transitions. [2019-12-27 06:48:37,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:48:37,146 INFO L276 IsEmpty]: Start isEmpty. Operand 33590 states and 143212 transitions. [2019-12-27 06:48:37,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 06:48:37,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:48:37,159 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:48:37,159 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:48:37,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:48:37,159 INFO L82 PathProgramCache]: Analyzing trace with hash 207003920, now seen corresponding path program 1 times [2019-12-27 06:48:37,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:48:37,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557907171] [2019-12-27 06:48:37,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:48:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:48:37,239 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 06:48:37,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557907171] [2019-12-27 06:48:37,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:48:37,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:48:37,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344689993] [2019-12-27 06:48:37,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:48:37,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:48:37,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:48:37,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:48:37,242 INFO L87 Difference]: Start difference. First operand 33590 states and 143212 transitions. Second operand 4 states. [2019-12-27 06:48:37,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:48:37,611 INFO L93 Difference]: Finished difference Result 40994 states and 171724 transitions. [2019-12-27 06:48:37,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:48:37,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 06:48:37,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:48:37,713 INFO L225 Difference]: With dead ends: 40994 [2019-12-27 06:48:37,713 INFO L226 Difference]: Without dead ends: 40954 [2019-12-27 06:48:37,714 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 06:48:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40954 states. [2019-12-27 06:48:40,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40954 to 35398. [2019-12-27 06:48:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35398 states. [2019-12-27 06:48:40,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35398 states to 35398 states and 150368 transitions. [2019-12-27 06:48:40,911 INFO L78 Accepts]: Start accepts. Automaton has 35398 states and 150368 transitions. Word has length 18 [2019-12-27 06:48:40,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:48:40,911 INFO L462 AbstractCegarLoop]: Abstraction has 35398 states and 150368 transitions. [2019-12-27 06:48:40,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:48:40,911 INFO L276 IsEmpty]: Start isEmpty. Operand 35398 states and 150368 transitions. [2019-12-27 06:48:40,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 06:48:40,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:48:40,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:48:40,919 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:48:40,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:48:40,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1335251272, now seen corresponding path program 1 times [2019-12-27 06:48:40,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:48:40,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210316065] [2019-12-27 06:48:40,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:48:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:48:40,988 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 06:48:40,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210316065] [2019-12-27 06:48:40,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:48:40,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:48:40,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241466097] [2019-12-27 06:48:40,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:48:40,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:48:40,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:48:40,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:48:40,991 INFO L87 Difference]: Start difference. First operand 35398 states and 150368 transitions. Second operand 4 states. [2019-12-27 06:48:41,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:48:41,391 INFO L93 Difference]: Finished difference Result 43630 states and 183012 transitions. [2019-12-27 06:48:41,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:48:41,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 06:48:41,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:48:41,501 INFO L225 Difference]: With dead ends: 43630 [2019-12-27 06:48:41,501 INFO L226 Difference]: Without dead ends: 43578 [2019-12-27 06:48:41,501 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 06:48:41,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43578 states. [2019-12-27 06:48:42,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43578 to 35970. [2019-12-27 06:48:42,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35970 states. [2019-12-27 06:48:42,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35970 states to 35970 states and 152956 transitions. [2019-12-27 06:48:42,573 INFO L78 Accepts]: Start accepts. Automaton has 35970 states and 152956 transitions. Word has length 18 [2019-12-27 06:48:42,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:48:42,573 INFO L462 AbstractCegarLoop]: Abstraction has 35970 states and 152956 transitions. [2019-12-27 06:48:42,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:48:42,573 INFO L276 IsEmpty]: Start isEmpty. Operand 35970 states and 152956 transitions. [2019-12-27 06:48:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 06:48:42,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:48:42,589 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] [2019-12-27 06:48:42,589 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:48:42,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:48:42,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1864435566, now seen corresponding path program 1 times [2019-12-27 06:48:42,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:48:42,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950305724] [2019-12-27 06:48:42,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:48:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:48:42,655 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 06:48:42,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950305724] [2019-12-27 06:48:42,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:48:42,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:48:42,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780054215] [2019-12-27 06:48:42,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:48:42,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:48:42,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:48:42,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:48:42,657 INFO L87 Difference]: Start difference. First operand 35970 states and 152956 transitions. Second operand 3 states. [2019-12-27 06:48:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:48:43,229 INFO L93 Difference]: Finished difference Result 35266 states and 149241 transitions. [2019-12-27 06:48:43,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:48:43,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 06:48:43,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:48:43,320 INFO L225 Difference]: With dead ends: 35266 [2019-12-27 06:48:43,320 INFO L226 Difference]: Without dead ends: 35266 [2019-12-27 06:48:43,320 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 06:48:43,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35266 states. [2019-12-27 06:48:43,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35266 to 35266. [2019-12-27 06:48:43,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35266 states. [2019-12-27 06:48:46,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35266 states to 35266 states and 149241 transitions. [2019-12-27 06:48:46,360 INFO L78 Accepts]: Start accepts. Automaton has 35266 states and 149241 transitions. Word has length 20 [2019-12-27 06:48:46,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:48:46,361 INFO L462 AbstractCegarLoop]: Abstraction has 35266 states and 149241 transitions. [2019-12-27 06:48:46,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:48:46,361 INFO L276 IsEmpty]: Start isEmpty. Operand 35266 states and 149241 transitions. [2019-12-27 06:48:46,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 06:48:46,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:48:46,376 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] [2019-12-27 06:48:46,376 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:48:46,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:48:46,377 INFO L82 PathProgramCache]: Analyzing trace with hash -583435641, now seen corresponding path program 1 times [2019-12-27 06:48:46,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:48:46,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538750785] [2019-12-27 06:48:46,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:48:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:48:46,436 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 06:48:46,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538750785] [2019-12-27 06:48:46,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:48:46,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:48:46,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455615095] [2019-12-27 06:48:46,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:48:46,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:48:46,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:48:46,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:48:46,439 INFO L87 Difference]: Start difference. First operand 35266 states and 149241 transitions. Second operand 3 states. [2019-12-27 06:48:46,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:48:46,639 INFO L93 Difference]: Finished difference Result 43553 states and 174772 transitions. [2019-12-27 06:48:46,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:48:46,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 06:48:46,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:48:46,729 INFO L225 Difference]: With dead ends: 43553 [2019-12-27 06:48:46,729 INFO L226 Difference]: Without dead ends: 35790 [2019-12-27 06:48:46,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:48:46,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35790 states. [2019-12-27 06:48:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35790 to 35042. [2019-12-27 06:48:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35042 states. [2019-12-27 06:48:47,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35042 states to 35042 states and 139616 transitions. [2019-12-27 06:48:47,715 INFO L78 Accepts]: Start accepts. Automaton has 35042 states and 139616 transitions. Word has length 21 [2019-12-27 06:48:47,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:48:47,715 INFO L462 AbstractCegarLoop]: Abstraction has 35042 states and 139616 transitions. [2019-12-27 06:48:47,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:48:47,715 INFO L276 IsEmpty]: Start isEmpty. Operand 35042 states and 139616 transitions. [2019-12-27 06:48:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 06:48:47,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:48:47,726 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] [2019-12-27 06:48:47,726 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:48:47,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:48:47,727 INFO L82 PathProgramCache]: Analyzing trace with hash -359146426, now seen corresponding path program 1 times [2019-12-27 06:48:47,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:48:47,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180342108] [2019-12-27 06:48:47,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:48:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:48:47,813 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 06:48:47,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180342108] [2019-12-27 06:48:47,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:48:47,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:48:47,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523819015] [2019-12-27 06:48:47,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:48:47,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:48:47,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:48:47,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:48:47,818 INFO L87 Difference]: Start difference. First operand 35042 states and 139616 transitions. Second operand 5 states. [2019-12-27 06:48:47,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:48:47,942 INFO L93 Difference]: Finished difference Result 15598 states and 51058 transitions. [2019-12-27 06:48:47,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:48:47,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 06:48:47,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:48:47,963 INFO L225 Difference]: With dead ends: 15598 [2019-12-27 06:48:47,963 INFO L226 Difference]: Without dead ends: 13159 [2019-12-27 06:48:47,964 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 06:48:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13159 states. [2019-12-27 06:48:48,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13159 to 13159. [2019-12-27 06:48:48,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13159 states. [2019-12-27 06:48:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13159 states to 13159 states and 42157 transitions. [2019-12-27 06:48:48,159 INFO L78 Accepts]: Start accepts. Automaton has 13159 states and 42157 transitions. Word has length 21 [2019-12-27 06:48:48,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:48:48,160 INFO L462 AbstractCegarLoop]: Abstraction has 13159 states and 42157 transitions. [2019-12-27 06:48:48,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:48:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 13159 states and 42157 transitions. [2019-12-27 06:48:48,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:48:48,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:48:48,165 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] [2019-12-27 06:48:48,165 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:48:48,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:48:48,165 INFO L82 PathProgramCache]: Analyzing trace with hash 697145585, now seen corresponding path program 1 times [2019-12-27 06:48:48,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:48:48,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182582942] [2019-12-27 06:48:48,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:48:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:48:48,246 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 06:48:48,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182582942] [2019-12-27 06:48:48,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:48:48,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:48:48,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268845259] [2019-12-27 06:48:48,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:48:48,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:48:48,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:48:48,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:48:48,248 INFO L87 Difference]: Start difference. First operand 13159 states and 42157 transitions. Second operand 6 states. [2019-12-27 06:48:48,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:48:48,347 INFO L93 Difference]: Finished difference Result 4507 states and 12985 transitions. [2019-12-27 06:48:48,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:48:48,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 06:48:48,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:48:48,354 INFO L225 Difference]: With dead ends: 4507 [2019-12-27 06:48:48,354 INFO L226 Difference]: Without dead ends: 3685 [2019-12-27 06:48:48,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:48:48,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3685 states. [2019-12-27 06:48:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3685 to 3645. [2019-12-27 06:48:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3645 states. [2019-12-27 06:48:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3645 states to 3645 states and 10431 transitions. [2019-12-27 06:48:48,396 INFO L78 Accepts]: Start accepts. Automaton has 3645 states and 10431 transitions. Word has length 22 [2019-12-27 06:48:48,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:48:48,397 INFO L462 AbstractCegarLoop]: Abstraction has 3645 states and 10431 transitions. [2019-12-27 06:48:48,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:48:48,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3645 states and 10431 transitions. [2019-12-27 06:48:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 06:48:48,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:48:48,402 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] [2019-12-27 06:48:48,402 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:48:48,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:48:48,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1399010725, now seen corresponding path program 1 times [2019-12-27 06:48:48,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:48:48,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310238072] [2019-12-27 06:48:48,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:48:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:48:48,477 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 06:48:48,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310238072] [2019-12-27 06:48:48,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:48:48,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:48:48,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718808097] [2019-12-27 06:48:48,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:48:48,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:48:48,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:48:48,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:48:48,480 INFO L87 Difference]: Start difference. First operand 3645 states and 10431 transitions. Second operand 5 states. [2019-12-27 06:48:48,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:48:48,707 INFO L93 Difference]: Finished difference Result 4672 states and 12974 transitions. [2019-12-27 06:48:48,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:48:48,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-27 06:48:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:48:48,716 INFO L225 Difference]: With dead ends: 4672 [2019-12-27 06:48:48,716 INFO L226 Difference]: Without dead ends: 4606 [2019-12-27 06:48:48,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:48:48,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4606 states. [2019-12-27 06:48:48,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4606 to 3847. [2019-12-27 06:48:48,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3847 states. [2019-12-27 06:48:48,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 10974 transitions. [2019-12-27 06:48:48,787 INFO L78 Accepts]: Start accepts. Automaton has 3847 states and 10974 transitions. Word has length 32 [2019-12-27 06:48:48,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:48:48,787 INFO L462 AbstractCegarLoop]: Abstraction has 3847 states and 10974 transitions. [2019-12-27 06:48:48,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:48:48,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3847 states and 10974 transitions. [2019-12-27 06:48:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 06:48:48,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:48:48,795 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] [2019-12-27 06:48:48,795 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:48:48,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:48:48,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1249765011, now seen corresponding path program 1 times [2019-12-27 06:48:48,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:48:48,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815968398] [2019-12-27 06:48:48,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:48:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:48:48,840 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 06:48:48,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815968398] [2019-12-27 06:48:48,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:48:48,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:48:48,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323683961] [2019-12-27 06:48:48,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:48:48,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:48:48,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:48:48,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:48:48,843 INFO L87 Difference]: Start difference. First operand 3847 states and 10974 transitions. Second operand 3 states. [2019-12-27 06:48:48,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:48:48,892 INFO L93 Difference]: Finished difference Result 4763 states and 12963 transitions. [2019-12-27 06:48:48,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:48:48,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-27 06:48:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:48:48,901 INFO L225 Difference]: With dead ends: 4763 [2019-12-27 06:48:48,902 INFO L226 Difference]: Without dead ends: 4763 [2019-12-27 06:48:48,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:48:48,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4763 states. [2019-12-27 06:48:48,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4763 to 3805. [2019-12-27 06:48:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3805 states. [2019-12-27 06:48:48,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3805 states to 3805 states and 10436 transitions. [2019-12-27 06:48:48,955 INFO L78 Accepts]: Start accepts. Automaton has 3805 states and 10436 transitions. Word has length 32 [2019-12-27 06:48:48,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:48:48,955 INFO L462 AbstractCegarLoop]: Abstraction has 3805 states and 10436 transitions. [2019-12-27 06:48:48,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:48:48,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3805 states and 10436 transitions. [2019-12-27 06:48:48,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 06:48:48,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:48:48,960 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] [2019-12-27 06:48:48,960 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:48:48,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:48:48,960 INFO L82 PathProgramCache]: Analyzing trace with hash -2123582447, now seen corresponding path program 1 times [2019-12-27 06:48:48,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:48:48,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29860271] [2019-12-27 06:48:48,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:48:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:48:49,006 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 06:48:49,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29860271] [2019-12-27 06:48:49,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:48:49,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:48:49,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972762109] [2019-12-27 06:48:49,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:48:49,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:48:49,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:48:49,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:48:49,009 INFO L87 Difference]: Start difference. First operand 3805 states and 10436 transitions. Second operand 4 states. [2019-12-27 06:48:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:48:49,044 INFO L93 Difference]: Finished difference Result 5668 states and 15168 transitions. [2019-12-27 06:48:49,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:48:49,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-12-27 06:48:49,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:48:49,051 INFO L225 Difference]: With dead ends: 5668 [2019-12-27 06:48:49,052 INFO L226 Difference]: Without dead ends: 3827 [2019-12-27 06:48:49,052 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 06:48:49,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2019-12-27 06:48:49,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 3793. [2019-12-27 06:48:49,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3793 states. [2019-12-27 06:48:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3793 states to 3793 states and 10248 transitions. [2019-12-27 06:48:49,111 INFO L78 Accepts]: Start accepts. Automaton has 3793 states and 10248 transitions. Word has length 32 [2019-12-27 06:48:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:48:49,112 INFO L462 AbstractCegarLoop]: Abstraction has 3793 states and 10248 transitions. [2019-12-27 06:48:49,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:48:49,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3793 states and 10248 transitions. [2019-12-27 06:48:49,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 06:48:49,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:48:49,118 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] [2019-12-27 06:48:49,118 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:48:49,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:48:49,118 INFO L82 PathProgramCache]: Analyzing trace with hash -508061947, now seen corresponding path program 2 times [2019-12-27 06:48:49,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:48:49,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445970115] [2019-12-27 06:48:49,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:48:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:48:49,175 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 06:48:49,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445970115] [2019-12-27 06:48:49,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:48:49,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:48:49,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730616707] [2019-12-27 06:48:49,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:48:49,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:48:49,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:48:49,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:48:49,177 INFO L87 Difference]: Start difference. First operand 3793 states and 10248 transitions. Second operand 3 states. [2019-12-27 06:48:49,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:48:49,216 INFO L93 Difference]: Finished difference Result 3730 states and 10043 transitions. [2019-12-27 06:48:49,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:48:49,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-27 06:48:49,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:48:49,224 INFO L225 Difference]: With dead ends: 3730 [2019-12-27 06:48:49,224 INFO L226 Difference]: Without dead ends: 3730 [2019-12-27 06:48:49,227 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 06:48:49,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3730 states. [2019-12-27 06:48:49,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3730 to 3281. [2019-12-27 06:48:49,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3281 states. [2019-12-27 06:48:49,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 8823 transitions. [2019-12-27 06:48:49,268 INFO L78 Accepts]: Start accepts. Automaton has 3281 states and 8823 transitions. Word has length 32 [2019-12-27 06:48:49,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:48:49,269 INFO L462 AbstractCegarLoop]: Abstraction has 3281 states and 8823 transitions. [2019-12-27 06:48:49,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:48:49,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 8823 transitions. [2019-12-27 06:48:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:48:49,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:48:49,273 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] [2019-12-27 06:48:49,273 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:48:49,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:48:49,273 INFO L82 PathProgramCache]: Analyzing trace with hash 902021539, now seen corresponding path program 1 times [2019-12-27 06:48:49,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:48:49,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722994378] [2019-12-27 06:48:49,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:48:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:48:49,422 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 06:48:49,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722994378] [2019-12-27 06:48:49,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:48:49,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:48:49,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301264377] [2019-12-27 06:48:49,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:48:49,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:48:49,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:48:49,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:48:49,424 INFO L87 Difference]: Start difference. First operand 3281 states and 8823 transitions. Second operand 5 states. [2019-12-27 06:48:49,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:48:49,645 INFO L93 Difference]: Finished difference Result 3974 states and 10471 transitions. [2019-12-27 06:48:49,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:48:49,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 06:48:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:48:49,653 INFO L225 Difference]: With dead ends: 3974 [2019-12-27 06:48:49,653 INFO L226 Difference]: Without dead ends: 3891 [2019-12-27 06:48:49,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:48:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3891 states. [2019-12-27 06:48:49,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3891 to 3031. [2019-12-27 06:48:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3031 states. [2019-12-27 06:48:49,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 8174 transitions. [2019-12-27 06:48:49,711 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 8174 transitions. Word has length 33 [2019-12-27 06:48:49,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:48:49,712 INFO L462 AbstractCegarLoop]: Abstraction has 3031 states and 8174 transitions. [2019-12-27 06:48:49,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:48:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 8174 transitions. [2019-12-27 06:48:49,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:48:49,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:48:49,719 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] [2019-12-27 06:48:49,720 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:48:49,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:48:49,720 INFO L82 PathProgramCache]: Analyzing trace with hash -547913919, now seen corresponding path program 1 times [2019-12-27 06:48:49,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:48:49,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193977379] [2019-12-27 06:48:49,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:48:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:48:49,861 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 06:48:49,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193977379] [2019-12-27 06:48:49,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:48:49,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:48:49,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612004208] [2019-12-27 06:48:49,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:48:49,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:48:49,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:48:49,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:48:49,863 INFO L87 Difference]: Start difference. First operand 3031 states and 8174 transitions. Second operand 7 states. [2019-12-27 06:48:49,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:48:49,975 INFO L93 Difference]: Finished difference Result 2295 states and 6474 transitions. [2019-12-27 06:48:49,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:48:49,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:48:49,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:48:49,978 INFO L225 Difference]: With dead ends: 2295 [2019-12-27 06:48:49,979 INFO L226 Difference]: Without dead ends: 1413 [2019-12-27 06:48:49,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:48:49,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-12-27 06:48:50,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413. [2019-12-27 06:48:50,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-12-27 06:48:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 3879 transitions. [2019-12-27 06:48:50,004 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 3879 transitions. Word has length 33 [2019-12-27 06:48:50,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:48:50,004 INFO L462 AbstractCegarLoop]: Abstraction has 1413 states and 3879 transitions. [2019-12-27 06:48:50,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:48:50,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 3879 transitions. [2019-12-27 06:48:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 06:48:50,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:48:50,008 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] [2019-12-27 06:48:50,008 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:48:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:48:50,008 INFO L82 PathProgramCache]: Analyzing trace with hash 185087785, now seen corresponding path program 1 times [2019-12-27 06:48:50,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:48:50,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92056254] [2019-12-27 06:48:50,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:48:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:48:50,091 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 06:48:50,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92056254] [2019-12-27 06:48:50,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:48:50,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:48:50,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233601215] [2019-12-27 06:48:50,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:48:50,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:48:50,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:48:50,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:48:50,096 INFO L87 Difference]: Start difference. First operand 1413 states and 3879 transitions. Second operand 4 states. [2019-12-27 06:48:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:48:50,117 INFO L93 Difference]: Finished difference Result 1787 states and 4693 transitions. [2019-12-27 06:48:50,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:48:50,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-27 06:48:50,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:48:50,119 INFO L225 Difference]: With dead ends: 1787 [2019-12-27 06:48:50,119 INFO L226 Difference]: Without dead ends: 419 [2019-12-27 06:48:50,119 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 06:48:50,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-12-27 06:48:50,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2019-12-27 06:48:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-12-27 06:48:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 893 transitions. [2019-12-27 06:48:50,126 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 893 transitions. Word has length 48 [2019-12-27 06:48:50,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:48:50,126 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 893 transitions. [2019-12-27 06:48:50,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:48:50,126 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 893 transitions. [2019-12-27 06:48:50,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 06:48:50,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:48:50,127 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] [2019-12-27 06:48:50,128 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:48:50,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:48:50,128 INFO L82 PathProgramCache]: Analyzing trace with hash -964065879, now seen corresponding path program 2 times [2019-12-27 06:48:50,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:48:50,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653835671] [2019-12-27 06:48:50,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:48:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:48:50,209 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 06:48:50,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653835671] [2019-12-27 06:48:50,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:48:50,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:48:50,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255911669] [2019-12-27 06:48:50,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:48:50,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:48:50,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:48:50,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:48:50,211 INFO L87 Difference]: Start difference. First operand 419 states and 893 transitions. Second operand 7 states. [2019-12-27 06:48:50,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:48:50,366 INFO L93 Difference]: Finished difference Result 802 states and 1670 transitions. [2019-12-27 06:48:50,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:48:50,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 06:48:50,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:48:50,367 INFO L225 Difference]: With dead ends: 802 [2019-12-27 06:48:50,367 INFO L226 Difference]: Without dead ends: 540 [2019-12-27 06:48:50,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:48:50,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-12-27 06:48:50,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 482. [2019-12-27 06:48:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-12-27 06:48:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 997 transitions. [2019-12-27 06:48:50,374 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 997 transitions. Word has length 48 [2019-12-27 06:48:50,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:48:50,375 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 997 transitions. [2019-12-27 06:48:50,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:48:50,375 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 997 transitions. [2019-12-27 06:48:50,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 06:48:50,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:48:50,376 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] [2019-12-27 06:48:50,376 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:48:50,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:48:50,377 INFO L82 PathProgramCache]: Analyzing trace with hash -108021629, now seen corresponding path program 3 times [2019-12-27 06:48:50,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:48:50,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760960640] [2019-12-27 06:48:50,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:48:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:48:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:48:50,513 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:48:50,513 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:48:50,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_77| 0 0))) (and (= v_~z$r_buff0_thd0~0_22 0) (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd3~0_41) (= v_~z$r_buff0_thd1~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~z$r_buff1_thd1~0_11) (= |v_#NULL.offset_6| 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1365~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1365~0.base_25|) |v_ULTIMATE.start_main_~#t1365~0.offset_18| 0)) |v_#memory_int_21|) (= 0 v_~z$flush_delayed~0_13) (= 0 v_~z$r_buff1_thd2~0_11) (= 0 v_~weak$$choice2~0_34) (= v_~z$read_delayed~0_5 0) (= v_~z$r_buff0_thd2~0_10 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$r_buff1_thd4~0_21) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1365~0.base_25|)) (= 0 |v_ULTIMATE.start_main_~#t1365~0.offset_18|) (= 0 v_~__unbuffered_p3_EAX~0_16) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~z$r_buff0_thd4~0_28 0) (= v_~z$r_buff0_thd3~0_70 0) (= 0 |v_#NULL.base_6|) (= 0 v_~z$r_buff1_thd0~0_22) (= 0 v_~__unbuffered_cnt~0_27) (= v_~z$mem_tmp~0_10 0) (= v_~z$w_buff0_used~0_95 0) (< 0 |v_#StackHeapBarrier_20|) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1365~0.base_25| 4)) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1365~0.base_25|) (= v_~a~0_12 0) (= 0 v_~z$w_buff0~0_25) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~z~0_20 0) (= v_~y~0_11 0) (= 0 v_~z$w_buff1~0_24) (= v_~x~0_19 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1365~0.base_25| 1) |v_#valid_75|) (= 0 v_~z$w_buff1_used~0_57))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_77|, #memory_int=|v_#memory_int_22|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ULTIMATE.start_main_~#t1367~0.offset=|v_ULTIMATE.start_main_~#t1367~0.offset_19|, ULTIMATE.start_main_~#t1366~0.base=|v_ULTIMATE.start_main_~#t1366~0.base_26|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, #NULL.offset=|v_#NULL.offset_6|, ~a~0=v_~a~0_12, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_28, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ULTIMATE.start_main_~#t1365~0.offset=|v_ULTIMATE.start_main_~#t1365~0.offset_18|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x~0=v_~x~0_19, ULTIMATE.start_main_~#t1365~0.base=|v_ULTIMATE.start_main_~#t1365~0.base_25|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_7|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ~z$w_buff1~0=v_~z$w_buff1~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_22, ULTIMATE.start_main_~#t1366~0.offset=|v_ULTIMATE.start_main_~#t1366~0.offset_19|, ~y~0=v_~y~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_95, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_~#t1368~0.base=|v_ULTIMATE.start_main_~#t1368~0.base_18|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_41, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1367~0.base=|v_ULTIMATE.start_main_~#t1367~0.base_26|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_21|, ULTIMATE.start_main_~#t1368~0.offset=|v_ULTIMATE.start_main_~#t1368~0.offset_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1367~0.offset, ULTIMATE.start_main_~#t1366~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1365~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1365~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1366~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t1368~0.base, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1367~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1368~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:48:50,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L833-1-->L835: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1366~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1366~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1366~0.base_11|) |v_ULTIMATE.start_main_~#t1366~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t1366~0.base_11| 1)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1366~0.base_11| 4) |v_#length_21|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t1366~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1366~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1366~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_6|, ULTIMATE.start_main_~#t1366~0.base=|v_ULTIMATE.start_main_~#t1366~0.base_11|, ULTIMATE.start_main_~#t1366~0.offset=|v_ULTIMATE.start_main_~#t1366~0.offset_10|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1366~0.base, ULTIMATE.start_main_~#t1366~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 06:48:50,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L835-1-->L837: Formula: (and (= |v_ULTIMATE.start_main_~#t1367~0.offset_10| 0) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t1367~0.base_11| 1) |v_#valid_41|) (not (= |v_ULTIMATE.start_main_~#t1367~0.base_11| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1367~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1367~0.base_11|) |v_ULTIMATE.start_main_~#t1367~0.offset_10| 2)) |v_#memory_int_11|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t1367~0.base_11|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1367~0.base_11|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1367~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1367~0.offset=|v_ULTIMATE.start_main_~#t1367~0.offset_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1367~0.base=|v_ULTIMATE.start_main_~#t1367~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1367~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1367~0.base] because there is no mapped edge [2019-12-27 06:48:50,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L837-1-->L839: Formula: (and (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1368~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1368~0.offset_11| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1368~0.base_13|) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1368~0.base_13| 1) |v_#valid_50|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1368~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1368~0.base_13|) |v_ULTIMATE.start_main_~#t1368~0.offset_11| 3)) |v_#memory_int_15|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1368~0.base_13| 4) |v_#length_23|) (not (= |v_ULTIMATE.start_main_~#t1368~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ULTIMATE.start_main_~#t1368~0.base=|v_ULTIMATE.start_main_~#t1368~0.base_13|, ULTIMATE.start_main_~#t1368~0.offset=|v_ULTIMATE.start_main_~#t1368~0.offset_11|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1368~0.base, ULTIMATE.start_main_~#t1368~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 06:48:50,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L4-->L810: Formula: (and (= v_~z$r_buff1_thd1~0_4 v_~z$r_buff0_thd1~0_5) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_6)) (= v_~z$r_buff0_thd4~0_18 v_~z$r_buff1_thd4~0_11) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_5) (= v_~z$r_buff0_thd3~0_45 v_~z$r_buff1_thd3~0_27) (= v_~__unbuffered_p3_EAX~0_5 v_~a~0_7) (= v_~z$r_buff0_thd0~0_17 v_~z$r_buff1_thd0~0_11) (= v_~z$r_buff0_thd4~0_17 1)) InVars {~a~0=v_~a~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_45, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_5} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_11, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~a~0=v_~a~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_4, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_5, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_45, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_5} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 06:48:50,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_~x~0_10 1) (= (+ v_~__unbuffered_cnt~0_24 1) v_~__unbuffered_cnt~0_23) (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= 1 v_~a~0_8) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{~a~0=v_~a~0_8, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_10, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 06:48:50,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= 2 v_~x~0_8) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|) (= v_~__unbuffered_p1_EAX~0_5 v_~y~0_6) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~y~0=v_~y~0_6} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_5, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~y~0=v_~y~0_6, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 06:48:50,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1372759294 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1372759294 256)))) (or (and (= |P3Thread1of1ForFork1_#t~ite28_Out-1372759294| ~z$w_buff0_used~0_In-1372759294) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P3Thread1of1ForFork1_#t~ite28_Out-1372759294| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1372759294, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1372759294} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1372759294, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out-1372759294|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1372759294} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 06:48:50,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-899735553 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-899735553 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-899735553 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-899735553 256)))) (or (and (= 0 |P3Thread1of1ForFork1_#t~ite29_Out-899735553|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-899735553 |P3Thread1of1ForFork1_#t~ite29_Out-899735553|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-899735553, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-899735553, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-899735553, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-899735553} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-899735553, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out-899735553|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-899735553, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-899735553, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-899735553} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 06:48:50,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L813-->L814: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-912145024 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-912145024 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-912145024)) (and (= ~z$r_buff0_thd4~0_Out-912145024 ~z$r_buff0_thd4~0_In-912145024) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-912145024, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-912145024} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-912145024, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-912145024, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-912145024|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 06:48:50,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2141544360 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In2141544360 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In2141544360 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In2141544360 256)))) (or (and (= 0 |P3Thread1of1ForFork1_#t~ite31_Out2141544360|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd4~0_In2141544360 |P3Thread1of1ForFork1_#t~ite31_Out2141544360|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2141544360, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2141544360, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2141544360, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2141544360} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2141544360, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2141544360, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2141544360, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2141544360, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out2141544360|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 06:48:50,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L814-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~z$r_buff1_thd4~0_16 |v_P3Thread1of1ForFork1_#t~ite31_8|) (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= |v_P3Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_8|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 06:48:50,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L778-->L779: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~z$r_buff0_thd3~0_61 v_~z$r_buff0_thd3~0_60)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_10|, ~weak$$choice2~0=v_~weak$$choice2~0_27, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 06:48:50,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L779-->L779-8: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite24_Out-1749253342| |P2Thread1of1ForFork0_#t~ite23_Out-1749253342|)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1749253342 256) 0)) (.cse4 (= 0 (mod ~z$r_buff1_thd3~0_In-1749253342 256))) (.cse5 (= 0 (mod ~weak$$choice2~0_In-1749253342 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1749253342 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-1749253342 256) 0))) (or (and (or (and .cse0 (or .cse1 (and .cse2 .cse3) (and .cse4 .cse3)) .cse5 (= ~z$r_buff1_thd3~0_In-1749253342 |P2Thread1of1ForFork0_#t~ite23_Out-1749253342|)) (and (= ~z$r_buff1_thd3~0_In-1749253342 |P2Thread1of1ForFork0_#t~ite24_Out-1749253342|) (= |P2Thread1of1ForFork0_#t~ite23_In-1749253342| |P2Thread1of1ForFork0_#t~ite23_Out-1749253342|) (not .cse5))) (= |P2Thread1of1ForFork0_#t~ite22_In-1749253342| |P2Thread1of1ForFork0_#t~ite22_Out-1749253342|)) (let ((.cse6 (not .cse3))) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite22_Out-1749253342| |P2Thread1of1ForFork0_#t~ite23_Out-1749253342|) (or (not .cse2) .cse6) (or (not .cse4) .cse6) .cse5 (not .cse1) (= |P2Thread1of1ForFork0_#t~ite22_Out-1749253342| 0))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1749253342, P2Thread1of1ForFork0_#t~ite22=|P2Thread1of1ForFork0_#t~ite22_In-1749253342|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1749253342, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1749253342|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1749253342, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1749253342, ~weak$$choice2~0=~weak$$choice2~0_In-1749253342} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1749253342, P2Thread1of1ForFork0_#t~ite22=|P2Thread1of1ForFork0_#t~ite22_Out-1749253342|, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1749253342|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1749253342, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1749253342|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1749253342, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1749253342, ~weak$$choice2~0=~weak$$choice2~0_In-1749253342} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite22, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 06:48:50,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L781-->L789: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_14 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 06:48:50,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L843-->L845-2: Formula: (and (or (= (mod v_~z$w_buff0_used~0_65 256) 0) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_65, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_65, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 06:48:50,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L845-2-->L845-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1105908760 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1105908760 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out1105908760| ~z$w_buff1~0_In1105908760) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite36_Out1105908760| ~z~0_In1105908760)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1105908760, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1105908760, ~z$w_buff1~0=~z$w_buff1~0_In1105908760, ~z~0=~z~0_In1105908760} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1105908760, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1105908760, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1105908760|, ~z$w_buff1~0=~z$w_buff1~0_In1105908760, ~z~0=~z~0_In1105908760} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 06:48:50,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_13 |v_ULTIMATE.start_main_#t~ite36_7|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_7|, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-27 06:48:50,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In273240312 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In273240312 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out273240312|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In273240312 |ULTIMATE.start_main_#t~ite38_Out273240312|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In273240312, ~z$w_buff0_used~0=~z$w_buff0_used~0_In273240312} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In273240312, ~z$w_buff0_used~0=~z$w_buff0_used~0_In273240312, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out273240312|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 06:48:50,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L847-->L847-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In961320511 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In961320511 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In961320511 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In961320511 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out961320511| ~z$w_buff1_used~0_In961320511) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite39_Out961320511| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In961320511, ~z$w_buff0_used~0=~z$w_buff0_used~0_In961320511, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In961320511, ~z$w_buff1_used~0=~z$w_buff1_used~0_In961320511} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In961320511, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out961320511|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In961320511, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In961320511, ~z$w_buff1_used~0=~z$w_buff1_used~0_In961320511} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:48:50,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-635998182 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-635998182 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-635998182| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-635998182| ~z$r_buff0_thd0~0_In-635998182) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-635998182, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-635998182} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-635998182, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-635998182|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-635998182} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 06:48:50,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L849-->L849-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1439227730 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1439227730 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1439227730 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1439227730 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite41_Out1439227730|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In1439227730 |ULTIMATE.start_main_#t~ite41_Out1439227730|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1439227730, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1439227730, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1439227730, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1439227730} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1439227730|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1439227730, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1439227730, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1439227730, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1439227730} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 06:48:50,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite41_14| v_~z$r_buff1_thd0~0_15) (= v_~x~0_14 2) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_11 256)) (= 0 v_~__unbuffered_p1_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 0 v_~__unbuffered_p3_EAX~0_11) (= v_~main$tmp_guard1~0_11 0)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~x~0=v_~x~0_14} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_15, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~x~0=v_~x~0_14, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:48:50,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:48:50 BasicIcfg [2019-12-27 06:48:50,692 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:48:50,695 INFO L168 Benchmark]: Toolchain (without parser) took 31478.25 ms. Allocated memory was 137.9 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 100.7 MB in the beginning and 1.1 GB in the end (delta: -993.9 MB). Peak memory consumption was 710.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:48:50,700 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 06:48:50,701 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.28 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.5 MB in the beginning and 153.5 MB in the end (delta: -53.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:48:50,702 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.55 ms. Allocated memory is still 201.9 MB. Free memory was 153.5 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:48:50,704 INFO L168 Benchmark]: Boogie Preprocessor took 36.63 ms. Allocated memory is still 201.9 MB. Free memory was 150.8 MB in the beginning and 148.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:48:50,709 INFO L168 Benchmark]: RCFGBuilder took 780.32 ms. Allocated memory is still 201.9 MB. Free memory was 148.7 MB in the beginning and 103.0 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:48:50,709 INFO L168 Benchmark]: TraceAbstraction took 29785.49 ms. Allocated memory was 201.9 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 102.3 MB in the beginning and 1.1 GB in the end (delta: -992.3 MB). Peak memory consumption was 647.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:48:50,716 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.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.28 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.5 MB in the beginning and 153.5 MB in the end (delta: -53.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.55 ms. Allocated memory is still 201.9 MB. Free memory was 153.5 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.63 ms. Allocated memory is still 201.9 MB. Free memory was 150.8 MB in the beginning and 148.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 780.32 ms. Allocated memory is still 201.9 MB. Free memory was 148.7 MB in the beginning and 103.0 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29785.49 ms. Allocated memory was 201.9 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 102.3 MB in the beginning and 1.1 GB in the end (delta: -992.3 MB). Peak memory consumption was 647.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 168 ProgramPointsBefore, 78 ProgramPointsAfterwards, 190 TransitionsBefore, 85 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 20 ChoiceCompositions, 5376 VarBasedMoverChecksPositive, 128 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49357 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 4 z$w_buff1 = z$w_buff0 [L795] 4 z$w_buff0 = 1 [L796] 4 z$w_buff1_used = z$w_buff0_used [L797] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 1 [L769] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 3 z$flush_delayed = weak$$choice2 [L772] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L773] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L774] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L775] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L776] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L779] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 29.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1893 SDtfs, 2321 SDslu, 2910 SDs, 0 SdLazy, 939 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35970occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 29210 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 500 NumberOfCodeBlocks, 500 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 435 ConstructedInterpolants, 0 QuantifiedInterpolants, 35017 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...