/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:09:53,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:09:53,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:09:53,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:09:53,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:09:53,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:09:53,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:09:53,147 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:09:53,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:09:53,149 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:09:53,150 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:09:53,151 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:09:53,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:09:53,152 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:09:53,153 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:09:53,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:09:53,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:09:53,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:09:53,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:09:53,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:09:53,167 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:09:53,168 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:09:53,169 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:09:53,170 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:09:53,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:09:53,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:09:53,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:09:53,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:09:53,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:09:53,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:09:53,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:09:53,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:09:53,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:09:53,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:09:53,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:09:53,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:09:53,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:09:53,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:09:53,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:09:53,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:09:53,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:09:53,182 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:09:53,195 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:09:53,196 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:09:53,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:09:53,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:09:53,197 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:09:53,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:09:53,198 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:09:53,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:09:53,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:09:53,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:09:53,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:09:53,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:09:53,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:09:53,199 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:09:53,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:09:53,199 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:09:53,200 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:09:53,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:09:53,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:09:53,200 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:09:53,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:09:53,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:09:53,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:09:53,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:09:53,201 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:09:53,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:09:53,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:09:53,202 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:09:53,202 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:09:53,476 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:09:53,497 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:09:53,501 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:09:53,503 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:09:53,503 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:09:53,504 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_pso.opt.i [2019-12-18 18:09:53,577 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4922b4f/861d625a40444908b0217df5979b2c51/FLAG90f79a9f4 [2019-12-18 18:09:54,152 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:09:54,156 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_pso.opt.i [2019-12-18 18:09:54,178 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4922b4f/861d625a40444908b0217df5979b2c51/FLAG90f79a9f4 [2019-12-18 18:09:54,412 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4922b4f/861d625a40444908b0217df5979b2c51 [2019-12-18 18:09:54,422 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:09:54,424 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:09:54,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:09:54,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:09:54,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:09:54,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:09:54" (1/1) ... [2019-12-18 18:09:54,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10ce2774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:54, skipping insertion in model container [2019-12-18 18:09:54,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:09:54" (1/1) ... [2019-12-18 18:09:54,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:09:54,498 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:09:55,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:09:55,115 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:09:55,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:09:55,279 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:09:55,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:55 WrapperNode [2019-12-18 18:09:55,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:09:55,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:09:55,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:09:55,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:09:55,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:55" (1/1) ... [2019-12-18 18:09:55,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:55" (1/1) ... [2019-12-18 18:09:55,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:09:55,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:09:55,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:09:55,343 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:09:55,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:55" (1/1) ... [2019-12-18 18:09:55,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:55" (1/1) ... [2019-12-18 18:09:55,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:55" (1/1) ... [2019-12-18 18:09:55,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:55" (1/1) ... [2019-12-18 18:09:55,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:55" (1/1) ... [2019-12-18 18:09:55,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:55" (1/1) ... [2019-12-18 18:09:55,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:55" (1/1) ... [2019-12-18 18:09:55,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:09:55,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:09:55,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:09:55,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:09:55,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:55" (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-18 18:09:55,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:09:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:09:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:09:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:09:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:09:55,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:09:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:09:55,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:09:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:09:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:09:55,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:09:55,456 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:09:56,181 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:09:56,182 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:09:56,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:09:56 BoogieIcfgContainer [2019-12-18 18:09:56,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:09:56,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:09:56,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:09:56,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:09:56,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:09:54" (1/3) ... [2019-12-18 18:09:56,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29016f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:09:56, skipping insertion in model container [2019-12-18 18:09:56,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:55" (2/3) ... [2019-12-18 18:09:56,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29016f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:09:56, skipping insertion in model container [2019-12-18 18:09:56,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:09:56" (3/3) ... [2019-12-18 18:09:56,195 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_pso.opt.i [2019-12-18 18:09:56,206 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:09:56,207 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:09:56,217 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:09:56,218 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:09:56,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,257 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,258 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,258 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,259 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,259 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,269 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,269 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,316 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,316 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,317 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,323 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,326 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:56,343 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 18:09:56,363 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:09:56,363 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:09:56,363 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:09:56,363 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:09:56,363 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:09:56,364 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:09:56,364 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:09:56,364 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:09:56,388 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 18:09:56,390 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 18:09:56,487 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 18:09:56,487 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:09:56,502 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 341 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 18:09:56,524 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 18:09:56,563 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 18:09:56,563 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:09:56,570 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 341 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 18:09:56,587 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 18:09:56,588 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:10:01,165 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 18:10:01,269 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 18:10:01,644 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-12-18 18:10:01,644 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-18 18:10:01,649 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-18 18:10:02,192 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-12-18 18:10:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-12-18 18:10:02,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 18:10:02,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:02,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 18:10:02,200 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:02,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:02,204 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-12-18 18:10:02,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:02,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231898451] [2019-12-18 18:10:02,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:02,501 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-18 18:10:02,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231898451] [2019-12-18 18:10:02,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:02,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:10:02,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515721413] [2019-12-18 18:10:02,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:10:02,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:02,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:10:02,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:10:02,534 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-12-18 18:10:02,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:02,831 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-12-18 18:10:02,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:10:02,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 18:10:02,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:02,918 INFO L225 Difference]: With dead ends: 9266 [2019-12-18 18:10:02,918 INFO L226 Difference]: Without dead ends: 8258 [2019-12-18 18:10:02,919 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-18 18:10:03,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-12-18 18:10:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-12-18 18:10:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-12-18 18:10:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-12-18 18:10:03,318 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-12-18 18:10:03,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:03,319 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-12-18 18:10:03,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:10:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-12-18 18:10:03,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:10:03,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:03,323 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:10:03,323 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:03,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:03,323 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-12-18 18:10:03,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:03,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457889580] [2019-12-18 18:10:03,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:03,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:10:03,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457889580] [2019-12-18 18:10:03,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:03,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:10:03,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122698073] [2019-12-18 18:10:03,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:10:03,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:03,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:10:03,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:10:03,498 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-12-18 18:10:03,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:03,585 INFO L93 Difference]: Finished difference Result 1877 states and 4722 transitions. [2019-12-18 18:10:03,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:10:03,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:10:03,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:03,593 INFO L225 Difference]: With dead ends: 1877 [2019-12-18 18:10:03,594 INFO L226 Difference]: Without dead ends: 1373 [2019-12-18 18:10:03,599 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-18 18:10:03,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2019-12-18 18:10:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1373. [2019-12-18 18:10:03,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2019-12-18 18:10:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 3108 transitions. [2019-12-18 18:10:03,653 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 3108 transitions. Word has length 11 [2019-12-18 18:10:03,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:03,653 INFO L462 AbstractCegarLoop]: Abstraction has 1373 states and 3108 transitions. [2019-12-18 18:10:03,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:10:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 3108 transitions. [2019-12-18 18:10:03,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:10:03,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:03,664 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:10:03,665 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:03,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:03,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-12-18 18:10:03,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:03,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137174954] [2019-12-18 18:10:03,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:03,811 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-18 18:10:03,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137174954] [2019-12-18 18:10:03,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:03,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:10:03,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37475171] [2019-12-18 18:10:03,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:10:03,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:03,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:10:03,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:10:03,815 INFO L87 Difference]: Start difference. First operand 1373 states and 3108 transitions. Second operand 4 states. [2019-12-18 18:10:04,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:04,098 INFO L93 Difference]: Finished difference Result 1700 states and 3783 transitions. [2019-12-18 18:10:04,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:10:04,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 18:10:04,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:04,109 INFO L225 Difference]: With dead ends: 1700 [2019-12-18 18:10:04,109 INFO L226 Difference]: Without dead ends: 1700 [2019-12-18 18:10:04,109 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-18 18:10:04,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-12-18 18:10:04,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1636. [2019-12-18 18:10:04,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2019-12-18 18:10:04,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 3659 transitions. [2019-12-18 18:10:04,149 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 3659 transitions. Word has length 14 [2019-12-18 18:10:04,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:04,150 INFO L462 AbstractCegarLoop]: Abstraction has 1636 states and 3659 transitions. [2019-12-18 18:10:04,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:10:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 3659 transitions. [2019-12-18 18:10:04,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:10:04,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:04,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:10:04,153 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:04,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:04,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-12-18 18:10:04,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:04,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262788635] [2019-12-18 18:10:04,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:04,352 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-18 18:10:04,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262788635] [2019-12-18 18:10:04,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:04,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:10:04,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151865936] [2019-12-18 18:10:04,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:10:04,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:04,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:10:04,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:10:04,354 INFO L87 Difference]: Start difference. First operand 1636 states and 3659 transitions. Second operand 6 states. [2019-12-18 18:10:05,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:05,067 INFO L93 Difference]: Finished difference Result 4529 states and 10000 transitions. [2019-12-18 18:10:05,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:10:05,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 18:10:05,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:05,093 INFO L225 Difference]: With dead ends: 4529 [2019-12-18 18:10:05,093 INFO L226 Difference]: Without dead ends: 4494 [2019-12-18 18:10:05,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:10:05,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2019-12-18 18:10:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 2196. [2019-12-18 18:10:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2196 states. [2019-12-18 18:10:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 4963 transitions. [2019-12-18 18:10:05,169 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 4963 transitions. Word has length 25 [2019-12-18 18:10:05,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:05,170 INFO L462 AbstractCegarLoop]: Abstraction has 2196 states and 4963 transitions. [2019-12-18 18:10:05,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:10:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 4963 transitions. [2019-12-18 18:10:05,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 18:10:05,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:05,174 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-18 18:10:05,174 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:05,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:05,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1415860500, now seen corresponding path program 1 times [2019-12-18 18:10:05,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:05,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347351179] [2019-12-18 18:10:05,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:05,233 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-18 18:10:05,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347351179] [2019-12-18 18:10:05,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:05,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:10:05,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378362837] [2019-12-18 18:10:05,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:10:05,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:05,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:10:05,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:10:05,235 INFO L87 Difference]: Start difference. First operand 2196 states and 4963 transitions. Second operand 3 states. [2019-12-18 18:10:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:05,251 INFO L93 Difference]: Finished difference Result 2195 states and 4961 transitions. [2019-12-18 18:10:05,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:10:05,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 18:10:05,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:05,261 INFO L225 Difference]: With dead ends: 2195 [2019-12-18 18:10:05,261 INFO L226 Difference]: Without dead ends: 2195 [2019-12-18 18:10:05,262 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-18 18:10:05,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2019-12-18 18:10:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 2195. [2019-12-18 18:10:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2019-12-18 18:10:05,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 4961 transitions. [2019-12-18 18:10:05,312 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 4961 transitions. Word has length 26 [2019-12-18 18:10:05,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:05,312 INFO L462 AbstractCegarLoop]: Abstraction has 2195 states and 4961 transitions. [2019-12-18 18:10:05,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:10:05,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 4961 transitions. [2019-12-18 18:10:05,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 18:10:05,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:05,316 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-18 18:10:05,316 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:05,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:05,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-12-18 18:10:05,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:05,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048671187] [2019-12-18 18:10:05,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:10:05,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048671187] [2019-12-18 18:10:05,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:05,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:10:05,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917159311] [2019-12-18 18:10:05,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:10:05,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:05,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:10:05,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:10:05,450 INFO L87 Difference]: Start difference. First operand 2195 states and 4961 transitions. Second operand 6 states. [2019-12-18 18:10:06,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:06,162 INFO L93 Difference]: Finished difference Result 4412 states and 9625 transitions. [2019-12-18 18:10:06,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:10:06,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-18 18:10:06,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:06,174 INFO L225 Difference]: With dead ends: 4412 [2019-12-18 18:10:06,174 INFO L226 Difference]: Without dead ends: 4383 [2019-12-18 18:10:06,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:10:06,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2019-12-18 18:10:06,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 2070. [2019-12-18 18:10:06,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states. [2019-12-18 18:10:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 4705 transitions. [2019-12-18 18:10:06,239 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 4705 transitions. Word has length 26 [2019-12-18 18:10:06,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:06,240 INFO L462 AbstractCegarLoop]: Abstraction has 2070 states and 4705 transitions. [2019-12-18 18:10:06,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:10:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 4705 transitions. [2019-12-18 18:10:06,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 18:10:06,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:06,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-18 18:10:06,243 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:06,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:06,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1827812304, now seen corresponding path program 1 times [2019-12-18 18:10:06,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:06,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211967475] [2019-12-18 18:10:06,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:06,313 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-18 18:10:06,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211967475] [2019-12-18 18:10:06,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:06,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:10:06,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594388926] [2019-12-18 18:10:06,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:10:06,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:06,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:10:06,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:10:06,315 INFO L87 Difference]: Start difference. First operand 2070 states and 4705 transitions. Second operand 5 states. [2019-12-18 18:10:06,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:06,790 INFO L93 Difference]: Finished difference Result 3102 states and 6886 transitions. [2019-12-18 18:10:06,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:10:06,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 18:10:06,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:06,799 INFO L225 Difference]: With dead ends: 3102 [2019-12-18 18:10:06,799 INFO L226 Difference]: Without dead ends: 3102 [2019-12-18 18:10:06,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:10:06,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2019-12-18 18:10:06,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 2654. [2019-12-18 18:10:06,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2654 states. [2019-12-18 18:10:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 5970 transitions. [2019-12-18 18:10:06,860 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 5970 transitions. Word has length 27 [2019-12-18 18:10:06,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:06,860 INFO L462 AbstractCegarLoop]: Abstraction has 2654 states and 5970 transitions. [2019-12-18 18:10:06,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:10:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 5970 transitions. [2019-12-18 18:10:06,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 18:10:06,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:06,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:10:06,865 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:06,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:06,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1234551102, now seen corresponding path program 1 times [2019-12-18 18:10:06,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:06,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402141890] [2019-12-18 18:10:06,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:06,941 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-18 18:10:06,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402141890] [2019-12-18 18:10:06,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:06,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:10:06,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818376944] [2019-12-18 18:10:06,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:10:06,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:06,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:10:06,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:10:06,943 INFO L87 Difference]: Start difference. First operand 2654 states and 5970 transitions. Second operand 5 states. [2019-12-18 18:10:06,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:06,987 INFO L93 Difference]: Finished difference Result 1623 states and 3504 transitions. [2019-12-18 18:10:06,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:10:06,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 18:10:06,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:06,992 INFO L225 Difference]: With dead ends: 1623 [2019-12-18 18:10:06,992 INFO L226 Difference]: Without dead ends: 1475 [2019-12-18 18:10:06,993 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-18 18:10:06,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2019-12-18 18:10:07,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1374. [2019-12-18 18:10:07,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-12-18 18:10:07,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2999 transitions. [2019-12-18 18:10:07,021 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2999 transitions. Word has length 28 [2019-12-18 18:10:07,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:07,022 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 2999 transitions. [2019-12-18 18:10:07,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:10:07,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2999 transitions. [2019-12-18 18:10:07,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 18:10:07,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:07,026 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-18 18:10:07,027 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:07,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:07,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1528690992, now seen corresponding path program 1 times [2019-12-18 18:10:07,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:07,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646937793] [2019-12-18 18:10:07,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:07,117 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-18 18:10:07,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646937793] [2019-12-18 18:10:07,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:07,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:10:07,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146821154] [2019-12-18 18:10:07,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:10:07,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:07,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:10:07,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:10:07,120 INFO L87 Difference]: Start difference. First operand 1374 states and 2999 transitions. Second operand 7 states. [2019-12-18 18:10:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:07,437 INFO L93 Difference]: Finished difference Result 4064 states and 8639 transitions. [2019-12-18 18:10:07,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:10:07,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 18:10:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:07,445 INFO L225 Difference]: With dead ends: 4064 [2019-12-18 18:10:07,445 INFO L226 Difference]: Without dead ends: 2676 [2019-12-18 18:10:07,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:10:07,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2019-12-18 18:10:07,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 1440. [2019-12-18 18:10:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1440 states. [2019-12-18 18:10:07,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 3133 transitions. [2019-12-18 18:10:07,536 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 3133 transitions. Word has length 51 [2019-12-18 18:10:07,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:07,536 INFO L462 AbstractCegarLoop]: Abstraction has 1440 states and 3133 transitions. [2019-12-18 18:10:07,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:10:07,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 3133 transitions. [2019-12-18 18:10:07,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 18:10:07,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:07,541 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-18 18:10:07,542 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:07,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:07,542 INFO L82 PathProgramCache]: Analyzing trace with hash 517037056, now seen corresponding path program 2 times [2019-12-18 18:10:07,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:07,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620061061] [2019-12-18 18:10:07,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:07,677 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-18 18:10:07,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620061061] [2019-12-18 18:10:07,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:07,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:10:07,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147071770] [2019-12-18 18:10:07,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:10:07,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:07,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:10:07,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:10:07,681 INFO L87 Difference]: Start difference. First operand 1440 states and 3133 transitions. Second operand 3 states. [2019-12-18 18:10:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:07,739 INFO L93 Difference]: Finished difference Result 1866 states and 4011 transitions. [2019-12-18 18:10:07,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:10:07,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 18:10:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:07,745 INFO L225 Difference]: With dead ends: 1866 [2019-12-18 18:10:07,745 INFO L226 Difference]: Without dead ends: 1866 [2019-12-18 18:10:07,745 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-18 18:10:07,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2019-12-18 18:10:07,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1519. [2019-12-18 18:10:07,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1519 states. [2019-12-18 18:10:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 3317 transitions. [2019-12-18 18:10:07,778 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 3317 transitions. Word has length 51 [2019-12-18 18:10:07,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:07,780 INFO L462 AbstractCegarLoop]: Abstraction has 1519 states and 3317 transitions. [2019-12-18 18:10:07,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:10:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 3317 transitions. [2019-12-18 18:10:07,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:10:07,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:07,785 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-18 18:10:07,785 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:07,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:07,786 INFO L82 PathProgramCache]: Analyzing trace with hash -975275625, now seen corresponding path program 1 times [2019-12-18 18:10:07,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:07,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242146252] [2019-12-18 18:10:07,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:07,973 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-18 18:10:07,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242146252] [2019-12-18 18:10:07,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:07,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:10:07,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824435961] [2019-12-18 18:10:07,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 18:10:07,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:07,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 18:10:07,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:10:07,976 INFO L87 Difference]: Start difference. First operand 1519 states and 3317 transitions. Second operand 8 states. [2019-12-18 18:10:09,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:09,461 INFO L93 Difference]: Finished difference Result 3210 states and 6767 transitions. [2019-12-18 18:10:09,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 18:10:09,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-18 18:10:09,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:09,469 INFO L225 Difference]: With dead ends: 3210 [2019-12-18 18:10:09,469 INFO L226 Difference]: Without dead ends: 3210 [2019-12-18 18:10:09,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2019-12-18 18:10:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3210 states. [2019-12-18 18:10:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3210 to 1557. [2019-12-18 18:10:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2019-12-18 18:10:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 3381 transitions. [2019-12-18 18:10:09,514 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 3381 transitions. Word has length 52 [2019-12-18 18:10:09,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:09,515 INFO L462 AbstractCegarLoop]: Abstraction has 1557 states and 3381 transitions. [2019-12-18 18:10:09,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 18:10:09,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 3381 transitions. [2019-12-18 18:10:09,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:10:09,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:09,520 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-18 18:10:09,520 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:09,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:09,520 INFO L82 PathProgramCache]: Analyzing trace with hash -709931818, now seen corresponding path program 1 times [2019-12-18 18:10:09,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:09,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816303704] [2019-12-18 18:10:09,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:09,624 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-18 18:10:09,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816303704] [2019-12-18 18:10:09,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:09,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:10:09,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927914108] [2019-12-18 18:10:09,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:10:09,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:09,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:10:09,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:10:09,627 INFO L87 Difference]: Start difference. First operand 1557 states and 3381 transitions. Second operand 7 states. [2019-12-18 18:10:10,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:10,754 INFO L93 Difference]: Finished difference Result 2962 states and 6177 transitions. [2019-12-18 18:10:10,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 18:10:10,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 18:10:10,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:10,762 INFO L225 Difference]: With dead ends: 2962 [2019-12-18 18:10:10,762 INFO L226 Difference]: Without dead ends: 2962 [2019-12-18 18:10:10,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-12-18 18:10:10,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2019-12-18 18:10:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1592. [2019-12-18 18:10:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1592 states. [2019-12-18 18:10:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 3462 transitions. [2019-12-18 18:10:10,802 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 3462 transitions. Word has length 52 [2019-12-18 18:10:10,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:10,802 INFO L462 AbstractCegarLoop]: Abstraction has 1592 states and 3462 transitions. [2019-12-18 18:10:10,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:10:10,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 3462 transitions. [2019-12-18 18:10:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:10:10,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:10,807 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-18 18:10:10,807 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:10,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:10,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1725495463, now seen corresponding path program 2 times [2019-12-18 18:10:10,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:10,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697303483] [2019-12-18 18:10:10,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:10,881 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-18 18:10:10,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697303483] [2019-12-18 18:10:10,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:10,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:10:10,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179580186] [2019-12-18 18:10:10,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:10:10,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:10,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:10:10,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:10:10,883 INFO L87 Difference]: Start difference. First operand 1592 states and 3462 transitions. Second operand 3 states. [2019-12-18 18:10:10,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:10,900 INFO L93 Difference]: Finished difference Result 1591 states and 3460 transitions. [2019-12-18 18:10:10,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:10:10,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 18:10:10,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:10,905 INFO L225 Difference]: With dead ends: 1591 [2019-12-18 18:10:10,905 INFO L226 Difference]: Without dead ends: 1591 [2019-12-18 18:10:10,906 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-18 18:10:10,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2019-12-18 18:10:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1125. [2019-12-18 18:10:10,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-12-18 18:10:10,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 2488 transitions. [2019-12-18 18:10:10,927 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 2488 transitions. Word has length 52 [2019-12-18 18:10:10,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:10,928 INFO L462 AbstractCegarLoop]: Abstraction has 1125 states and 2488 transitions. [2019-12-18 18:10:10,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:10:10,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 2488 transitions. [2019-12-18 18:10:10,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:10:10,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:10,931 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:10:10,931 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:10,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:10,932 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 1 times [2019-12-18 18:10:10,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:10,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308693042] [2019-12-18 18:10:10,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:10:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:10:11,101 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:10:11,101 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:10:11,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1711~0.base_24|) 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1711~0.base_24| 1)) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 |v_ULTIMATE.start_main_~#t1711~0.offset_18|) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1711~0.base_24|) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1711~0.base_24| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1711~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1711~0.base_24|) |v_ULTIMATE.start_main_~#t1711~0.offset_18| 0)) |v_#memory_int_13|) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, #length=|v_#length_13|, ULTIMATE.start_main_~#t1711~0.base=|v_ULTIMATE.start_main_~#t1711~0.base_24|, ULTIMATE.start_main_~#t1711~0.offset=|v_ULTIMATE.start_main_~#t1711~0.offset_18|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ULTIMATE.start_main_~#t1712~0.offset=|v_ULTIMATE.start_main_~#t1712~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ULTIMATE.start_main_~#t1712~0.base=|v_ULTIMATE.start_main_~#t1712~0.base_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1711~0.base, ULTIMATE.start_main_~#t1711~0.offset, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1712~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1712~0.base, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 18:10:11,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 18:10:11,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1712~0.base_12| 1) |v_#valid_27|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1712~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1712~0.base_12| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1712~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t1712~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t1712~0.offset_10|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1712~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1712~0.base_12|) |v_ULTIMATE.start_main_~#t1712~0.offset_10| 1)) |v_#memory_int_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1712~0.base=|v_ULTIMATE.start_main_~#t1712~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1712~0.offset=|v_ULTIMATE.start_main_~#t1712~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1712~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1712~0.offset] because there is no mapped edge [2019-12-18 18:10:11,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1300748197 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1300748197 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1300748197| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1300748197 |P0Thread1of1ForFork0_#t~ite5_Out1300748197|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1300748197, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1300748197} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1300748197|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1300748197, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1300748197} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 18:10:11,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In570862028 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out570862028| |P1Thread1of1ForFork1_#t~ite15_Out570862028|) (= |P1Thread1of1ForFork1_#t~ite14_Out570862028| ~x$w_buff0~0_In570862028) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In570862028 256)))) (or (and (= (mod ~x$w_buff1_used~0_In570862028 256) 0) .cse0) (and (= 0 (mod ~x$r_buff1_thd2~0_In570862028 256)) .cse0) (= 0 (mod ~x$w_buff0_used~0_In570862028 256)))) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite15_Out570862028| ~x$w_buff0~0_In570862028) (= |P1Thread1of1ForFork1_#t~ite14_In570862028| |P1Thread1of1ForFork1_#t~ite14_Out570862028|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In570862028, ~x$w_buff1_used~0=~x$w_buff1_used~0_In570862028, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In570862028, ~weak$$choice2~0=~weak$$choice2~0_In570862028, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In570862028, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In570862028|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In570862028} OutVars{~x$w_buff0~0=~x$w_buff0~0_In570862028, ~x$w_buff1_used~0=~x$w_buff1_used~0_In570862028, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In570862028, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out570862028|, ~weak$$choice2~0=~weak$$choice2~0_In570862028, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In570862028, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out570862028|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In570862028} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 18:10:11,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1418482248 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-1418482248 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1418482248 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1418482248 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1418482248|)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1418482248| ~x$w_buff1_used~0_In-1418482248) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1418482248, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1418482248, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1418482248, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1418482248} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1418482248|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1418482248, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1418482248, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1418482248, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1418482248} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 18:10:11,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-376034298 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-376034298 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_Out-376034298 ~x$r_buff0_thd1~0_In-376034298)) (and (not .cse1) (= 0 ~x$r_buff0_thd1~0_Out-376034298) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-376034298, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-376034298} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-376034298, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-376034298|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-376034298} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 18:10:11,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In2095263113 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In2095263113 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In2095263113 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In2095263113 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out2095263113| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out2095263113| ~x$r_buff1_thd1~0_In2095263113) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2095263113, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2095263113, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2095263113, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2095263113} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2095263113, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2095263113|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2095263113, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2095263113, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2095263113} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 18:10:11,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 18:10:11,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1963785696 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_Out1963785696| ~x$w_buff1~0_In1963785696) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1963785696 256)))) (or (and .cse0 (= (mod ~x$r_buff1_thd2~0_In1963785696 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In1963785696 256)) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In1963785696 256))))) .cse1 (= |P1Thread1of1ForFork1_#t~ite17_Out1963785696| |P1Thread1of1ForFork1_#t~ite18_Out1963785696|)) (and (= |P1Thread1of1ForFork1_#t~ite17_In1963785696| |P1Thread1of1ForFork1_#t~ite17_Out1963785696|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite18_Out1963785696| ~x$w_buff1~0_In1963785696)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1963785696, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1963785696, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1963785696, ~weak$$choice2~0=~weak$$choice2~0_In1963785696, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1963785696, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1963785696|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1963785696} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1963785696|, ~x$w_buff1~0=~x$w_buff1~0_In1963785696, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1963785696, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1963785696, ~weak$$choice2~0=~weak$$choice2~0_In1963785696, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1963785696, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1963785696|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1963785696} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 18:10:11,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2032763310 256)))) (or (and (= ~x$w_buff0_used~0_In-2032763310 |P1Thread1of1ForFork1_#t~ite20_Out-2032763310|) (= |P1Thread1of1ForFork1_#t~ite21_Out-2032763310| |P1Thread1of1ForFork1_#t~ite20_Out-2032763310|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-2032763310 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-2032763310 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-2032763310 256))) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-2032763310 256)))))) (and (not .cse0) (= ~x$w_buff0_used~0_In-2032763310 |P1Thread1of1ForFork1_#t~ite21_Out-2032763310|) (= |P1Thread1of1ForFork1_#t~ite20_In-2032763310| |P1Thread1of1ForFork1_#t~ite20_Out-2032763310|)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-2032763310|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2032763310, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2032763310, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2032763310, ~weak$$choice2~0=~weak$$choice2~0_In-2032763310, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2032763310} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-2032763310|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2032763310, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2032763310, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-2032763310|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2032763310, ~weak$$choice2~0=~weak$$choice2~0_In-2032763310, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2032763310} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 18:10:11,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 18:10:11,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In979819610 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In979819610| |P1Thread1of1ForFork1_#t~ite29_Out979819610|) (= |P1Thread1of1ForFork1_#t~ite30_Out979819610| ~x$r_buff1_thd2~0_In979819610)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In979819610 256)))) (or (and (= (mod ~x$r_buff1_thd2~0_In979819610 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In979819610 256) 0) (and (= (mod ~x$w_buff1_used~0_In979819610 256) 0) .cse1))) (= ~x$r_buff1_thd2~0_In979819610 |P1Thread1of1ForFork1_#t~ite29_Out979819610|) .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out979819610| |P1Thread1of1ForFork1_#t~ite29_Out979819610|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In979819610|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In979819610, ~x$w_buff1_used~0=~x$w_buff1_used~0_In979819610, ~weak$$choice2~0=~weak$$choice2~0_In979819610, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In979819610, ~x$w_buff0_used~0=~x$w_buff0_used~0_In979819610} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out979819610|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out979819610|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In979819610, ~x$w_buff1_used~0=~x$w_buff1_used~0_In979819610, ~weak$$choice2~0=~weak$$choice2~0_In979819610, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In979819610, ~x$w_buff0_used~0=~x$w_buff0_used~0_In979819610} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 18:10:11,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-18 18:10:11,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-440931075 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-440931075 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-440931075 |P1Thread1of1ForFork1_#t~ite32_Out-440931075|) (not .cse1)) (and (= ~x~0_In-440931075 |P1Thread1of1ForFork1_#t~ite32_Out-440931075|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-440931075, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-440931075, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-440931075, ~x~0=~x~0_In-440931075} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-440931075, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-440931075, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-440931075, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-440931075|, ~x~0=~x~0_In-440931075} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 18:10:11,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 18:10:11,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In196257478 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In196257478 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out196257478| ~x$w_buff0_used~0_In196257478) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out196257478| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In196257478, ~x$w_buff0_used~0=~x$w_buff0_used~0_In196257478} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out196257478|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In196257478, ~x$w_buff0_used~0=~x$w_buff0_used~0_In196257478} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 18:10:11,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-368483539 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-368483539 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-368483539 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-368483539 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-368483539|)) (and (= ~x$w_buff1_used~0_In-368483539 |P1Thread1of1ForFork1_#t~ite35_Out-368483539|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-368483539, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-368483539, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-368483539, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-368483539} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-368483539, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-368483539, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-368483539|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-368483539, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-368483539} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 18:10:11,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1034215198 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1034215198 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out1034215198| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out1034215198| ~x$r_buff0_thd2~0_In1034215198) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1034215198, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1034215198} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1034215198, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1034215198|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1034215198} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 18:10:11,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In582878366 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In582878366 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In582878366 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In582878366 256) 0))) (or (and (= ~x$r_buff1_thd2~0_In582878366 |P1Thread1of1ForFork1_#t~ite37_Out582878366|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out582878366| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In582878366, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In582878366, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In582878366, ~x$w_buff0_used~0=~x$w_buff0_used~0_In582878366} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In582878366, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In582878366, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In582878366, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out582878366|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In582878366} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 18:10:11,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 18:10:11,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 18:10:11,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In2006148858 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In2006148858 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out2006148858| ~x$w_buff1~0_In2006148858)) (and (= |ULTIMATE.start_main_#t~ite40_Out2006148858| ~x~0_In2006148858) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2006148858, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2006148858, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2006148858, ~x~0=~x~0_In2006148858} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2006148858|, ~x$w_buff1~0=~x$w_buff1~0_In2006148858, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2006148858, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2006148858, ~x~0=~x~0_In2006148858} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 18:10:11,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-18 18:10:11,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In861522423 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In861522423 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In861522423 |ULTIMATE.start_main_#t~ite42_Out861522423|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out861522423|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In861522423, ~x$w_buff0_used~0=~x$w_buff0_used~0_In861522423} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In861522423, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out861522423|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In861522423} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 18:10:11,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1452712592 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1452712592 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1452712592 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1452712592 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1452712592 |ULTIMATE.start_main_#t~ite43_Out-1452712592|)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1452712592|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1452712592, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1452712592, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1452712592, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1452712592} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1452712592, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1452712592, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1452712592|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1452712592, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1452712592} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 18:10:11,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-24819179 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-24819179 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-24819179| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-24819179| ~x$r_buff0_thd0~0_In-24819179)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-24819179, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-24819179} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-24819179, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-24819179|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-24819179} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 18:10:11,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-1439036537 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1439036537 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1439036537 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1439036537 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1439036537| ~x$r_buff1_thd0~0_In-1439036537) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1439036537| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1439036537, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1439036537, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1439036537, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1439036537} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1439036537, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1439036537, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1439036537, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1439036537|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1439036537} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 18:10:11,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_20 0) (= v_~y~0_126 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 2 v_~__unbuffered_p1_EAX~0_27) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:10:11,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:10:11 BasicIcfg [2019-12-18 18:10:11,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:10:11,213 INFO L168 Benchmark]: Toolchain (without parser) took 16789.37 ms. Allocated memory was 145.2 MB in the beginning and 455.6 MB in the end (delta: 310.4 MB). Free memory was 101.8 MB in the beginning and 204.5 MB in the end (delta: -102.7 MB). Peak memory consumption was 207.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:10:11,214 INFO L168 Benchmark]: CDTParser took 0.73 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 18:10:11,214 INFO L168 Benchmark]: CACSL2BoogieTranslator took 854.82 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 156.5 MB in the end (delta: -55.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-18 18:10:11,215 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.03 ms. Allocated memory is still 202.4 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:10:11,216 INFO L168 Benchmark]: Boogie Preprocessor took 47.08 ms. Allocated memory is still 202.4 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 18:10:11,216 INFO L168 Benchmark]: RCFGBuilder took 793.22 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 107.3 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:10:11,217 INFO L168 Benchmark]: TraceAbstraction took 15025.67 ms. Allocated memory was 202.4 MB in the beginning and 455.6 MB in the end (delta: 253.2 MB). Free memory was 106.6 MB in the beginning and 204.5 MB in the end (delta: -97.9 MB). Peak memory consumption was 155.3 MB. Max. memory is 7.1 GB. [2019-12-18 18:10:11,221 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.73 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 854.82 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 156.5 MB in the end (delta: -55.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.03 ms. Allocated memory is still 202.4 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.08 ms. Allocated memory is still 202.4 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 793.22 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 107.3 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15025.67 ms. Allocated memory was 202.4 MB in the beginning and 455.6 MB in the end (delta: 253.2 MB). Free memory was 106.6 MB in the beginning and 204.5 MB in the end (delta: -97.9 MB). Peak memory consumption was 155.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 29 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4894 VarBasedMoverChecksPositive, 354 VarBasedMoverChecksNegative, 269 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 76691 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1711, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1712, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1993 SDtfs, 2348 SDslu, 4519 SDs, 0 SdLazy, 3334 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 26 SyntacticMatches, 12 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9438occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 10296 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 471 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 405 ConstructedInterpolants, 0 QuantifiedInterpolants, 59155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...