/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:57:43,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:57:43,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:57:43,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:57:43,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:57:43,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:57:43,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:57:43,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:57:43,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:57:43,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:57:43,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:57:43,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:57:43,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:57:43,226 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:57:43,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:57:43,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:57:43,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:57:43,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:57:43,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:57:43,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:57:43,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:57:43,246 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:57:43,247 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:57:43,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:57:43,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:57:43,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:57:43,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:57:43,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:57:43,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:57:43,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:57:43,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:57:43,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:57:43,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:57:43,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:57:43,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:57:43,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:57:43,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:57:43,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:57:43,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:57:43,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:57:43,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:57:43,282 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-21 23:57:43,319 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:57:43,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:57:43,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:57:43,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:57:43,321 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:57:43,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:57:43,323 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:57:43,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:57:43,323 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:57:43,324 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:57:43,325 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:57:43,325 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:57:43,325 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:57:43,325 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:57:43,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:57:43,326 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:57:43,326 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:57:43,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:57:43,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:57:43,327 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:57:43,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:57:43,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:57:43,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:57:43,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:57:43,328 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:57:43,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:57:43,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:57:43,329 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-21 23:57:43,329 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:57:43,329 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:57:43,329 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-21 23:57:43,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:57:43,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:57:43,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:57:43,625 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:57:43,626 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:57:43,627 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt.i [2020-10-21 23:57:43,688 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f49b0f523/91afc69488f34877bd09b889d93399f2/FLAG0821ca892 [2020-10-21 23:57:44,292 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:57:44,293 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.opt.i [2020-10-21 23:57:44,309 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f49b0f523/91afc69488f34877bd09b889d93399f2/FLAG0821ca892 [2020-10-21 23:57:44,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f49b0f523/91afc69488f34877bd09b889d93399f2 [2020-10-21 23:57:44,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:57:44,561 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:57:44,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:57:44,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:57:44,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:57:44,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:57:44" (1/1) ... [2020-10-21 23:57:44,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77913ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:44, skipping insertion in model container [2020-10-21 23:57:44,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:57:44" (1/1) ... [2020-10-21 23:57:44,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:57:44,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:57:45,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:57:45,239 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:57:45,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:57:45,448 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:57:45,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:45 WrapperNode [2020-10-21 23:57:45,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:57:45,452 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:57:45,452 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:57:45,452 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:57:45,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:45" (1/1) ... [2020-10-21 23:57:45,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:45" (1/1) ... [2020-10-21 23:57:45,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:57:45,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:57:45,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:57:45,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:57:45,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:45" (1/1) ... [2020-10-21 23:57:45,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:45" (1/1) ... [2020-10-21 23:57:45,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:45" (1/1) ... [2020-10-21 23:57:45,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:45" (1/1) ... [2020-10-21 23:57:45,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:45" (1/1) ... [2020-10-21 23:57:45,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:45" (1/1) ... [2020-10-21 23:57:45,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:45" (1/1) ... [2020-10-21 23:57:45,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:57:45,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:57:45,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:57:45,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:57:45,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:45" (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 [2020-10-21 23:57:45,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:57:45,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:57:45,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:57:45,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:57:45,674 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:57:45,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:57:45,675 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:57:45,675 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:57:45,675 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 23:57:45,675 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 23:57:45,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:57:45,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:57:45,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:57:45,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:57:45,678 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 23:57:48,266 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:57:48,268 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:57:48,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:57:48 BoogieIcfgContainer [2020-10-21 23:57:48,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:57:48,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:57:48,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:57:48,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:57:48,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:57:44" (1/3) ... [2020-10-21 23:57:48,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e820460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:57:48, skipping insertion in model container [2020-10-21 23:57:48,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:57:45" (2/3) ... [2020-10-21 23:57:48,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e820460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:57:48, skipping insertion in model container [2020-10-21 23:57:48,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:57:48" (3/3) ... [2020-10-21 23:57:48,284 INFO L111 eAbstractionObserver]: Analyzing ICFG mix003_power.opt.i [2020-10-21 23:57:48,296 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:57:48,297 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:57:48,305 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:57:48,306 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:57:48,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,358 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,358 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,360 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,360 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,373 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,373 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,374 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,375 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,413 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,417 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,424 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,425 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,426 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,438 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,439 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:57:48,441 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:57:48,462 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-21 23:57:48,492 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:57:48,493 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:57:48,493 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:57:48,493 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-21 23:57:48,493 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:57:48,493 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:57:48,493 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:57:48,494 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:57:48,518 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:57:48,520 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 105 transitions, 225 flow [2020-10-21 23:57:48,524 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 105 transitions, 225 flow [2020-10-21 23:57:48,527 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 112 places, 105 transitions, 225 flow [2020-10-21 23:57:48,617 INFO L129 PetriNetUnfolder]: 3/102 cut-off events. [2020-10-21 23:57:48,618 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:57:48,627 INFO L80 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 3/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-10-21 23:57:48,635 INFO L116 LiptonReduction]: Number of co-enabled transitions 1834 [2020-10-21 23:57:49,602 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-21 23:57:49,727 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 23:57:50,761 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-10-21 23:57:51,687 WARN L193 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-10-21 23:57:51,880 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-10-21 23:57:51,897 INFO L131 LiptonReduction]: Checked pairs total: 4926 [2020-10-21 23:57:51,897 INFO L133 LiptonReduction]: Total number of compositions: 96 [2020-10-21 23:57:51,904 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-21 23:57:51,951 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 750 states. [2020-10-21 23:57:51,954 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states. [2020-10-21 23:57:51,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-21 23:57:51,961 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:57:51,962 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:57:51,963 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:57:51,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:57:51,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1458904489, now seen corresponding path program 1 times [2020-10-21 23:57:51,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:57:51,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194783204] [2020-10-21 23:57:51,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:57:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:57:52,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:57:52,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194783204] [2020-10-21 23:57:52,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:57:52,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:57:52,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [495623315] [2020-10-21 23:57:52,277 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:57:52,281 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:57:52,298 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-21 23:57:52,299 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:57:52,304 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-21 23:57:52,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:57:52,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:57:52,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:57:52,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:57:52,320 INFO L87 Difference]: Start difference. First operand 750 states. Second operand 3 states. [2020-10-21 23:57:52,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:57:52,425 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-10-21 23:57:52,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:57:52,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-21 23:57:52,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:57:52,454 INFO L225 Difference]: With dead ends: 650 [2020-10-21 23:57:52,454 INFO L226 Difference]: Without dead ends: 530 [2020-10-21 23:57:52,455 INFO L677 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 [2020-10-21 23:57:52,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-10-21 23:57:52,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-10-21 23:57:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-10-21 23:57:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1622 transitions. [2020-10-21 23:57:52,561 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1622 transitions. Word has length 7 [2020-10-21 23:57:52,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:57:52,562 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1622 transitions. [2020-10-21 23:57:52,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:57:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1622 transitions. [2020-10-21 23:57:52,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 23:57:52,567 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:57:52,567 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:57:52,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:57:52,568 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:57:52,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:57:52,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1847941690, now seen corresponding path program 1 times [2020-10-21 23:57:52,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:57:52,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79243190] [2020-10-21 23:57:52,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:57:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:57:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:57:52,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79243190] [2020-10-21 23:57:52,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:57:52,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:57:52,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1633026814] [2020-10-21 23:57:52,654 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:57:52,655 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:57:52,657 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-21 23:57:52,657 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:57:52,657 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-21 23:57:52,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:57:52,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:57:52,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:57:52,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:57:52,668 INFO L87 Difference]: Start difference. First operand 530 states and 1622 transitions. Second operand 3 states. [2020-10-21 23:57:52,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:57:52,684 INFO L93 Difference]: Finished difference Result 490 states and 1480 transitions. [2020-10-21 23:57:52,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:57:52,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 23:57:52,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:57:52,695 INFO L225 Difference]: With dead ends: 490 [2020-10-21 23:57:52,695 INFO L226 Difference]: Without dead ends: 490 [2020-10-21 23:57:52,696 INFO L677 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 [2020-10-21 23:57:52,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2020-10-21 23:57:52,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2020-10-21 23:57:52,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2020-10-21 23:57:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1480 transitions. [2020-10-21 23:57:52,744 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1480 transitions. Word has length 9 [2020-10-21 23:57:52,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:57:52,745 INFO L481 AbstractCegarLoop]: Abstraction has 490 states and 1480 transitions. [2020-10-21 23:57:52,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:57:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1480 transitions. [2020-10-21 23:57:52,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 23:57:52,749 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:57:52,749 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:57:52,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:57:52,750 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:57:52,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:57:52,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2049371406, now seen corresponding path program 1 times [2020-10-21 23:57:52,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:57:52,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914513751] [2020-10-21 23:57:52,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:57:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:57:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:57:52,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914513751] [2020-10-21 23:57:52,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:57:52,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:57:52,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1177497730] [2020-10-21 23:57:52,925 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:57:52,927 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:57:52,930 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 15 transitions. [2020-10-21 23:57:52,931 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:57:53,329 WARN L193 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 3 [2020-10-21 23:57:53,330 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-21 23:57:53,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:57:53,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:57:53,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:57:53,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:57:53,331 INFO L87 Difference]: Start difference. First operand 490 states and 1480 transitions. Second operand 3 states. [2020-10-21 23:57:53,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:57:53,352 INFO L93 Difference]: Finished difference Result 458 states and 1368 transitions. [2020-10-21 23:57:53,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:57:53,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-21 23:57:53,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:57:53,357 INFO L225 Difference]: With dead ends: 458 [2020-10-21 23:57:53,357 INFO L226 Difference]: Without dead ends: 458 [2020-10-21 23:57:53,358 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:57:53,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-10-21 23:57:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2020-10-21 23:57:53,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-10-21 23:57:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1368 transitions. [2020-10-21 23:57:53,375 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1368 transitions. Word has length 11 [2020-10-21 23:57:53,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:57:53,375 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 1368 transitions. [2020-10-21 23:57:53,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:57:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1368 transitions. [2020-10-21 23:57:53,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:57:53,383 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:57:53,383 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:57:53,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:57:53,384 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:57:53,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:57:53,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1884345578, now seen corresponding path program 1 times [2020-10-21 23:57:53,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:57:53,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065917598] [2020-10-21 23:57:53,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:57:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:57:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:57:53,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065917598] [2020-10-21 23:57:53,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:57:53,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:57:53,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2012604260] [2020-10-21 23:57:53,514 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:57:53,516 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:57:53,525 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 53 transitions. [2020-10-21 23:57:53,525 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:57:54,552 WARN L193 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 5 [2020-10-21 23:57:54,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:54,702 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:54,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:54,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:55,395 WARN L193 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 4 [2020-10-21 23:57:55,433 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:55,502 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:55,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:55,573 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6182#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-21 23:57:55,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:57:55,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:57:55,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:57:55,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:57:55,574 INFO L87 Difference]: Start difference. First operand 458 states and 1368 transitions. Second operand 5 states. [2020-10-21 23:57:55,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:57:55,701 INFO L93 Difference]: Finished difference Result 325 states and 864 transitions. [2020-10-21 23:57:55,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:57:55,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-21 23:57:55,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:57:55,704 INFO L225 Difference]: With dead ends: 325 [2020-10-21 23:57:55,704 INFO L226 Difference]: Without dead ends: 205 [2020-10-21 23:57:55,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:57:55,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-10-21 23:57:55,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2020-10-21 23:57:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-10-21 23:57:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 471 transitions. [2020-10-21 23:57:55,711 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 471 transitions. Word has length 13 [2020-10-21 23:57:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:57:55,712 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 471 transitions. [2020-10-21 23:57:55,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:57:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 471 transitions. [2020-10-21 23:57:55,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:57:55,713 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:57:55,713 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:57:55,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:57:55,714 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:57:55,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:57:55,714 INFO L82 PathProgramCache]: Analyzing trace with hash 446008099, now seen corresponding path program 1 times [2020-10-21 23:57:55,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:57:55,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023276065] [2020-10-21 23:57:55,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:57:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:57:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:57:55,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023276065] [2020-10-21 23:57:55,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:57:55,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:57:55,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1950870742] [2020-10-21 23:57:55,906 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:57:55,911 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:57:55,931 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 94 transitions. [2020-10-21 23:57:55,931 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:57:56,980 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-21 23:57:57,354 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 5 [2020-10-21 23:57:57,886 WARN L193 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 3 [2020-10-21 23:57:57,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:57:58,626 WARN L193 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-21 23:57:59,265 WARN L193 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 3 [2020-10-21 23:57:59,382 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6928#(<= ~__unbuffered_cnt~0 0)] [2020-10-21 23:57:59,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:57:59,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:57:59,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:57:59,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:57:59,383 INFO L87 Difference]: Start difference. First operand 205 states and 471 transitions. Second operand 7 states. [2020-10-21 23:57:59,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:57:59,448 INFO L93 Difference]: Finished difference Result 186 states and 431 transitions. [2020-10-21 23:57:59,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:57:59,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-21 23:57:59,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:57:59,450 INFO L225 Difference]: With dead ends: 186 [2020-10-21 23:57:59,450 INFO L226 Difference]: Without dead ends: 173 [2020-10-21 23:57:59,451 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:57:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-10-21 23:57:59,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2020-10-21 23:57:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-10-21 23:57:59,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 407 transitions. [2020-10-21 23:57:59,456 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 407 transitions. Word has length 18 [2020-10-21 23:57:59,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:57:59,457 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 407 transitions. [2020-10-21 23:57:59,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:57:59,457 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 407 transitions. [2020-10-21 23:57:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 23:57:59,458 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:57:59,458 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:57:59,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:57:59,458 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:57:59,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:57:59,459 INFO L82 PathProgramCache]: Analyzing trace with hash 991297394, now seen corresponding path program 1 times [2020-10-21 23:57:59,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:57:59,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628582729] [2020-10-21 23:57:59,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:57:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:57:59,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:57:59,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628582729] [2020-10-21 23:57:59,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:57:59,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:57:59,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [487090195] [2020-10-21 23:57:59,541 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:57:59,548 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:57:59,572 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 89 transitions. [2020-10-21 23:57:59,572 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:58:00,439 WARN L193 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 3 [2020-10-21 23:58:01,112 WARN L193 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-21 23:58:01,812 WARN L193 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 3 [2020-10-21 23:58:01,822 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-21 23:58:01,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:58:01,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:58:01,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:58:01,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:58:01,824 INFO L87 Difference]: Start difference. First operand 173 states and 407 transitions. Second operand 4 states. [2020-10-21 23:58:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:58:01,859 INFO L93 Difference]: Finished difference Result 220 states and 505 transitions. [2020-10-21 23:58:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:58:01,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-21 23:58:01,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:58:01,861 INFO L225 Difference]: With dead ends: 220 [2020-10-21 23:58:01,861 INFO L226 Difference]: Without dead ends: 92 [2020-10-21 23:58:01,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:58:01,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-21 23:58:01,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-21 23:58:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-21 23:58:01,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 185 transitions. [2020-10-21 23:58:01,865 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 185 transitions. Word has length 21 [2020-10-21 23:58:01,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:58:01,865 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 185 transitions. [2020-10-21 23:58:01,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:58:01,866 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 185 transitions. [2020-10-21 23:58:01,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 23:58:01,866 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:58:01,866 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:58:01,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:58:01,867 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:58:01,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:58:01,867 INFO L82 PathProgramCache]: Analyzing trace with hash 559280400, now seen corresponding path program 2 times [2020-10-21 23:58:01,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:58:01,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312877954] [2020-10-21 23:58:01,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:58:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:58:01,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:58:01,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312877954] [2020-10-21 23:58:01,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:58:01,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:58:01,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2139605663] [2020-10-21 23:58:01,954 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:58:01,959 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:58:01,980 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 41 transitions. [2020-10-21 23:58:01,980 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:58:02,654 WARN L193 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-21 23:58:02,663 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-21 23:58:02,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:58:02,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:58:02,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:58:02,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:58:02,664 INFO L87 Difference]: Start difference. First operand 92 states and 185 transitions. Second operand 4 states. [2020-10-21 23:58:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:58:02,692 INFO L93 Difference]: Finished difference Result 118 states and 233 transitions. [2020-10-21 23:58:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:58:02,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-21 23:58:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:58:02,693 INFO L225 Difference]: With dead ends: 118 [2020-10-21 23:58:02,693 INFO L226 Difference]: Without dead ends: 48 [2020-10-21 23:58:02,696 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:58:02,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-21 23:58:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-10-21 23:58:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-21 23:58:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2020-10-21 23:58:02,699 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 21 [2020-10-21 23:58:02,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:58:02,700 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2020-10-21 23:58:02,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:58:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2020-10-21 23:58:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 23:58:02,701 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:58:02,701 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:58:02,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:58:02,702 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:58:02,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:58:02,702 INFO L82 PathProgramCache]: Analyzing trace with hash 237741602, now seen corresponding path program 3 times [2020-10-21 23:58:02,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:58:02,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741823648] [2020-10-21 23:58:02,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:58:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:58:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:58:03,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741823648] [2020-10-21 23:58:03,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:58:03,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-21 23:58:03,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [660513657] [2020-10-21 23:58:03,138 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:58:03,141 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:58:03,155 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 45 transitions. [2020-10-21 23:58:03,155 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:58:03,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,351 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:03,353 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:03,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:03,369 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-21 23:58:03,370 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,372 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-21 23:58:03,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,374 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 3, 3, 2, 2, 1] term [2020-10-21 23:58:03,375 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,381 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-21 23:58:03,382 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,383 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:03,390 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,401 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:03,402 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:03,412 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,419 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:03,423 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:03,424 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:03,431 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,434 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:03,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,445 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:03,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:03,451 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:03,458 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:03,465 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,471 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-21 23:58:03,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,475 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,479 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:03,483 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:03,490 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,501 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:03,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,508 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,509 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-21 23:58:03,511 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:03,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,515 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:03,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,521 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:03,525 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,532 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,537 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,539 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:03,550 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:03,554 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,558 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:03,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,573 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:03,575 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:03,580 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,590 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:03,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:03,602 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:03,610 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,611 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-21 23:58:03,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:03,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,619 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:03,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,626 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:03,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,702 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:03,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,712 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-21 23:58:03,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,714 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,716 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:03,721 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-21 23:58:03,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:03,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,728 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:03,734 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,735 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:03,739 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,745 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,749 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:03,750 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:03,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,758 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:03,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,772 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:03,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,784 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:03,794 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-21 23:58:03,796 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:03,799 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:03,801 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:03,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:03,807 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:03,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,174 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 38 [2020-10-21 23:58:04,378 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 101 [2020-10-21 23:58:04,395 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,396 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:04,396 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:04,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:04,402 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-21 23:58:04,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,406 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-21 23:58:04,406 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,407 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 3, 3, 2, 2, 1] term [2020-10-21 23:58:04,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,408 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,409 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-21 23:58:04,410 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,410 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,411 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,411 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,412 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:04,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,428 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:04,431 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,435 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:04,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,448 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:04,453 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:04,456 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,460 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,464 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:04,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:04,468 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:04,483 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,486 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:04,487 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:04,498 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,498 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,500 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,503 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:04,508 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-21 23:58:04,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:04,512 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,514 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:04,519 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,520 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:04,524 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,529 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,529 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,532 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:04,537 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,543 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:04,545 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:04,549 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:04,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,556 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,562 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:04,566 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,571 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:04,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,579 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:04,580 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:04,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,590 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:04,593 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:04,594 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:04,602 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:04,606 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,609 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:04,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,618 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,620 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:04,624 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-21 23:58:04,626 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:04,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,630 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:04,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,636 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:04,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,649 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,652 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:04,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,658 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:04,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:04,663 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:04,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,675 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:04,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:04,682 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:04,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,691 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:04,692 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:04,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:04,701 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:04,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:04,706 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:04,871 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 36 [2020-10-21 23:58:05,021 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [8104#(and (or (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p1_EBX~0 1) (= ~__unbuffered_p1_EBX~0 ~__unbuffered_p2_EAX~0)) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), 8105#(and (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0) (or (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p1_EBX~0 1) (= ~__unbuffered_p1_EBX~0 ~__unbuffered_p2_EAX~0))), 8106#(and (or (= ~__unbuffered_p2_EAX~0 0) (and (or (= ~y~0 1) (= ~y~0 ~__unbuffered_p2_EAX~0)) (= (mod ~y$w_buff1_used~0 256) 0)) (and (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0)))) (or (= ~__unbuffered_p2_EAX~0 0) (and (= ~y$r_buff1_thd2~0 0) (or (= (mod ~y$w_buff0_used~0 256) 0) (= 0 (mod ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 1) (= ~y$w_buff0~0 ~__unbuffered_p2_EAX~0)) (= ~y$r_buff0_thd2~0 0))) (= ~__unbuffered_cnt~0 0))] [2020-10-21 23:58:05,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:58:05,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:58:05,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:58:05,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:58:05,023 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand 14 states. [2020-10-21 23:58:05,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:58:05,666 INFO L93 Difference]: Finished difference Result 69 states and 111 transitions. [2020-10-21 23:58:05,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-21 23:58:05,666 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2020-10-21 23:58:05,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:58:05,667 INFO L225 Difference]: With dead ends: 69 [2020-10-21 23:58:05,667 INFO L226 Difference]: Without dead ends: 43 [2020-10-21 23:58:05,668 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-10-21 23:58:05,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-21 23:58:05,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2020-10-21 23:58:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-10-21 23:58:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2020-10-21 23:58:05,670 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 21 [2020-10-21 23:58:05,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:58:05,670 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2020-10-21 23:58:05,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:58:05,671 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2020-10-21 23:58:05,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 23:58:05,671 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:58:05,671 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:58:05,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:58:05,672 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:58:05,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:58:05,672 INFO L82 PathProgramCache]: Analyzing trace with hash -348240838, now seen corresponding path program 4 times [2020-10-21 23:58:05,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:58:05,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652669126] [2020-10-21 23:58:05,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:58:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:58:05,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:58:05,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652669126] [2020-10-21 23:58:05,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:58:05,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:58:05,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2067875131] [2020-10-21 23:58:05,946 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:58:05,950 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:58:05,967 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 49 transitions. [2020-10-21 23:58:05,967 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:58:06,048 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-21 23:58:06,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:06,049 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-21 23:58:06,050 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:06,052 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-21 23:58:06,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:06,053 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-21 23:58:06,053 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:06,054 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 23:58:06,054 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:06,231 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-10-21 23:58:06,415 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 36 [2020-10-21 23:58:06,783 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2020-10-21 23:58:06,790 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-21 23:58:06,790 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:06,791 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-21 23:58:06,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:06,794 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-21 23:58:06,794 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:06,795 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-21 23:58:06,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:06,796 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 23:58:06,797 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:07,002 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 36 [2020-10-21 23:58:07,003 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [8269#(or (and (or (and (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0))) (and (or (= (mod ~y$r_buff1_thd3~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~y~0 0)))) (or (= (mod ~y$w_buff0_used~0 256) 0) (not (= ~y$w_buff0~0 0)))) (not (= ~__unbuffered_p2_EAX~0 1)))] [2020-10-21 23:58:07,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:58:07,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:58:07,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:58:07,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:58:07,005 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand 8 states. [2020-10-21 23:58:07,464 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 28 [2020-10-21 23:58:07,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:58:07,489 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2020-10-21 23:58:07,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:58:07,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-21 23:58:07,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:58:07,491 INFO L225 Difference]: With dead ends: 44 [2020-10-21 23:58:07,491 INFO L226 Difference]: Without dead ends: 32 [2020-10-21 23:58:07,491 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:58:07,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-10-21 23:58:07,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-21 23:58:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-21 23:58:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2020-10-21 23:58:07,494 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 21 [2020-10-21 23:58:07,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:58:07,494 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-10-21 23:58:07,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:58:07,494 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2020-10-21 23:58:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 23:58:07,495 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:58:07,495 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:58:07,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:58:07,496 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:58:07,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:58:07,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1432706462, now seen corresponding path program 5 times [2020-10-21 23:58:07,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:58:07,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542287933] [2020-10-21 23:58:07,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:58:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:58:07,547 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:58:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:58:07,628 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:58:07,687 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:58:07,687 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:58:07,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:58:07,690 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 23:58:07,732 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1199] [1199] L2-->L864: Formula: (let ((.cse6 (= (mod ~y$r_buff1_thd0~0_In-2080439529 256) 0)) (.cse7 (= (mod ~y$w_buff1_used~0_In-2080439529 256) 0)) (.cse9 (= (mod ~y$r_buff0_thd0~0_In-2080439529 256) 0)) (.cse8 (= (mod ~y$w_buff0_used~0_In-2080439529 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (= ~y$r_buff1_thd0~0_In-2080439529 ~y$r_buff1_thd0~0_Out-2080439529) (or (and .cse0 (= ~y$w_buff0_used~0_In-2080439529 ~y$w_buff0_used~0_Out-2080439529)) (and .cse1 (= ~y$w_buff0_used~0_Out-2080439529 0) .cse2)) (= ~y$r_buff0_thd0~0_Out-2080439529 ~y$r_buff0_thd0~0_In-2080439529) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-2080439529 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-2080439529| ULTIMATE.start_assume_abort_if_not_~cond_Out-2080439529) (or (and .cse1 .cse2 (= ~y$w_buff0~0_In-2080439529 ~y~0_Out-2080439529)) (and .cse0 (or (and (= ~y~0_In-2080439529 ~y~0_Out-2080439529) .cse3) (and (= ~y$w_buff1~0_In-2080439529 ~y~0_Out-2080439529) .cse4 .cse5)))) (or (and (= ~y$w_buff1_used~0_Out-2080439529 0) .cse4 .cse5) (and (= ~y$w_buff1_used~0_Out-2080439529 ~y$w_buff1_used~0_In-2080439529) .cse3))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2080439529|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2080439529, ~y$w_buff1~0=~y$w_buff1~0_In-2080439529, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2080439529, ~y$w_buff0~0=~y$w_buff0~0_In-2080439529, ~y~0=~y~0_In-2080439529, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2080439529, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2080439529} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-2080439529, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-2080439529|, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-2080439529|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-2080439529|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-2080439529|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2080439529|, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-2080439529|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-2080439529|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-2080439529, ~y$w_buff1~0=~y$w_buff1~0_In-2080439529, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-2080439529, ~y$w_buff0~0=~y$w_buff0~0_In-2080439529, ~y~0=~y~0_Out-2080439529, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-2080439529, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-2080439529} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-21 23:58:07,747 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,748 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [794] [2020-10-21 23:58:07,749 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,749 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,749 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,749 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,750 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,750 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,750 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,750 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,750 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,750 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,751 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,751 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,752 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,752 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,752 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,753 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,753 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,753 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,753 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,753 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,754 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,754 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,754 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,757 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,758 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,762 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,763 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,763 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,763 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,763 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,763 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,763 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,764 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,764 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,764 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,764 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,764 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,764 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,765 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,765 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,766 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,766 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,767 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,767 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,767 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:07,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:07,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:58:07 BasicIcfg [2020-10-21 23:58:07,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:58:07,880 INFO L168 Benchmark]: Toolchain (without parser) took 23323.30 ms. Allocated memory was 141.0 MB in the beginning and 428.3 MB in the end (delta: 287.3 MB). Free memory was 102.7 MB in the beginning and 117.7 MB in the end (delta: -15.0 MB). Peak memory consumption was 272.3 MB. Max. memory is 7.1 GB. [2020-10-21 23:58:07,880 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.1 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-10-21 23:58:07,883 INFO L168 Benchmark]: CACSL2BoogieTranslator took 888.18 ms. Allocated memory was 141.0 MB in the beginning and 205.0 MB in the end (delta: 64.0 MB). Free memory was 101.8 MB in the beginning and 154.1 MB in the end (delta: -52.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-10-21 23:58:07,883 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.30 ms. Allocated memory is still 205.0 MB. Free memory was 154.1 MB in the beginning and 151.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:58:07,886 INFO L168 Benchmark]: Boogie Preprocessor took 45.11 ms. Allocated memory is still 205.0 MB. Free memory was 151.2 MB in the beginning and 148.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:58:07,887 INFO L168 Benchmark]: RCFGBuilder took 2696.05 ms. Allocated memory was 205.0 MB in the beginning and 245.9 MB in the end (delta: 40.9 MB). Free memory was 148.3 MB in the beginning and 208.3 MB in the end (delta: -60.0 MB). Peak memory consumption was 98.1 MB. Max. memory is 7.1 GB. [2020-10-21 23:58:07,889 INFO L168 Benchmark]: TraceAbstraction took 19604.51 ms. Allocated memory was 245.9 MB in the beginning and 428.3 MB in the end (delta: 182.5 MB). Free memory was 208.3 MB in the beginning and 117.7 MB in the end (delta: 90.6 MB). Peak memory consumption was 273.0 MB. Max. memory is 7.1 GB. [2020-10-21 23:58:07,895 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.1 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 888.18 ms. Allocated memory was 141.0 MB in the beginning and 205.0 MB in the end (delta: 64.0 MB). Free memory was 101.8 MB in the beginning and 154.1 MB in the end (delta: -52.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.30 ms. Allocated memory is still 205.0 MB. Free memory was 154.1 MB in the beginning and 151.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.11 ms. Allocated memory is still 205.0 MB. Free memory was 151.2 MB in the beginning and 148.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2696.05 ms. Allocated memory was 205.0 MB in the beginning and 245.9 MB in the end (delta: 40.9 MB). Free memory was 148.3 MB in the beginning and 208.3 MB in the end (delta: -60.0 MB). Peak memory consumption was 98.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19604.51 ms. Allocated memory was 245.9 MB in the beginning and 428.3 MB in the end (delta: 182.5 MB). Free memory was 208.3 MB in the beginning and 117.7 MB in the end (delta: 90.6 MB). Peak memory consumption was 273.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 992 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 79 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.3s, 112 PlacesBefore, 36 PlacesAfterwards, 105 TransitionsBefore, 26 TransitionsAfterwards, 1834 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 96 TotalNumberOfCompositions, 4926 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t65; [L849] FCALL, FORK 0 pthread_create(&t65, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t66; [L851] FCALL, FORK 0 pthread_create(&t66, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t67; [L853] FCALL, FORK 0 pthread_create(&t67, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 y$flush_delayed = weak$$choice2 [L810] 3 y$mem_tmp = y [L811] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L811] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L812] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0 [L812] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L812] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L813] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L814] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L815] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L815] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L816] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L817] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EAX = y [L819] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L819] 3 y = y$flush_delayed ? y$mem_tmp : y [L820] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L749] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L764] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L777] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L778] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L780] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = y [L782] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L826] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L827] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L827] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L828] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L829] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L829] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L830] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L866] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix003_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 103 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.1s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 228 SDtfs, 182 SDslu, 483 SDs, 0 SdLazy, 386 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 112 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=750occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 19269 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...