/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix048_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:14:39,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:14:39,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:14:39,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:14:39,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:14:39,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:14:39,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:14:39,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:14:39,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:14:39,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:14:39,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:14:39,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:14:39,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:14:39,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:14:39,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:14:39,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:14:39,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:14:39,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:14:39,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:14:39,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:14:39,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:14:39,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:14:39,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:14:39,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:14:39,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:14:39,996 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:14:39,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:14:39,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:14:40,000 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:14:40,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:14:40,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:14:40,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:14:40,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:14:40,007 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:14:40,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:14:40,011 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:14:40,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:14:40,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:14:40,012 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:14:40,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:14:40,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:14:40,017 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:14:40,041 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:14:40,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:14:40,043 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:14:40,044 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:14:40,044 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:14:40,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:14:40,044 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:14:40,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:14:40,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:14:40,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:14:40,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:14:40,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:14:40,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:14:40,047 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:14:40,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:14:40,047 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:14:40,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:14:40,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:14:40,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:14:40,048 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:14:40,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:14:40,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:14:40,049 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:14:40,049 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:14:40,049 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:14:40,049 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:14:40,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:14:40,050 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:14:40,050 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:14:40,050 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:14:40,051 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:14:40,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:14:40,356 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:14:40,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:14:40,361 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:14:40,361 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:14:40,362 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix048_pso.opt.i [2019-12-27 17:14:40,425 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc8fab64c/d2a933009b1c4c73b3d2de2c3ca794f6/FLAG94f5ce6e2 [2019-12-27 17:14:40,944 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:14:40,945 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix048_pso.opt.i [2019-12-27 17:14:40,964 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc8fab64c/d2a933009b1c4c73b3d2de2c3ca794f6/FLAG94f5ce6e2 [2019-12-27 17:14:41,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc8fab64c/d2a933009b1c4c73b3d2de2c3ca794f6 [2019-12-27 17:14:41,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:14:41,281 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:14:41,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:14:41,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:14:41,287 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:14:41,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:14:41" (1/1) ... [2019-12-27 17:14:41,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e265609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:41, skipping insertion in model container [2019-12-27 17:14:41,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:14:41" (1/1) ... [2019-12-27 17:14:41,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:14:41,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:14:41,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:14:41,941 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:14:42,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:14:42,097 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:14:42,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:42 WrapperNode [2019-12-27 17:14:42,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:14:42,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:14:42,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:14:42,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:14:42,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:42" (1/1) ... [2019-12-27 17:14:42,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:42" (1/1) ... [2019-12-27 17:14:42,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:14:42,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:14:42,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:14:42,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:14:42,168 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:42" (1/1) ... [2019-12-27 17:14:42,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:42" (1/1) ... [2019-12-27 17:14:42,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:42" (1/1) ... [2019-12-27 17:14:42,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:42" (1/1) ... [2019-12-27 17:14:42,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:42" (1/1) ... [2019-12-27 17:14:42,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:42" (1/1) ... [2019-12-27 17:14:42,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:42" (1/1) ... [2019-12-27 17:14:42,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:14:42,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:14:42,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:14:42,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:14:42,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:14:42,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:14:42,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:14:42,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:14:42,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:14:42,273 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:14:42,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:14:42,273 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:14:42,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:14:42,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:14:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:14:42,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:14:42,278 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:14:42,969 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:14:42,969 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:14:42,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:14:42 BoogieIcfgContainer [2019-12-27 17:14:42,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:14:42,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:14:42,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:14:42,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:14:42,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:14:41" (1/3) ... [2019-12-27 17:14:42,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee0c5a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:14:42, skipping insertion in model container [2019-12-27 17:14:42,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:42" (2/3) ... [2019-12-27 17:14:42,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee0c5a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:14:42, skipping insertion in model container [2019-12-27 17:14:42,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:14:42" (3/3) ... [2019-12-27 17:14:42,981 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_pso.opt.i [2019-12-27 17:14:42,992 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:14:42,993 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:14:43,004 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:14:43,005 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:14:43,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,044 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,045 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,045 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,046 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,046 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,056 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,056 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,106 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,106 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,106 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,112 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,115 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:43,130 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:14:43,151 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:14:43,151 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:14:43,151 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:14:43,151 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:14:43,151 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:14:43,152 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:14:43,152 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:14:43,152 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:14:43,168 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 17:14:43,171 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 17:14:43,256 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 17:14:43,256 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:14:43,272 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:14:43,291 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 17:14:43,352 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 17:14:43,352 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:14:43,361 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:14:43,380 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 17:14:43,381 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:14:48,409 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 17:14:48,519 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 17:14:48,612 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-27 17:14:48,612 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-27 17:14:48,615 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-27 17:14:49,047 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-27 17:14:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-27 17:14:49,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:14:49,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:49,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:14:49,058 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:49,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:49,065 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-27 17:14:49,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:49,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040956573] [2019-12-27 17:14:49,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:49,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040956573] [2019-12-27 17:14:49,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:49,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:14:49,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1931656016] [2019-12-27 17:14:49,366 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:49,371 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:49,384 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:14:49,384 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:49,388 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:14:49,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:14:49,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:49,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:14:49,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:14:49,408 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-27 17:14:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:49,690 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-27 17:14:49,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:14:49,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:14:49,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:49,775 INFO L225 Difference]: With dead ends: 8074 [2019-12-27 17:14:49,775 INFO L226 Difference]: Without dead ends: 7606 [2019-12-27 17:14:49,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:14:49,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-27 17:14:50,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-27 17:14:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-27 17:14:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-27 17:14:50,381 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-27 17:14:50,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:50,382 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-27 17:14:50,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:14:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-27 17:14:50,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:14:50,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:50,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:14:50,386 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:50,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:50,386 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-27 17:14:50,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:50,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118653120] [2019-12-27 17:14:50,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:50,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118653120] [2019-12-27 17:14:50,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:50,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:14:50,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [724177186] [2019-12-27 17:14:50,519 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:50,521 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:50,525 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:14:50,526 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:50,526 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:14:50,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:14:50,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:50,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:14:50,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:14:50,531 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-27 17:14:51,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:51,006 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-27 17:14:51,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:14:51,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:14:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:51,091 INFO L225 Difference]: With dead ends: 11630 [2019-12-27 17:14:51,092 INFO L226 Difference]: Without dead ends: 11623 [2019-12-27 17:14:51,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:14:51,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-27 17:14:52,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-27 17:14:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-27 17:14:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-27 17:14:52,066 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-27 17:14:52,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:52,067 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-27 17:14:52,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:14:52,067 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-27 17:14:52,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:14:52,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:52,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:14:52,074 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:52,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:52,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-27 17:14:52,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:52,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904276731] [2019-12-27 17:14:52,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:52,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904276731] [2019-12-27 17:14:52,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:52,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:14:52,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1216085585] [2019-12-27 17:14:52,190 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:52,193 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:52,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 17:14:52,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:52,196 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:14:52,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:14:52,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:52,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:14:52,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:14:52,198 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-27 17:14:52,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:52,562 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-27 17:14:52,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:14:52,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 17:14:52,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:52,622 INFO L225 Difference]: With dead ends: 14471 [2019-12-27 17:14:52,622 INFO L226 Difference]: Without dead ends: 14471 [2019-12-27 17:14:52,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:14:52,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-27 17:14:52,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-27 17:14:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-27 17:14:53,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-27 17:14:53,164 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-27 17:14:53,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:53,165 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-27 17:14:53,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:14:53,165 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-27 17:14:53,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:14:53,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:53,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:14:53,169 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:53,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:53,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-27 17:14:53,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:53,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471724291] [2019-12-27 17:14:53,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:53,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471724291] [2019-12-27 17:14:53,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:53,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:14:53,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1947273356] [2019-12-27 17:14:53,303 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:53,305 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:53,308 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 17:14:53,308 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:53,312 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:14:53,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:14:53,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:53,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:14:53,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:14:53,313 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 4 states. [2019-12-27 17:14:53,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:53,356 INFO L93 Difference]: Finished difference Result 2200 states and 5503 transitions. [2019-12-27 17:14:53,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:14:53,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 17:14:53,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:53,361 INFO L225 Difference]: With dead ends: 2200 [2019-12-27 17:14:53,361 INFO L226 Difference]: Without dead ends: 1563 [2019-12-27 17:14:53,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:14:53,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-12-27 17:14:53,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1547. [2019-12-27 17:14:53,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-12-27 17:14:53,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 3457 transitions. [2019-12-27 17:14:53,391 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 3457 transitions. Word has length 16 [2019-12-27 17:14:53,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:53,392 INFO L462 AbstractCegarLoop]: Abstraction has 1547 states and 3457 transitions. [2019-12-27 17:14:53,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:14:53,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 3457 transitions. [2019-12-27 17:14:53,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 17:14:53,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:53,394 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:14:53,394 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:53,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:53,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-27 17:14:53,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:53,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259269679] [2019-12-27 17:14:53,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:53,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259269679] [2019-12-27 17:14:53,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:53,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:14:53,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1882948944] [2019-12-27 17:14:53,510 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:53,514 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:53,519 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 24 transitions. [2019-12-27 17:14:53,519 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:53,520 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:14:53,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:14:53,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:53,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:14:53,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:14:53,521 INFO L87 Difference]: Start difference. First operand 1547 states and 3457 transitions. Second operand 6 states. [2019-12-27 17:14:53,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:53,991 INFO L93 Difference]: Finished difference Result 2337 states and 5001 transitions. [2019-12-27 17:14:53,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:14:53,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 17:14:53,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:53,997 INFO L225 Difference]: With dead ends: 2337 [2019-12-27 17:14:53,997 INFO L226 Difference]: Without dead ends: 2285 [2019-12-27 17:14:53,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:14:54,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2019-12-27 17:14:54,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 1625. [2019-12-27 17:14:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2019-12-27 17:14:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 3604 transitions. [2019-12-27 17:14:54,032 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 3604 transitions. Word has length 24 [2019-12-27 17:14:54,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:54,033 INFO L462 AbstractCegarLoop]: Abstraction has 1625 states and 3604 transitions. [2019-12-27 17:14:54,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:14:54,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 3604 transitions. [2019-12-27 17:14:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 17:14:54,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:54,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:14:54,035 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:54,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:54,036 INFO L82 PathProgramCache]: Analyzing trace with hash 2063536940, now seen corresponding path program 1 times [2019-12-27 17:14:54,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:54,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704209476] [2019-12-27 17:14:54,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:54,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 17:14:54,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704209476] [2019-12-27 17:14:54,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:54,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:14:54,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1990139339] [2019-12-27 17:14:54,138 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:54,144 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:54,153 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 17:14:54,153 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:54,286 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:14:54,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:14:54,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:54,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:14:54,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:14:54,288 INFO L87 Difference]: Start difference. First operand 1625 states and 3604 transitions. Second operand 8 states. [2019-12-27 17:14:55,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:55,189 INFO L93 Difference]: Finished difference Result 2383 states and 5182 transitions. [2019-12-27 17:14:55,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:14:55,190 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-12-27 17:14:55,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:55,197 INFO L225 Difference]: With dead ends: 2383 [2019-12-27 17:14:55,197 INFO L226 Difference]: Without dead ends: 2383 [2019-12-27 17:14:55,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:14:55,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-12-27 17:14:55,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2084. [2019-12-27 17:14:55,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2019-12-27 17:14:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 4594 transitions. [2019-12-27 17:14:55,239 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 4594 transitions. Word has length 26 [2019-12-27 17:14:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:55,239 INFO L462 AbstractCegarLoop]: Abstraction has 2084 states and 4594 transitions. [2019-12-27 17:14:55,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:14:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 4594 transitions. [2019-12-27 17:14:55,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:14:55,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:55,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:14:55,243 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:55,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:55,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-12-27 17:14:55,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:55,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342050399] [2019-12-27 17:14:55,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:55,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342050399] [2019-12-27 17:14:55,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:55,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:14:55,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1587981413] [2019-12-27 17:14:55,376 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:55,382 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:55,394 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 71 transitions. [2019-12-27 17:14:55,395 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:55,413 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:14:55,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:14:55,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:55,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:14:55,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:14:55,415 INFO L87 Difference]: Start difference. First operand 2084 states and 4594 transitions. Second operand 6 states. [2019-12-27 17:14:55,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:55,464 INFO L93 Difference]: Finished difference Result 1286 states and 2707 transitions. [2019-12-27 17:14:55,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:14:55,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 17:14:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:55,467 INFO L225 Difference]: With dead ends: 1286 [2019-12-27 17:14:55,468 INFO L226 Difference]: Without dead ends: 1165 [2019-12-27 17:14:55,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:14:55,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-12-27 17:14:55,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1076. [2019-12-27 17:14:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-12-27 17:14:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 2287 transitions. [2019-12-27 17:14:55,487 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 2287 transitions. Word has length 27 [2019-12-27 17:14:55,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:55,488 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 2287 transitions. [2019-12-27 17:14:55,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:14:55,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 2287 transitions. [2019-12-27 17:14:55,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 17:14:55,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:55,496 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] [2019-12-27 17:14:55,496 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:55,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:55,496 INFO L82 PathProgramCache]: Analyzing trace with hash -44666522, now seen corresponding path program 1 times [2019-12-27 17:14:55,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:55,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143172026] [2019-12-27 17:14:55,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:55,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143172026] [2019-12-27 17:14:55,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:55,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:14:55,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1336964754] [2019-12-27 17:14:55,603 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:55,616 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:55,663 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 101 transitions. [2019-12-27 17:14:55,663 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:55,665 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:14:55,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:14:55,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:55,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:14:55,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:14:55,667 INFO L87 Difference]: Start difference. First operand 1076 states and 2287 transitions. Second operand 4 states. [2019-12-27 17:14:55,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:55,686 INFO L93 Difference]: Finished difference Result 1807 states and 3865 transitions. [2019-12-27 17:14:55,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:14:55,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-27 17:14:55,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:55,689 INFO L225 Difference]: With dead ends: 1807 [2019-12-27 17:14:55,689 INFO L226 Difference]: Without dead ends: 800 [2019-12-27 17:14:55,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:14:55,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-12-27 17:14:55,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2019-12-27 17:14:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-12-27 17:14:55,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1708 transitions. [2019-12-27 17:14:55,702 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1708 transitions. Word has length 50 [2019-12-27 17:14:55,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:55,703 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1708 transitions. [2019-12-27 17:14:55,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:14:55,703 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1708 transitions. [2019-12-27 17:14:55,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 17:14:55,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:55,705 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] [2019-12-27 17:14:55,706 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:55,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:55,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1290466760, now seen corresponding path program 2 times [2019-12-27 17:14:55,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:55,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502370140] [2019-12-27 17:14:55,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:55,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:55,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502370140] [2019-12-27 17:14:55,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:55,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:14:55,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1707512932] [2019-12-27 17:14:55,815 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:55,828 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:55,882 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 110 transitions. [2019-12-27 17:14:55,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:55,938 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:14:55,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:14:55,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:55,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:14:55,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:14:55,939 INFO L87 Difference]: Start difference. First operand 800 states and 1708 transitions. Second operand 9 states. [2019-12-27 17:14:56,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:56,316 INFO L93 Difference]: Finished difference Result 1394 states and 2892 transitions. [2019-12-27 17:14:56,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:14:56,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-12-27 17:14:56,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:56,320 INFO L225 Difference]: With dead ends: 1394 [2019-12-27 17:14:56,320 INFO L226 Difference]: Without dead ends: 931 [2019-12-27 17:14:56,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:14:56,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-27 17:14:56,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 792. [2019-12-27 17:14:56,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-12-27 17:14:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1676 transitions. [2019-12-27 17:14:56,335 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1676 transitions. Word has length 50 [2019-12-27 17:14:56,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:56,336 INFO L462 AbstractCegarLoop]: Abstraction has 792 states and 1676 transitions. [2019-12-27 17:14:56,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:14:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1676 transitions. [2019-12-27 17:14:56,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 17:14:56,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:56,338 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] [2019-12-27 17:14:56,339 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:56,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:56,339 INFO L82 PathProgramCache]: Analyzing trace with hash 50774886, now seen corresponding path program 3 times [2019-12-27 17:14:56,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:56,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957708062] [2019-12-27 17:14:56,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:56,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:56,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957708062] [2019-12-27 17:14:56,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:56,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:14:56,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1102900490] [2019-12-27 17:14:56,418 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:56,435 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:56,490 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 112 transitions. [2019-12-27 17:14:56,490 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:56,492 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:14:56,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:14:56,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:56,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:14:56,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:14:56,493 INFO L87 Difference]: Start difference. First operand 792 states and 1676 transitions. Second operand 3 states. [2019-12-27 17:14:56,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:56,545 INFO L93 Difference]: Finished difference Result 1051 states and 2216 transitions. [2019-12-27 17:14:56,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:14:56,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 17:14:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:56,548 INFO L225 Difference]: With dead ends: 1051 [2019-12-27 17:14:56,548 INFO L226 Difference]: Without dead ends: 1051 [2019-12-27 17:14:56,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:14:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-12-27 17:14:56,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 849. [2019-12-27 17:14:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-12-27 17:14:56,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1815 transitions. [2019-12-27 17:14:56,564 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1815 transitions. Word has length 50 [2019-12-27 17:14:56,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:56,564 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1815 transitions. [2019-12-27 17:14:56,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:14:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1815 transitions. [2019-12-27 17:14:56,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:14:56,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:56,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:14:56,568 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:56,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:56,568 INFO L82 PathProgramCache]: Analyzing trace with hash 925752847, now seen corresponding path program 1 times [2019-12-27 17:14:56,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:56,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659298523] [2019-12-27 17:14:56,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:56,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659298523] [2019-12-27 17:14:56,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:56,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:14:56,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [179908043] [2019-12-27 17:14:56,667 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:56,682 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:56,740 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 99 transitions. [2019-12-27 17:14:56,740 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:56,741 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:14:56,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:14:56,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:56,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:14:56,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:14:56,742 INFO L87 Difference]: Start difference. First operand 849 states and 1815 transitions. Second operand 3 states. [2019-12-27 17:14:56,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:56,756 INFO L93 Difference]: Finished difference Result 848 states and 1813 transitions. [2019-12-27 17:14:56,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:14:56,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 17:14:56,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:56,761 INFO L225 Difference]: With dead ends: 848 [2019-12-27 17:14:56,761 INFO L226 Difference]: Without dead ends: 848 [2019-12-27 17:14:56,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:14:56,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-12-27 17:14:56,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 754. [2019-12-27 17:14:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-27 17:14:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-27 17:14:56,783 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-27 17:14:56,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:56,784 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-27 17:14:56,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:14:56,785 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-27 17:14:56,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:14:56,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:56,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:14:56,788 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:56,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:56,788 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-27 17:14:56,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:56,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822536838] [2019-12-27 17:14:56,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:14:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:14:57,024 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:14:57,024 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:14:57,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1287~0.base_40|) 0) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1287~0.base_40|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= (store .cse0 |v_ULTIMATE.start_main_~#t1287~0.base_40| 1) |v_#valid_65|) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1287~0.base_40| 4)) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= 0 |v_ULTIMATE.start_main_~#t1287~0.offset_27|) (= v_~y$r_buff1_thd1~0_115 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1287~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1287~0.base_40|) |v_ULTIMATE.start_main_~#t1287~0.offset_27| 0)) |v_#memory_int_17|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_~#t1287~0.offset=|v_ULTIMATE.start_main_~#t1287~0.offset_27|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1287~0.base=|v_ULTIMATE.start_main_~#t1287~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_~#t1288~0.base=|v_ULTIMATE.start_main_~#t1288~0.base_41|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ULTIMATE.start_main_~#t1288~0.offset=|v_ULTIMATE.start_main_~#t1288~0.offset_27|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1287~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1287~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1288~0.base, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1288~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:14:57,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1288~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t1288~0.base_13| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1288~0.base_13| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1288~0.base_13|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1288~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1288~0.base_13|) |v_ULTIMATE.start_main_~#t1288~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1288~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1288~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1288~0.base=|v_ULTIMATE.start_main_~#t1288~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1288~0.offset=|v_ULTIMATE.start_main_~#t1288~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1288~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1288~0.offset] because there is no mapped edge [2019-12-27 17:14:57,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff0_thd1~0_Out-196612460 1) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-196612460 0)) (= ~x~0_In-196612460 ~__unbuffered_p0_EAX~0_Out-196612460) (= ~y$r_buff1_thd0~0_Out-196612460 ~y$r_buff0_thd0~0_In-196612460) (= ~y$r_buff0_thd1~0_In-196612460 ~y$r_buff1_thd1~0_Out-196612460) (= ~y$r_buff1_thd2~0_Out-196612460 ~y$r_buff0_thd2~0_In-196612460)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-196612460, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-196612460, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-196612460, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-196612460, ~x~0=~x~0_In-196612460} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-196612460, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-196612460, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-196612460, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-196612460, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-196612460, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-196612460, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-196612460, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-196612460, ~x~0=~x~0_In-196612460} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 17:14:57,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1811947452 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1811947452 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1811947452|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1811947452 |P0Thread1of1ForFork0_#t~ite5_Out-1811947452|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1811947452, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1811947452} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1811947452|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1811947452, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1811947452} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:14:57,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1314369236 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1314369236 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In1314369236 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1314369236 256)) (and (= 0 (mod ~y$w_buff1_used~0_In1314369236 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite20_Out1314369236| |P1Thread1of1ForFork1_#t~ite21_Out1314369236|) (= |P1Thread1of1ForFork1_#t~ite20_Out1314369236| ~y$w_buff0_used~0_In1314369236)) (and (= |P1Thread1of1ForFork1_#t~ite20_In1314369236| |P1Thread1of1ForFork1_#t~ite20_Out1314369236|) (= |P1Thread1of1ForFork1_#t~ite21_Out1314369236| ~y$w_buff0_used~0_In1314369236) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1314369236, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1314369236, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1314369236|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1314369236, ~weak$$choice2~0=~weak$$choice2~0_In1314369236, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1314369236} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1314369236, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1314369236, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1314369236|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1314369236, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1314369236|, ~weak$$choice2~0=~weak$$choice2~0_In1314369236, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1314369236} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 17:14:57,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1489802499 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1489802499 256))) (.cse4 (= (mod ~y$w_buff0_used~0_In1489802499 256) 0)) (.cse5 (= 0 (mod ~y$r_buff1_thd2~0_In1489802499 256))) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In1489802499 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite24_Out1489802499| |P1Thread1of1ForFork1_#t~ite23_Out1489802499|))) (or (let ((.cse3 (not .cse6))) (and .cse0 .cse1 (= |P1Thread1of1ForFork1_#t~ite22_Out1489802499| |P1Thread1of1ForFork1_#t~ite23_Out1489802499|) (= |P1Thread1of1ForFork1_#t~ite22_Out1489802499| 0) (or (not .cse2) .cse3) (not .cse4) (or (not .cse5) .cse3))) (and (= |P1Thread1of1ForFork1_#t~ite22_In1489802499| |P1Thread1of1ForFork1_#t~ite22_Out1489802499|) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In1489802499| |P1Thread1of1ForFork1_#t~ite23_Out1489802499|) (= |P1Thread1of1ForFork1_#t~ite24_Out1489802499| ~y$w_buff1_used~0_In1489802499)) (and .cse0 (or (and .cse6 .cse2) .cse4 (and .cse5 .cse6)) (= ~y$w_buff1_used~0_In1489802499 |P1Thread1of1ForFork1_#t~ite23_Out1489802499|) .cse1))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1489802499, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1489802499, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1489802499, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1489802499|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In1489802499|, ~weak$$choice2~0=~weak$$choice2~0_In1489802499, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1489802499} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1489802499, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1489802499, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1489802499, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1489802499|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1489802499|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out1489802499|, ~weak$$choice2~0=~weak$$choice2~0_In1489802499, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1489802499} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 17:14:57,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-2031968153 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-2031968153 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2031968153 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-2031968153 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-2031968153|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-2031968153| ~y$w_buff1_used~0_In-2031968153)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2031968153, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2031968153, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2031968153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2031968153} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2031968153|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2031968153, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2031968153, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2031968153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2031968153} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:14:57,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1690148816 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1690148816 256)))) (or (and (= ~y$r_buff0_thd1~0_In-1690148816 ~y$r_buff0_thd1~0_Out-1690148816) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out-1690148816) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1690148816, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1690148816} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1690148816, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1690148816|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1690148816} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:14:57,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In2126823705 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In2126823705 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In2126823705 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In2126823705 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out2126823705| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out2126823705| ~y$r_buff1_thd1~0_In2126823705) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2126823705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2126823705, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2126823705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2126823705} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2126823705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2126823705, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2126823705|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2126823705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2126823705} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:14:57,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:14:57,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1726486106 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-1726486106| |P1Thread1of1ForFork1_#t~ite30_Out-1726486106|) (= |P1Thread1of1ForFork1_#t~ite29_Out-1726486106| ~y$r_buff1_thd2~0_In-1726486106) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1726486106 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1726486106 256))) (and (= (mod ~y$r_buff1_thd2~0_In-1726486106 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1726486106 256))))) (and (= ~y$r_buff1_thd2~0_In-1726486106 |P1Thread1of1ForFork1_#t~ite30_Out-1726486106|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-1726486106| |P1Thread1of1ForFork1_#t~ite29_Out-1726486106|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1726486106, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1726486106|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1726486106, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1726486106, ~weak$$choice2~0=~weak$$choice2~0_In-1726486106, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1726486106} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1726486106, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1726486106|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1726486106|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1726486106, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1726486106, ~weak$$choice2~0=~weak$$choice2~0_In-1726486106, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1726486106} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 17:14:57,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 17:14:57,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-924027957 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-924027957 256) 0))) (or (and (= ~y$w_buff1~0_In-924027957 |P1Thread1of1ForFork1_#t~ite32_Out-924027957|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-924027957 |P1Thread1of1ForFork1_#t~ite32_Out-924027957|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-924027957, ~y$w_buff1~0=~y$w_buff1~0_In-924027957, ~y~0=~y~0_In-924027957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-924027957} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-924027957, ~y$w_buff1~0=~y$w_buff1~0_In-924027957, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-924027957|, ~y~0=~y~0_In-924027957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-924027957} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 17:14:57,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 17:14:57,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In488410477 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In488410477 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out488410477| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out488410477| ~y$w_buff0_used~0_In488410477) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In488410477, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In488410477} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In488410477, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In488410477, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out488410477|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 17:14:57,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-1940759474 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1940759474 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1940759474 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1940759474 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1940759474 |P1Thread1of1ForFork1_#t~ite35_Out-1940759474|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1940759474|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1940759474, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1940759474, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1940759474, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1940759474} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1940759474, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1940759474, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1940759474, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1940759474|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1940759474} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 17:14:57,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1691234303 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1691234303 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1691234303| ~y$r_buff0_thd2~0_In-1691234303) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1691234303| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1691234303, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1691234303} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1691234303, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1691234303, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1691234303|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 17:14:57,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2090316926 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-2090316926 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-2090316926 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-2090316926 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-2090316926| 0)) (and (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-2090316926 |P1Thread1of1ForFork1_#t~ite37_Out-2090316926|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2090316926, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2090316926, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2090316926, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2090316926} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2090316926, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2090316926, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2090316926, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-2090316926|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2090316926} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 17:14:57,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 17:14:57,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 17:14:57,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:14:57,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-231576953 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-231576953 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-231576953| ~y$w_buff1~0_In-231576953) (not .cse0) (not .cse1)) (and (= ~y~0_In-231576953 |ULTIMATE.start_main_#t~ite40_Out-231576953|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-231576953, ~y~0=~y~0_In-231576953, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-231576953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-231576953} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-231576953|, ~y$w_buff1~0=~y$w_buff1~0_In-231576953, ~y~0=~y~0_In-231576953, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-231576953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-231576953} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 17:14:57,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 17:14:57,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1985592263 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1985592263 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out1985592263| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1985592263 |ULTIMATE.start_main_#t~ite42_Out1985592263|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1985592263, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1985592263} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1985592263, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1985592263, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1985592263|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:14:57,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1046800782 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1046800782 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1046800782 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1046800782 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out1046800782| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1046800782| ~y$w_buff1_used~0_In1046800782) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1046800782, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1046800782, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1046800782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1046800782} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1046800782, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1046800782, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1046800782|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1046800782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1046800782} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 17:14:57,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In524239560 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In524239560 256)))) (or (and (= ~y$r_buff0_thd0~0_In524239560 |ULTIMATE.start_main_#t~ite44_Out524239560|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out524239560|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In524239560, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In524239560} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In524239560, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In524239560, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out524239560|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 17:14:57,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In974339300 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In974339300 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In974339300 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In974339300 256)))) (or (and (= ~y$r_buff1_thd0~0_In974339300 |ULTIMATE.start_main_#t~ite45_Out974339300|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out974339300|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In974339300, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In974339300, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In974339300, ~y$w_buff1_used~0=~y$w_buff1_used~0_In974339300} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In974339300, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In974339300, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In974339300, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out974339300|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In974339300} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 17:14:57,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:14:57,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:14:57 BasicIcfg [2019-12-27 17:14:57,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:14:57,174 INFO L168 Benchmark]: Toolchain (without parser) took 15894.15 ms. Allocated memory was 138.9 MB in the beginning and 597.2 MB in the end (delta: 458.2 MB). Free memory was 100.9 MB in the beginning and 152.9 MB in the end (delta: -52.1 MB). Peak memory consumption was 406.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:14:57,178 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 17:14:57,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 815.73 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 157.7 MB in the end (delta: -57.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:14:57,179 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.10 ms. Allocated memory is still 202.9 MB. Free memory was 157.7 MB in the beginning and 155.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 17:14:57,184 INFO L168 Benchmark]: Boogie Preprocessor took 37.74 ms. Allocated memory is still 202.9 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:14:57,184 INFO L168 Benchmark]: RCFGBuilder took 774.70 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 108.2 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:14:57,186 INFO L168 Benchmark]: TraceAbstraction took 14200.20 ms. Allocated memory was 202.9 MB in the beginning and 597.2 MB in the end (delta: 394.3 MB). Free memory was 108.2 MB in the beginning and 152.9 MB in the end (delta: -44.7 MB). Peak memory consumption was 349.5 MB. Max. memory is 7.1 GB. [2019-12-27 17:14:57,191 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 815.73 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 157.7 MB in the end (delta: -57.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.10 ms. Allocated memory is still 202.9 MB. Free memory was 157.7 MB in the beginning and 155.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 37.74 ms. Allocated memory is still 202.9 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 774.70 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 108.2 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14200.20 ms. Allocated memory was 202.9 MB in the beginning and 597.2 MB in the end (delta: 394.3 MB). Free memory was 108.2 MB in the beginning and 152.9 MB in the end (delta: -44.7 MB). Peak memory consumption was 349.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1287, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1288, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.8s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1317 SDtfs, 1482 SDslu, 2811 SDs, 0 SdLazy, 1619 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 5818 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 311 ConstructedInterpolants, 0 QuantifiedInterpolants, 32743 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...