/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix000_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:02:14,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:02:14,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:02:14,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:02:14,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:02:14,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:02:14,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:02:14,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:02:14,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:02:14,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:02:14,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:02:14,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:02:14,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:02:14,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:02:14,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:02:14,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:02:14,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:02:14,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:02:14,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:02:14,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:02:14,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:02:14,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:02:14,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:02:14,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:02:14,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:02:14,950 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:02:14,950 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:02:14,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:02:14,952 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:02:14,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:02:14,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:02:14,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:02:14,957 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:02:14,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:02:14,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:02:14,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:02:14,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:02:14,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:02:14,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:02:14,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:02:14,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:02:14,969 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:02:14,992 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:02:14,992 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:02:14,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:02:14,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:02:14,994 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:02:14,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:02:14,994 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:02:14,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:02:14,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:02:14,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:02:14,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:02:14,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:02:14,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:02:14,996 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:02:14,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:02:14,996 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:02:14,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:02:14,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:02:14,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:02:14,997 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:02:14,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:02:14,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:02:14,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:02:14,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:02:14,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:02:14,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:02:14,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:02:14,998 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:02:14,999 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:02:15,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:02:15,299 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:02:15,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:02:15,304 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:02:15,304 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:02:15,305 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000_pso.opt.i [2019-12-27 01:02:15,370 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7903b641d/168db095e7494c92aa0f1e931a88473c/FLAG012fd68b7 [2019-12-27 01:02:15,991 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:02:15,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000_pso.opt.i [2019-12-27 01:02:16,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7903b641d/168db095e7494c92aa0f1e931a88473c/FLAG012fd68b7 [2019-12-27 01:02:16,286 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7903b641d/168db095e7494c92aa0f1e931a88473c [2019-12-27 01:02:16,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:02:16,298 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:02:16,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:02:16,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:02:16,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:02:16,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:02:16" (1/1) ... [2019-12-27 01:02:16,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27da9574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:02:16, skipping insertion in model container [2019-12-27 01:02:16,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:02:16" (1/1) ... [2019-12-27 01:02:16,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:02:16,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:02:16,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:02:16,893 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:02:16,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:02:17,063 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:02:17,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:02:17 WrapperNode [2019-12-27 01:02:17,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:02:17,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:02:17,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:02:17,066 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:02:17,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:02:17" (1/1) ... [2019-12-27 01:02:17,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:02:17" (1/1) ... [2019-12-27 01:02:17,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:02:17,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:02:17,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:02:17,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:02:17,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:02:17" (1/1) ... [2019-12-27 01:02:17,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:02:17" (1/1) ... [2019-12-27 01:02:17,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:02:17" (1/1) ... [2019-12-27 01:02:17,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:02:17" (1/1) ... [2019-12-27 01:02:17,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:02:17" (1/1) ... [2019-12-27 01:02:17,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:02:17" (1/1) ... [2019-12-27 01:02:17,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:02:17" (1/1) ... [2019-12-27 01:02:17,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:02:17,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:02:17,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:02:17,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:02:17,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:02:17" (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 01:02:17,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:02:17,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:02:17,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:02:17,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:02:17,267 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:02:17,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:02:17,268 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:02:17,268 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:02:17,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:02:17,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:02:17,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:02:17,271 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 01:02:18,110 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:02:18,110 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:02:18,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:02:18 BoogieIcfgContainer [2019-12-27 01:02:18,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:02:18,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:02:18,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:02:18,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:02:18,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:02:16" (1/3) ... [2019-12-27 01:02:18,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2745fe7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:02:18, skipping insertion in model container [2019-12-27 01:02:18,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:02:17" (2/3) ... [2019-12-27 01:02:18,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2745fe7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:02:18, skipping insertion in model container [2019-12-27 01:02:18,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:02:18" (3/3) ... [2019-12-27 01:02:18,123 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_pso.opt.i [2019-12-27 01:02:18,133 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:02:18,134 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:02:18,141 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:02:18,142 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:02:18,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,200 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,221 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,221 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,222 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,222 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,222 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,250 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,251 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,262 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,263 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,265 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:02:18,282 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 01:02:18,302 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:02:18,302 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:02:18,302 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:02:18,302 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:02:18,302 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:02:18,303 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:02:18,303 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:02:18,303 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:02:18,320 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-12-27 01:02:18,322 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-27 01:02:18,434 INFO L132 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-27 01:02:18,434 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:02:18,456 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 01:02:18,489 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-27 01:02:18,548 INFO L132 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-27 01:02:18,548 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:02:18,558 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 01:02:18,585 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-27 01:02:18,586 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:02:23,981 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 01:02:24,107 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 01:02:24,158 INFO L206 etLargeBlockEncoding]: Checked pairs total: 123043 [2019-12-27 01:02:24,158 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 01:02:24,162 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 128 transitions [2019-12-27 01:02:25,592 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 23592 states. [2019-12-27 01:02:25,594 INFO L276 IsEmpty]: Start isEmpty. Operand 23592 states. [2019-12-27 01:02:25,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 01:02:25,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:25,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 01:02:25,601 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:25,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:25,607 INFO L82 PathProgramCache]: Analyzing trace with hash 962357028, now seen corresponding path program 1 times [2019-12-27 01:02:25,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:25,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474049905] [2019-12-27 01:02:25,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:25,874 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 01:02:25,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474049905] [2019-12-27 01:02:25,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:25,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:02:25,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045799090] [2019-12-27 01:02:25,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:02:25,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:25,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:02:25,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:02:25,904 INFO L87 Difference]: Start difference. First operand 23592 states. Second operand 3 states. [2019-12-27 01:02:27,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:27,036 INFO L93 Difference]: Finished difference Result 23438 states and 83922 transitions. [2019-12-27 01:02:27,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:02:27,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 01:02:27,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:27,284 INFO L225 Difference]: With dead ends: 23438 [2019-12-27 01:02:27,285 INFO L226 Difference]: Without dead ends: 21828 [2019-12-27 01:02:27,286 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 01:02:27,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21828 states. [2019-12-27 01:02:28,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21828 to 21828. [2019-12-27 01:02:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21828 states. [2019-12-27 01:02:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21828 states to 21828 states and 78096 transitions. [2019-12-27 01:02:28,689 INFO L78 Accepts]: Start accepts. Automaton has 21828 states and 78096 transitions. Word has length 5 [2019-12-27 01:02:28,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:28,689 INFO L462 AbstractCegarLoop]: Abstraction has 21828 states and 78096 transitions. [2019-12-27 01:02:28,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:02:28,690 INFO L276 IsEmpty]: Start isEmpty. Operand 21828 states and 78096 transitions. [2019-12-27 01:02:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:02:28,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:28,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:28,702 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:28,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:28,702 INFO L82 PathProgramCache]: Analyzing trace with hash -549370662, now seen corresponding path program 1 times [2019-12-27 01:02:28,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:28,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956522915] [2019-12-27 01:02:28,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:28,865 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 01:02:28,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956522915] [2019-12-27 01:02:28,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:28,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:02:28,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643528662] [2019-12-27 01:02:28,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:02:28,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:28,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:02:28,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:02:28,869 INFO L87 Difference]: Start difference. First operand 21828 states and 78096 transitions. Second operand 4 states. [2019-12-27 01:02:30,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:30,578 INFO L93 Difference]: Finished difference Result 34804 states and 119015 transitions. [2019-12-27 01:02:30,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:02:30,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:02:30,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:30,759 INFO L225 Difference]: With dead ends: 34804 [2019-12-27 01:02:30,760 INFO L226 Difference]: Without dead ends: 34788 [2019-12-27 01:02:30,761 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 01:02:31,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34788 states. [2019-12-27 01:02:32,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34788 to 33965. [2019-12-27 01:02:32,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33965 states. [2019-12-27 01:02:32,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33965 states to 33965 states and 116837 transitions. [2019-12-27 01:02:32,117 INFO L78 Accepts]: Start accepts. Automaton has 33965 states and 116837 transitions. Word has length 11 [2019-12-27 01:02:32,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:32,118 INFO L462 AbstractCegarLoop]: Abstraction has 33965 states and 116837 transitions. [2019-12-27 01:02:32,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:02:32,118 INFO L276 IsEmpty]: Start isEmpty. Operand 33965 states and 116837 transitions. [2019-12-27 01:02:32,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 01:02:32,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:32,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:32,122 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:32,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:32,122 INFO L82 PathProgramCache]: Analyzing trace with hash -779218677, now seen corresponding path program 1 times [2019-12-27 01:02:32,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:32,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975391550] [2019-12-27 01:02:32,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:32,221 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 01:02:32,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975391550] [2019-12-27 01:02:32,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:32,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:02:32,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38293356] [2019-12-27 01:02:32,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:02:32,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:32,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:02:32,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:02:32,225 INFO L87 Difference]: Start difference. First operand 33965 states and 116837 transitions. Second operand 4 states. [2019-12-27 01:02:32,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:32,981 INFO L93 Difference]: Finished difference Result 44062 states and 148933 transitions. [2019-12-27 01:02:32,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:02:32,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 01:02:32,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:33,144 INFO L225 Difference]: With dead ends: 44062 [2019-12-27 01:02:33,144 INFO L226 Difference]: Without dead ends: 44047 [2019-12-27 01:02:33,145 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 01:02:33,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44047 states. [2019-12-27 01:02:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44047 to 39221. [2019-12-27 01:02:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39221 states. [2019-12-27 01:02:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39221 states to 39221 states and 134004 transitions. [2019-12-27 01:02:34,729 INFO L78 Accepts]: Start accepts. Automaton has 39221 states and 134004 transitions. Word has length 14 [2019-12-27 01:02:34,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:34,730 INFO L462 AbstractCegarLoop]: Abstraction has 39221 states and 134004 transitions. [2019-12-27 01:02:34,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:02:34,730 INFO L276 IsEmpty]: Start isEmpty. Operand 39221 states and 134004 transitions. [2019-12-27 01:02:34,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 01:02:34,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:34,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:34,735 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:34,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:34,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1614053436, now seen corresponding path program 1 times [2019-12-27 01:02:34,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:34,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242095709] [2019-12-27 01:02:34,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:34,771 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 01:02:34,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242095709] [2019-12-27 01:02:34,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:34,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:02:34,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648081128] [2019-12-27 01:02:34,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:02:34,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:34,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:02:34,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:02:34,774 INFO L87 Difference]: Start difference. First operand 39221 states and 134004 transitions. Second operand 3 states. [2019-12-27 01:02:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:36,430 INFO L93 Difference]: Finished difference Result 64200 states and 209661 transitions. [2019-12-27 01:02:36,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:02:36,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 01:02:36,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:36,652 INFO L225 Difference]: With dead ends: 64200 [2019-12-27 01:02:36,652 INFO L226 Difference]: Without dead ends: 64200 [2019-12-27 01:02:36,653 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 01:02:37,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64200 states. [2019-12-27 01:02:37,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64200 to 57180. [2019-12-27 01:02:37,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57180 states. [2019-12-27 01:02:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57180 states to 57180 states and 189699 transitions. [2019-12-27 01:02:38,115 INFO L78 Accepts]: Start accepts. Automaton has 57180 states and 189699 transitions. Word has length 15 [2019-12-27 01:02:38,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:38,115 INFO L462 AbstractCegarLoop]: Abstraction has 57180 states and 189699 transitions. [2019-12-27 01:02:38,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:02:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 57180 states and 189699 transitions. [2019-12-27 01:02:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:02:38,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:38,122 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:38,122 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:38,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:38,123 INFO L82 PathProgramCache]: Analyzing trace with hash -223387027, now seen corresponding path program 1 times [2019-12-27 01:02:38,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:38,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441899611] [2019-12-27 01:02:38,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:38,167 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 01:02:38,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441899611] [2019-12-27 01:02:38,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:38,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:02:38,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493395522] [2019-12-27 01:02:38,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:02:38,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:38,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:02:38,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:02:38,169 INFO L87 Difference]: Start difference. First operand 57180 states and 189699 transitions. Second operand 3 states. [2019-12-27 01:02:38,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:38,764 INFO L93 Difference]: Finished difference Result 53778 states and 178159 transitions. [2019-12-27 01:02:38,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:02:38,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 01:02:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:38,884 INFO L225 Difference]: With dead ends: 53778 [2019-12-27 01:02:38,884 INFO L226 Difference]: Without dead ends: 53778 [2019-12-27 01:02:38,884 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 01:02:39,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53778 states. [2019-12-27 01:02:40,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53778 to 53778. [2019-12-27 01:02:40,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53778 states. [2019-12-27 01:02:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53778 states to 53778 states and 178159 transitions. [2019-12-27 01:02:40,488 INFO L78 Accepts]: Start accepts. Automaton has 53778 states and 178159 transitions. Word has length 16 [2019-12-27 01:02:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:40,488 INFO L462 AbstractCegarLoop]: Abstraction has 53778 states and 178159 transitions. [2019-12-27 01:02:40,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:02:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 53778 states and 178159 transitions. [2019-12-27 01:02:40,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 01:02:40,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:40,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:40,495 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:40,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:40,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1852908680, now seen corresponding path program 1 times [2019-12-27 01:02:40,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:40,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402329524] [2019-12-27 01:02:40,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:40,555 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 01:02:40,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402329524] [2019-12-27 01:02:40,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:40,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:02:40,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302541063] [2019-12-27 01:02:40,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:02:40,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:40,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:02:40,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:02:40,558 INFO L87 Difference]: Start difference. First operand 53778 states and 178159 transitions. Second operand 4 states. [2019-12-27 01:02:41,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:41,079 INFO L93 Difference]: Finished difference Result 66740 states and 217759 transitions. [2019-12-27 01:02:41,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:02:41,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 01:02:41,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:41,202 INFO L225 Difference]: With dead ends: 66740 [2019-12-27 01:02:41,202 INFO L226 Difference]: Without dead ends: 66723 [2019-12-27 01:02:41,203 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 01:02:42,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66723 states. [2019-12-27 01:02:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66723 to 54524. [2019-12-27 01:02:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54524 states. [2019-12-27 01:02:45,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54524 states to 54524 states and 180597 transitions. [2019-12-27 01:02:45,999 INFO L78 Accepts]: Start accepts. Automaton has 54524 states and 180597 transitions. Word has length 17 [2019-12-27 01:02:46,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:46,000 INFO L462 AbstractCegarLoop]: Abstraction has 54524 states and 180597 transitions. [2019-12-27 01:02:46,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:02:46,000 INFO L276 IsEmpty]: Start isEmpty. Operand 54524 states and 180597 transitions. [2019-12-27 01:02:46,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 01:02:46,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:46,020 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 01:02:46,020 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:46,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:46,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1536984533, now seen corresponding path program 1 times [2019-12-27 01:02:46,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:46,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172266426] [2019-12-27 01:02:46,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:46,130 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 01:02:46,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172266426] [2019-12-27 01:02:46,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:46,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:02:46,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917047081] [2019-12-27 01:02:46,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:02:46,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:46,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:02:46,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:02:46,133 INFO L87 Difference]: Start difference. First operand 54524 states and 180597 transitions. Second operand 5 states. [2019-12-27 01:02:47,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:47,007 INFO L93 Difference]: Finished difference Result 77321 states and 249603 transitions. [2019-12-27 01:02:47,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:02:47,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-27 01:02:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:47,151 INFO L225 Difference]: With dead ends: 77321 [2019-12-27 01:02:47,151 INFO L226 Difference]: Without dead ends: 77307 [2019-12-27 01:02:47,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:02:47,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77307 states. [2019-12-27 01:02:48,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77307 to 59256. [2019-12-27 01:02:48,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59256 states. [2019-12-27 01:02:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59256 states to 59256 states and 195309 transitions. [2019-12-27 01:02:49,037 INFO L78 Accepts]: Start accepts. Automaton has 59256 states and 195309 transitions. Word has length 20 [2019-12-27 01:02:49,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:49,038 INFO L462 AbstractCegarLoop]: Abstraction has 59256 states and 195309 transitions. [2019-12-27 01:02:49,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:02:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 59256 states and 195309 transitions. [2019-12-27 01:02:49,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 01:02:49,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:49,056 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] [2019-12-27 01:02:49,056 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:49,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:49,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1507310190, now seen corresponding path program 1 times [2019-12-27 01:02:49,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:49,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447476794] [2019-12-27 01:02:49,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:49,136 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 01:02:49,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447476794] [2019-12-27 01:02:49,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:49,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:02:49,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901292303] [2019-12-27 01:02:49,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:02:49,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:49,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:02:49,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:02:49,138 INFO L87 Difference]: Start difference. First operand 59256 states and 195309 transitions. Second operand 4 states. [2019-12-27 01:02:49,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:49,218 INFO L93 Difference]: Finished difference Result 11646 states and 31144 transitions. [2019-12-27 01:02:49,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:02:49,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-27 01:02:49,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:49,230 INFO L225 Difference]: With dead ends: 11646 [2019-12-27 01:02:49,230 INFO L226 Difference]: Without dead ends: 7170 [2019-12-27 01:02:49,231 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 01:02:49,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2019-12-27 01:02:49,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 7134. [2019-12-27 01:02:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7134 states. [2019-12-27 01:02:49,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7134 states to 7134 states and 16503 transitions. [2019-12-27 01:02:49,321 INFO L78 Accepts]: Start accepts. Automaton has 7134 states and 16503 transitions. Word has length 23 [2019-12-27 01:02:49,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:49,321 INFO L462 AbstractCegarLoop]: Abstraction has 7134 states and 16503 transitions. [2019-12-27 01:02:49,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:02:49,321 INFO L276 IsEmpty]: Start isEmpty. Operand 7134 states and 16503 transitions. [2019-12-27 01:02:49,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 01:02:49,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:49,326 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] [2019-12-27 01:02:49,326 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:49,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:49,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1044355322, now seen corresponding path program 1 times [2019-12-27 01:02:49,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:49,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827746039] [2019-12-27 01:02:49,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:49,369 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 01:02:49,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827746039] [2019-12-27 01:02:49,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:49,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:02:49,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75109675] [2019-12-27 01:02:49,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:02:49,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:49,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:02:49,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:02:49,371 INFO L87 Difference]: Start difference. First operand 7134 states and 16503 transitions. Second operand 3 states. [2019-12-27 01:02:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:49,462 INFO L93 Difference]: Finished difference Result 7632 states and 16713 transitions. [2019-12-27 01:02:49,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:02:49,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-27 01:02:49,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:49,473 INFO L225 Difference]: With dead ends: 7632 [2019-12-27 01:02:49,473 INFO L226 Difference]: Without dead ends: 7632 [2019-12-27 01:02:49,474 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 01:02:49,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7632 states. [2019-12-27 01:02:49,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7632 to 7105. [2019-12-27 01:02:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7105 states. [2019-12-27 01:02:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 15616 transitions. [2019-12-27 01:02:49,585 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 15616 transitions. Word has length 31 [2019-12-27 01:02:49,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:49,585 INFO L462 AbstractCegarLoop]: Abstraction has 7105 states and 15616 transitions. [2019-12-27 01:02:49,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:02:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 15616 transitions. [2019-12-27 01:02:49,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:02:49,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:49,594 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] [2019-12-27 01:02:49,594 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:49,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:49,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1333269799, now seen corresponding path program 1 times [2019-12-27 01:02:49,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:49,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038756088] [2019-12-27 01:02:49,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:49,754 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 01:02:49,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038756088] [2019-12-27 01:02:49,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:49,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:02:49,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778700044] [2019-12-27 01:02:49,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:02:49,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:49,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:02:49,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:02:49,757 INFO L87 Difference]: Start difference. First operand 7105 states and 15616 transitions. Second operand 5 states. [2019-12-27 01:02:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:50,124 INFO L93 Difference]: Finished difference Result 7988 states and 17297 transitions. [2019-12-27 01:02:50,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:02:50,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-27 01:02:50,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:50,134 INFO L225 Difference]: With dead ends: 7988 [2019-12-27 01:02:50,134 INFO L226 Difference]: Without dead ends: 7987 [2019-12-27 01:02:50,135 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 01:02:50,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7987 states. [2019-12-27 01:02:50,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7987 to 6266. [2019-12-27 01:02:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6266 states. [2019-12-27 01:02:50,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6266 states to 6266 states and 13920 transitions. [2019-12-27 01:02:50,205 INFO L78 Accepts]: Start accepts. Automaton has 6266 states and 13920 transitions. Word has length 34 [2019-12-27 01:02:50,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:50,205 INFO L462 AbstractCegarLoop]: Abstraction has 6266 states and 13920 transitions. [2019-12-27 01:02:50,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:02:50,206 INFO L276 IsEmpty]: Start isEmpty. Operand 6266 states and 13920 transitions. [2019-12-27 01:02:50,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 01:02:50,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:50,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:50,212 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:50,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:50,212 INFO L82 PathProgramCache]: Analyzing trace with hash 135630366, now seen corresponding path program 1 times [2019-12-27 01:02:50,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:50,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121014547] [2019-12-27 01:02:50,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:50,279 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 01:02:50,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121014547] [2019-12-27 01:02:50,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:50,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:02:50,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670586803] [2019-12-27 01:02:50,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:02:50,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:50,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:02:50,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:02:50,282 INFO L87 Difference]: Start difference. First operand 6266 states and 13920 transitions. Second operand 5 states. [2019-12-27 01:02:50,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:50,396 INFO L93 Difference]: Finished difference Result 9189 states and 20526 transitions. [2019-12-27 01:02:50,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:02:50,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 01:02:50,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:50,404 INFO L225 Difference]: With dead ends: 9189 [2019-12-27 01:02:50,404 INFO L226 Difference]: Without dead ends: 7449 [2019-12-27 01:02:50,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:02:50,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7449 states. [2019-12-27 01:02:50,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7449 to 7449. [2019-12-27 01:02:50,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7449 states. [2019-12-27 01:02:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7449 states to 7449 states and 16653 transitions. [2019-12-27 01:02:50,479 INFO L78 Accepts]: Start accepts. Automaton has 7449 states and 16653 transitions. Word has length 41 [2019-12-27 01:02:50,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:50,481 INFO L462 AbstractCegarLoop]: Abstraction has 7449 states and 16653 transitions. [2019-12-27 01:02:50,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:02:50,481 INFO L276 IsEmpty]: Start isEmpty. Operand 7449 states and 16653 transitions. [2019-12-27 01:02:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 01:02:50,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:50,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:50,491 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:50,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:50,491 INFO L82 PathProgramCache]: Analyzing trace with hash -584274922, now seen corresponding path program 1 times [2019-12-27 01:02:50,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:50,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030717402] [2019-12-27 01:02:50,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:50,562 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 01:02:50,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030717402] [2019-12-27 01:02:50,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:50,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:02:50,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988525481] [2019-12-27 01:02:50,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:02:50,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:50,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:02:50,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:02:50,566 INFO L87 Difference]: Start difference. First operand 7449 states and 16653 transitions. Second operand 3 states. [2019-12-27 01:02:50,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:50,601 INFO L93 Difference]: Finished difference Result 7448 states and 16651 transitions. [2019-12-27 01:02:50,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:02:50,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-27 01:02:50,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:50,611 INFO L225 Difference]: With dead ends: 7448 [2019-12-27 01:02:50,611 INFO L226 Difference]: Without dead ends: 7448 [2019-12-27 01:02:50,612 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 01:02:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7448 states. [2019-12-27 01:02:50,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7448 to 7448. [2019-12-27 01:02:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7448 states. [2019-12-27 01:02:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7448 states to 7448 states and 16651 transitions. [2019-12-27 01:02:50,716 INFO L78 Accepts]: Start accepts. Automaton has 7448 states and 16651 transitions. Word has length 42 [2019-12-27 01:02:50,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:50,717 INFO L462 AbstractCegarLoop]: Abstraction has 7448 states and 16651 transitions. [2019-12-27 01:02:50,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:02:50,717 INFO L276 IsEmpty]: Start isEmpty. Operand 7448 states and 16651 transitions. [2019-12-27 01:02:50,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 01:02:50,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:50,727 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] [2019-12-27 01:02:50,728 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:50,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:50,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1281753600, now seen corresponding path program 1 times [2019-12-27 01:02:50,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:50,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042764583] [2019-12-27 01:02:50,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:50,790 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 01:02:50,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042764583] [2019-12-27 01:02:50,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:50,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:02:50,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045404654] [2019-12-27 01:02:50,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:02:50,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:50,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:02:50,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:02:50,792 INFO L87 Difference]: Start difference. First operand 7448 states and 16651 transitions. Second operand 4 states. [2019-12-27 01:02:50,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:50,841 INFO L93 Difference]: Finished difference Result 8412 states and 18754 transitions. [2019-12-27 01:02:50,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:02:50,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-12-27 01:02:50,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:50,853 INFO L225 Difference]: With dead ends: 8412 [2019-12-27 01:02:50,853 INFO L226 Difference]: Without dead ends: 6447 [2019-12-27 01:02:50,859 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 01:02:50,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6447 states. [2019-12-27 01:02:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6447 to 6427. [2019-12-27 01:02:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6427 states. [2019-12-27 01:02:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6427 states to 6427 states and 14337 transitions. [2019-12-27 01:02:50,961 INFO L78 Accepts]: Start accepts. Automaton has 6427 states and 14337 transitions. Word has length 43 [2019-12-27 01:02:50,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:50,961 INFO L462 AbstractCegarLoop]: Abstraction has 6427 states and 14337 transitions. [2019-12-27 01:02:50,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:02:50,961 INFO L276 IsEmpty]: Start isEmpty. Operand 6427 states and 14337 transitions. [2019-12-27 01:02:50,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 01:02:50,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:50,972 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] [2019-12-27 01:02:50,972 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:50,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:50,972 INFO L82 PathProgramCache]: Analyzing trace with hash -93592056, now seen corresponding path program 2 times [2019-12-27 01:02:50,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:50,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798231731] [2019-12-27 01:02:50,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:51,100 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 01:02:51,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798231731] [2019-12-27 01:02:51,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:51,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:02:51,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912199658] [2019-12-27 01:02:51,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:02:51,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:51,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:02:51,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:02:51,104 INFO L87 Difference]: Start difference. First operand 6427 states and 14337 transitions. Second operand 5 states. [2019-12-27 01:02:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:51,532 INFO L93 Difference]: Finished difference Result 7135 states and 15768 transitions. [2019-12-27 01:02:51,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:02:51,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 01:02:51,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:51,542 INFO L225 Difference]: With dead ends: 7135 [2019-12-27 01:02:51,542 INFO L226 Difference]: Without dead ends: 7135 [2019-12-27 01:02:51,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:02:51,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7135 states. [2019-12-27 01:02:51,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7135 to 6941. [2019-12-27 01:02:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6941 states. [2019-12-27 01:02:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6941 states to 6941 states and 15398 transitions. [2019-12-27 01:02:51,640 INFO L78 Accepts]: Start accepts. Automaton has 6941 states and 15398 transitions. Word has length 43 [2019-12-27 01:02:51,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:51,640 INFO L462 AbstractCegarLoop]: Abstraction has 6941 states and 15398 transitions. [2019-12-27 01:02:51,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:02:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 6941 states and 15398 transitions. [2019-12-27 01:02:51,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 01:02:51,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:51,649 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] [2019-12-27 01:02:51,649 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1410522453, now seen corresponding path program 1 times [2019-12-27 01:02:51,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:51,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037213710] [2019-12-27 01:02:51,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:51,728 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 01:02:51,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037213710] [2019-12-27 01:02:51,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:51,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:02:51,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981390707] [2019-12-27 01:02:51,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:02:51,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:51,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:02:51,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:02:51,730 INFO L87 Difference]: Start difference. First operand 6941 states and 15398 transitions. Second operand 5 states. [2019-12-27 01:02:51,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:51,789 INFO L93 Difference]: Finished difference Result 5081 states and 11181 transitions. [2019-12-27 01:02:51,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:02:51,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 01:02:51,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:51,791 INFO L225 Difference]: With dead ends: 5081 [2019-12-27 01:02:51,791 INFO L226 Difference]: Without dead ends: 877 [2019-12-27 01:02:51,792 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 01:02:51,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-12-27 01:02:51,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 835. [2019-12-27 01:02:51,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2019-12-27 01:02:51,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1672 transitions. [2019-12-27 01:02:51,803 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1672 transitions. Word has length 44 [2019-12-27 01:02:51,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:51,803 INFO L462 AbstractCegarLoop]: Abstraction has 835 states and 1672 transitions. [2019-12-27 01:02:51,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:02:51,804 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1672 transitions. [2019-12-27 01:02:51,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 01:02:51,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:51,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:51,806 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:51,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:51,806 INFO L82 PathProgramCache]: Analyzing trace with hash -743639945, now seen corresponding path program 1 times [2019-12-27 01:02:51,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:51,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536774680] [2019-12-27 01:02:51,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:51,906 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 01:02:51,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536774680] [2019-12-27 01:02:51,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:51,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:02:51,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703328038] [2019-12-27 01:02:51,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:02:51,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:51,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:02:51,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:02:51,908 INFO L87 Difference]: Start difference. First operand 835 states and 1672 transitions. Second operand 8 states. [2019-12-27 01:02:52,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:52,135 INFO L93 Difference]: Finished difference Result 1530 states and 3041 transitions. [2019-12-27 01:02:52,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:02:52,135 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-27 01:02:52,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:52,137 INFO L225 Difference]: With dead ends: 1530 [2019-12-27 01:02:52,137 INFO L226 Difference]: Without dead ends: 1077 [2019-12-27 01:02:52,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:02:52,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-12-27 01:02:52,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 889. [2019-12-27 01:02:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-12-27 01:02:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1763 transitions. [2019-12-27 01:02:52,150 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1763 transitions. Word has length 59 [2019-12-27 01:02:52,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:52,150 INFO L462 AbstractCegarLoop]: Abstraction has 889 states and 1763 transitions. [2019-12-27 01:02:52,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:02:52,151 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1763 transitions. [2019-12-27 01:02:52,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 01:02:52,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:52,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:52,153 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:52,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:52,153 INFO L82 PathProgramCache]: Analyzing trace with hash 681597047, now seen corresponding path program 2 times [2019-12-27 01:02:52,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:52,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871521290] [2019-12-27 01:02:52,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:52,264 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 01:02:52,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871521290] [2019-12-27 01:02:52,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:52,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:02:52,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526757068] [2019-12-27 01:02:52,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:02:52,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:52,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:02:52,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:02:52,266 INFO L87 Difference]: Start difference. First operand 889 states and 1763 transitions. Second operand 6 states. [2019-12-27 01:02:52,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:52,694 INFO L93 Difference]: Finished difference Result 1015 states and 1989 transitions. [2019-12-27 01:02:52,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:02:52,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-27 01:02:52,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:52,696 INFO L225 Difference]: With dead ends: 1015 [2019-12-27 01:02:52,696 INFO L226 Difference]: Without dead ends: 1015 [2019-12-27 01:02:52,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:02:52,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-12-27 01:02:52,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 919. [2019-12-27 01:02:52,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2019-12-27 01:02:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1818 transitions. [2019-12-27 01:02:52,707 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1818 transitions. Word has length 59 [2019-12-27 01:02:52,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:52,707 INFO L462 AbstractCegarLoop]: Abstraction has 919 states and 1818 transitions. [2019-12-27 01:02:52,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:02:52,707 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1818 transitions. [2019-12-27 01:02:52,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 01:02:52,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:52,709 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:52,710 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:52,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:52,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1965459209, now seen corresponding path program 3 times [2019-12-27 01:02:52,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:52,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836839227] [2019-12-27 01:02:52,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:52,785 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 01:02:52,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836839227] [2019-12-27 01:02:52,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:52,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:02:52,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680481455] [2019-12-27 01:02:52,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:02:52,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:52,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:02:52,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:02:52,787 INFO L87 Difference]: Start difference. First operand 919 states and 1818 transitions. Second operand 3 states. [2019-12-27 01:02:52,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:52,801 INFO L93 Difference]: Finished difference Result 919 states and 1817 transitions. [2019-12-27 01:02:52,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:02:52,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 01:02:52,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:52,803 INFO L225 Difference]: With dead ends: 919 [2019-12-27 01:02:52,803 INFO L226 Difference]: Without dead ends: 919 [2019-12-27 01:02:52,804 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 01:02:52,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-12-27 01:02:52,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 783. [2019-12-27 01:02:52,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-12-27 01:02:52,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1569 transitions. [2019-12-27 01:02:52,816 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1569 transitions. Word has length 59 [2019-12-27 01:02:52,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:52,816 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1569 transitions. [2019-12-27 01:02:52,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:02:52,817 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1569 transitions. [2019-12-27 01:02:52,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 01:02:52,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:52,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:52,819 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:52,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:52,819 INFO L82 PathProgramCache]: Analyzing trace with hash -328419130, now seen corresponding path program 1 times [2019-12-27 01:02:52,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:52,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242579024] [2019-12-27 01:02:52,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:02:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:02:52,973 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:02:52,973 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:02:52,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd1~0_264 0) (= 0 v_~x$w_buff0~0_204) (= v_~main$tmp_guard1~0_44 0) (= |v_ULTIMATE.start_main_~#t4~0.offset_24| 0) (= v_~__unbuffered_p1_EBX~0_50 0) (= 0 v_~weak$$choice0~0_151) (= 0 v_~x$mem_tmp~0_161) (= 0 v_~x$w_buff1~0_194) (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~x$w_buff1_used~0_447) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t4~0.base_34|) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t4~0.base_34| 1)) (= 0 v_~x$w_buff0_used~0_844) (= 0 v_~x$r_buff1_thd2~0_308) (= v_~y~0_47 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t4~0.base_34| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t4~0.base_34|)) (= 0 v_~x~0_246) (= v_~x$r_buff1_thd0~0_211 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p0_EAX~0_71) (< 0 |v_#StackHeapBarrier_14|) (= v_~x$flush_delayed~0_185 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_69) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff0_thd2~0_438) (= v_~weak$$choice2~0_232 0) (= 0 v_~x$r_buff0_thd0~0_98) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t4~0.base_34| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t4~0.base_34|) |v_ULTIMATE.start_main_~#t4~0.offset_24| 0)) |v_#memory_int_17|) (= v_~x$r_buff0_thd1~0_297 0) (= 0 v_~__unbuffered_cnt~0_47))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_204, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_297, ~x$flush_delayed~0=v_~x$flush_delayed~0_185, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_16|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_264, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~x$mem_tmp~0=v_~x$mem_tmp~0_161, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_71, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_69, #length=|v_#length_19|, ULTIMATE.start_main_~#t5~0.base=|v_ULTIMATE.start_main_~#t5~0.base_23|, ~y~0=v_~y~0_47, ULTIMATE.start_main_~#t5~0.offset=|v_ULTIMATE.start_main_~#t5~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_98, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_50, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_194, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_97|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_447, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_308, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_153|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_211, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_438, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_844, ULTIMATE.start_main_~#t4~0.base=|v_ULTIMATE.start_main_~#t4~0.base_34|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_91|, ~weak$$choice0~0=v_~weak$$choice0~0_151, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_117|, ULTIMATE.start_main_~#t4~0.offset=|v_ULTIMATE.start_main_~#t4~0.offset_24|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_31|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_232, ~x~0=v_~x~0_246, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t5~0.base, ~y~0, ULTIMATE.start_main_~#t5~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t4~0.base, ULTIMATE.start_main_#t~ite62, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t4~0.offset, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 01:02:52,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (not (= |v_ULTIMATE.start_main_~#t5~0.base_12| 0)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t5~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t5~0.base_12|) |v_ULTIMATE.start_main_~#t5~0.offset_10| 1))) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t5~0.base_12|) 0) (= |v_ULTIMATE.start_main_~#t5~0.offset_10| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t5~0.base_12|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t5~0.base_12| 4) |v_#length_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t5~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t5~0.offset=|v_ULTIMATE.start_main_~#t5~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t5~0.base=|v_ULTIMATE.start_main_~#t5~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t5~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t5~0.base] because there is no mapped edge [2019-12-27 01:02:52,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] P1ENTRY-->L5-3: Formula: (and (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| 1) (= 1 v_~x$w_buff0_used~0_158) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_8) (= 1 v_~x$w_buff0~0_35) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_10) (= v_~x$w_buff1_used~0_84 v_~x$w_buff0_used~0_159) (= (mod v_~x$w_buff1_used~0_84 256) 0) (= v_P1Thread1of1ForFork1_~arg.base_8 |v_P1Thread1of1ForFork1_#in~arg.base_8|) (= v_~x$w_buff0~0_36 v_~x$w_buff1~0_51)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_159} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_8, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_8, ~x$w_buff1~0=v_~x$w_buff1~0_51, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_84, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 01:02:52,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L775-2-->L775-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1820583501 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1820583501 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff0~0_In-1820583501 |P1Thread1of1ForFork1_#t~ite28_Out-1820583501|)) (and (= ~x$w_buff1~0_In-1820583501 |P1Thread1of1ForFork1_#t~ite28_Out-1820583501|) (or .cse0 .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1820583501, ~x$w_buff1~0=~x$w_buff1~0_In-1820583501, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1820583501, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1820583501} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1820583501, ~x$w_buff1~0=~x$w_buff1~0_In-1820583501, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1820583501, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1820583501|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1820583501} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 01:02:52,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L775-4-->L776: Formula: (= v_~x~0_72 |v_P1Thread1of1ForFork1_#t~ite28_10|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_10|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_13|, ~x~0=v_~x~0_72, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 01:02:52,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~x$r_buff0_thd2~0_86 v_~x$r_buff0_thd2~0_85)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_8|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_11|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_11|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 01:02:52,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In1817943968 256)))) (or (and .cse0 (= ~x~0_In1817943968 |P1Thread1of1ForFork1_#t~ite48_Out1817943968|)) (and (= |P1Thread1of1ForFork1_#t~ite48_Out1817943968| ~x$mem_tmp~0_In1817943968) (not .cse0)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1817943968, ~x$mem_tmp~0=~x$mem_tmp~0_In1817943968, ~x~0=~x~0_In1817943968} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In1817943968, ~x$mem_tmp~0=~x$mem_tmp~0_In1817943968, ~x~0=~x~0_In1817943968, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out1817943968|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-27 01:02:52,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-815870699 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-815870699 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out-815870699| ~x$w_buff0_used~0_In-815870699)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite51_Out-815870699| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-815870699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-815870699} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-815870699|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-815870699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-815870699} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-27 01:02:52,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In239515557 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In239515557 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In239515557 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In239515557 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite52_Out239515557| 0)) (and (= |P1Thread1of1ForFork1_#t~ite52_Out239515557| ~x$w_buff1_used~0_In239515557) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In239515557, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In239515557, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In239515557, ~x$w_buff0_used~0=~x$w_buff0_used~0_In239515557} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out239515557|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In239515557, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In239515557, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In239515557, ~x$w_buff0_used~0=~x$w_buff0_used~0_In239515557} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-27 01:02:52,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-2019477861 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2019477861 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-2019477861)) (and (= ~x$r_buff0_thd2~0_In-2019477861 ~x$r_buff0_thd2~0_Out-2019477861) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2019477861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2019477861} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-2019477861|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2019477861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2019477861} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 01:02:52,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L794-->L794-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-2129421557 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-2129421557 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-2129421557 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2129421557 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite54_Out-2129421557| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite54_Out-2129421557| ~x$r_buff1_thd2~0_In-2129421557) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2129421557, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2129421557, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2129421557, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2129421557} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2129421557, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2129421557, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-2129421557|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2129421557, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2129421557} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 01:02:53,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_117 |v_P1Thread1of1ForFork1_#t~ite54_20|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_20|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_19|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 01:02:53,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In735399946 256)))) (or (and (= ~x$mem_tmp~0_In735399946 |P0Thread1of1ForFork0_#t~ite25_Out735399946|) (not .cse0)) (and .cse0 (= ~x~0_In735399946 |P0Thread1of1ForFork0_#t~ite25_Out735399946|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In735399946, ~x$mem_tmp~0=~x$mem_tmp~0_In735399946, ~x~0=~x~0_In735399946} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out735399946|, ~x$flush_delayed~0=~x$flush_delayed~0_In735399946, ~x$mem_tmp~0=~x$mem_tmp~0_In735399946, ~x~0=~x~0_In735399946} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-27 01:02:53,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= |v_P0Thread1of1ForFork0_#t~ite25_20| v_~x~0_123) (= v_~x$flush_delayed~0_78 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_19|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_123} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 01:02:53,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L819-->L821-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_30 256)) (= (mod v_~x$w_buff0_used~0_209 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 01:02:53,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [928] [928] L821-2-->L821-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite58_Out734214318| |ULTIMATE.start_main_#t~ite57_Out734214318|)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In734214318 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In734214318 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite57_Out734214318| ~x$w_buff1~0_In734214318) (not .cse1) (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite57_Out734214318| ~x~0_In734214318) .cse0 (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In734214318, ~x$w_buff1_used~0=~x$w_buff1_used~0_In734214318, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In734214318, ~x~0=~x~0_In734214318} OutVars{~x$w_buff1~0=~x$w_buff1~0_In734214318, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out734214318|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out734214318|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In734214318, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In734214318, ~x~0=~x~0_In734214318} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-27 01:02:53,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1649162527 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1649162527 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite59_Out1649162527| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite59_Out1649162527| ~x$w_buff0_used~0_In1649162527)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1649162527, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1649162527} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1649162527, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1649162527|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1649162527} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 01:02:53,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L823-->L823-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1022321450 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1022321450 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1022321450 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1022321450 256)))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out1022321450| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite60_Out1022321450| ~x$w_buff1_used~0_In1022321450)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1022321450, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1022321450, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1022321450, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1022321450} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1022321450, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1022321450|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1022321450, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1022321450, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1022321450} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 01:02:53,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1766594111 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1766594111 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In1766594111 |ULTIMATE.start_main_#t~ite61_Out1766594111|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite61_Out1766594111|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1766594111, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1766594111} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1766594111, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1766594111|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1766594111} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 01:02:53,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1522052568 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1522052568 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1522052568 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1522052568 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In1522052568 |ULTIMATE.start_main_#t~ite62_Out1522052568|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out1522052568|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1522052568, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1522052568, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1522052568, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1522052568} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1522052568|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1522052568, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1522052568, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1522052568, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1522052568} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 01:02:53,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p0_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_27 0) (= 1 v_~__unbuffered_p1_EAX~0_38) (= v_~__unbuffered_p0_EBX~0_31 0) (= v_~main$tmp_guard1~0_21 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~x$r_buff1_thd0~0_183 |v_ULTIMATE.start_main_#t~ite62_50|)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_50|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_49|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:02:53,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:02:53 BasicIcfg [2019-12-27 01:02:53,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:02:53,144 INFO L168 Benchmark]: Toolchain (without parser) took 36846.24 ms. Allocated memory was 139.5 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 101.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 01:02:53,145 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 01:02:53,145 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.15 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 101.0 MB in the beginning and 157.3 MB in the end (delta: -56.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 01:02:53,146 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.63 ms. Allocated memory is still 203.9 MB. Free memory was 156.7 MB in the beginning and 154.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:02:53,146 INFO L168 Benchmark]: Boogie Preprocessor took 40.96 ms. Allocated memory is still 203.9 MB. Free memory was 154.1 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:02:53,147 INFO L168 Benchmark]: RCFGBuilder took 926.47 ms. Allocated memory is still 203.9 MB. Free memory was 151.5 MB in the beginning and 99.0 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 7.1 GB. [2019-12-27 01:02:53,148 INFO L168 Benchmark]: TraceAbstraction took 35028.94 ms. Allocated memory was 203.9 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 98.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 01:02:53,151 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 766.15 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 101.0 MB in the beginning and 157.3 MB in the end (delta: -56.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.63 ms. Allocated memory is still 203.9 MB. Free memory was 156.7 MB in the beginning and 154.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.96 ms. Allocated memory is still 203.9 MB. Free memory was 154.1 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 926.47 ms. Allocated memory is still 203.9 MB. Free memory was 151.5 MB in the beginning and 99.0 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35028.94 ms. Allocated memory was 203.9 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 98.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 179 ProgramPointsBefore, 104 ProgramPointsAfterwards, 228 TransitionsBefore, 128 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9002 VarBasedMoverChecksPositive, 281 VarBasedMoverChecksNegative, 68 SemBasedMoverChecksPositive, 297 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 123043 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t4, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] FCALL, FORK 0 pthread_create(&t5, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 y = 1 [L732] 1 __unbuffered_p0_EAX = y [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L822] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L823] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L824] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 34.6s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3727 SDtfs, 3121 SDslu, 5673 SDs, 0 SdLazy, 2361 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59256occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 45879 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 636 NumberOfCodeBlocks, 636 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 558 ConstructedInterpolants, 0 QuantifiedInterpolants, 62838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...