/usr/bin/java -Xmx16000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix015_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 18:12:17,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 18:12:17,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 18:12:17,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 18:12:17,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 18:12:17,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 18:12:17,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 18:12:17,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 18:12:17,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 18:12:17,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 18:12:17,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 18:12:17,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 18:12:17,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 18:12:17,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 18:12:17,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 18:12:17,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 18:12:17,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 18:12:17,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 18:12:17,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 18:12:17,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 18:12:17,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 18:12:17,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 18:12:17,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 18:12:17,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 18:12:17,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 18:12:17,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 18:12:17,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 18:12:17,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 18:12:17,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 18:12:17,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 18:12:17,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 18:12:17,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 18:12:17,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 18:12:17,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 18:12:17,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 18:12:17,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 18:12:17,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 18:12:17,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 18:12:17,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 18:12:17,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 18:12:17,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 18:12:17,222 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-15 18:12:17,258 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 18:12:17,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 18:12:17,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 18:12:17,260 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 18:12:17,260 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 18:12:17,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 18:12:17,260 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 18:12:17,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 18:12:17,261 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 18:12:17,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 18:12:17,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 18:12:17,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 18:12:17,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 18:12:17,263 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 18:12:17,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 18:12:17,264 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 18:12:17,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 18:12:17,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 18:12:17,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 18:12:17,265 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 18:12:17,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 18:12:17,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:12:17,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 18:12:17,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 18:12:17,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 18:12:17,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 18:12:17,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 18:12:17,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 18:12:17,266 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-15 18:12:17,266 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 18:12:17,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 18:12:17,557 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 18:12:17,560 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 18:12:17,561 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 18:12:17,562 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 18:12:17,563 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_tso.oepc.i [2020-10-15 18:12:17,620 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b775ac295/1ae1613942294cb6bfed6a7ea60053db/FLAG280b38aab [2020-10-15 18:12:18,191 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 18:12:18,193 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_tso.oepc.i [2020-10-15 18:12:18,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b775ac295/1ae1613942294cb6bfed6a7ea60053db/FLAG280b38aab [2020-10-15 18:12:18,465 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b775ac295/1ae1613942294cb6bfed6a7ea60053db [2020-10-15 18:12:18,474 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 18:12:18,476 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 18:12:18,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 18:12:18,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 18:12:18,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 18:12:18,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:12:18" (1/1) ... [2020-10-15 18:12:18,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5529605f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:18, skipping insertion in model container [2020-10-15 18:12:18,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:12:18" (1/1) ... [2020-10-15 18:12:18,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 18:12:18,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 18:12:19,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:12:19,061 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 18:12:19,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:12:19,197 INFO L208 MainTranslator]: Completed translation [2020-10-15 18:12:19,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:19 WrapperNode [2020-10-15 18:12:19,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 18:12:19,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 18:12:19,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 18:12:19,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 18:12:19,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:19" (1/1) ... [2020-10-15 18:12:19,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:19" (1/1) ... [2020-10-15 18:12:19,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 18:12:19,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 18:12:19,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 18:12:19,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 18:12:19,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:19" (1/1) ... [2020-10-15 18:12:19,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:19" (1/1) ... [2020-10-15 18:12:19,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:19" (1/1) ... [2020-10-15 18:12:19,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:19" (1/1) ... [2020-10-15 18:12:19,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:19" (1/1) ... [2020-10-15 18:12:19,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:19" (1/1) ... [2020-10-15 18:12:19,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:19" (1/1) ... [2020-10-15 18:12:19,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 18:12:19,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 18:12:19,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 18:12:19,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 18:12:19,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:19" (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-15 18:12:19,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 18:12:19,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 18:12:19,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 18:12:19,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 18:12:19,394 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 18:12:19,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 18:12:19,394 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 18:12:19,395 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 18:12:19,395 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 18:12:19,395 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 18:12:19,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 18:12:19,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 18:12:19,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 18:12:19,397 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 18:12:21,321 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 18:12:21,321 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 18:12:21,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:12:21 BoogieIcfgContainer [2020-10-15 18:12:21,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 18:12:21,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 18:12:21,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 18:12:21,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 18:12:21,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:12:18" (1/3) ... [2020-10-15 18:12:21,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abd02f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:12:21, skipping insertion in model container [2020-10-15 18:12:21,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:19" (2/3) ... [2020-10-15 18:12:21,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abd02f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:12:21, skipping insertion in model container [2020-10-15 18:12:21,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:12:21" (3/3) ... [2020-10-15 18:12:21,333 INFO L111 eAbstractionObserver]: Analyzing ICFG mix015_tso.oepc.i [2020-10-15 18:12:21,345 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 18:12:21,345 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 18:12:21,354 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 18:12:21,355 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 18:12:21,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,390 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,390 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,391 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,391 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,394 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,394 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,395 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,395 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,395 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,395 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,399 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,399 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,415 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,415 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,424 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,426 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,437 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,438 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,438 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:12:21,454 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-15 18:12:21,477 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 18:12:21,477 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 18:12:21,477 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 18:12:21,477 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 18:12:21,477 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 18:12:21,478 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 18:12:21,478 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 18:12:21,478 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 18:12:21,493 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 18:12:21,496 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 100 transitions, 215 flow [2020-10-15 18:12:21,500 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 100 transitions, 215 flow [2020-10-15 18:12:21,502 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 215 flow [2020-10-15 18:12:21,553 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2020-10-15 18:12:21,553 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 18:12:21,559 INFO L80 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2020-10-15 18:12:21,566 INFO L117 LiptonReduction]: Number of co-enabled transitions 1928 [2020-10-15 18:12:21,979 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 18:12:22,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:22,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:22,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:22,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:22,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:22,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:22,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:22,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:22,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:22,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:22,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:22,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:22,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:22,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:22,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:22,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:22,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:22,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:22,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:22,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:22,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:22,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:22,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:22,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:22,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:22,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:22,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:22,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:22,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:22,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:22,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:22,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:22,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:22,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:22,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:22,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:22,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:22,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:22,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:22,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:22,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:22,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:22,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:22,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:22,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:22,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:22,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:22,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:22,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:22,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:22,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:22,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:22,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:22,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:22,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:22,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:22,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:22,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:23,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:23,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:23,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:23,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:23,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:23,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:23,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:23,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:23,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:23,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:23,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:23,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:23,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:23,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:23,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:23,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:23,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:23,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:23,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:23,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:23,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:23,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:23,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:23,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:23,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:23,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:23,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:23,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:12:23,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:12:23,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:12:23,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:12:23,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:12:23,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:12:23,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:12:23,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:23,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:12:23,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:23,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:12:23,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:23,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:12:23,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:12:23,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:12:23,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:23,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:23,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:23,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:23,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:23,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:23,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:23,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:23,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:23,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:23,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:23,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:12:23,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:23,771 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-15 18:12:23,904 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-15 18:12:23,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:23,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:23,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:23,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:23,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:23,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:23,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:23,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:23,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:23,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:23,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:23,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:24,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:12:24,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:12:24,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:12:24,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:24,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:12:24,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:12:24,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:12:24,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:12:24,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:12:24,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:12:24,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:12:24,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:24,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:12:24,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:24,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:12:24,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:24,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:24,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:24,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:24,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:24,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:24,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:24,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:24,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:24,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:24,591 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:24,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:24,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:24,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:24,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:24,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:24,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:24,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:24,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:24,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:24,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:24,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:24,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:24,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:24,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:24,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:24,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:24,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:24,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:12:24,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:12:24,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:12:24,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:12:24,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:12:24,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:12:24,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:12:24,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:24,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:12:24,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:24,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:12:24,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:24,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:12:24,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 18:12:24,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:12:24,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:24,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:24,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:24,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:24,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:24,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:24,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:24,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:24,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:12:24,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 18:12:25,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:12:25,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:12:25,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:12:25,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:12:25,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:12:25,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:12:25,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:12:25,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:12:25,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:25,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:12:25,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:25,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:12:25,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:25,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:25,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:25,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:25,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:25,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:25,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:25,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:25,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:25,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:25,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:25,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:25,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:25,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:25,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:25,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:25,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:25,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:25,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:25,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:25,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:25,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:25,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:25,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:25,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:25,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:25,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:25,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:25,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:25,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:25,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:25,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:25,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:12:25,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:12:25,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:12:25,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:25,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:12:25,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:12:26,000 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-15 18:12:26,136 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-15 18:12:26,283 INFO L132 LiptonReduction]: Checked pairs total: 5291 [2020-10-15 18:12:26,283 INFO L134 LiptonReduction]: Total number of compositions: 81 [2020-10-15 18:12:26,290 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 28 transitions, 71 flow [2020-10-15 18:12:26,354 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1136 states. [2020-10-15 18:12:26,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states. [2020-10-15 18:12:26,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-15 18:12:26,363 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:12:26,364 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-15 18:12:26,364 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:12:26,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:12:26,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1063949, now seen corresponding path program 1 times [2020-10-15 18:12:26,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:12:26,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623017568] [2020-10-15 18:12:26,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:12:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:12:26,642 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-15 18:12:26,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623017568] [2020-10-15 18:12:26,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:12:26,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:12:26,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946179507] [2020-10-15 18:12:26,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:12:26,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:12:26,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:12:26,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:12:26,668 INFO L87 Difference]: Start difference. First operand 1136 states. Second operand 3 states. [2020-10-15 18:12:26,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:12:26,777 INFO L93 Difference]: Finished difference Result 974 states and 3122 transitions. [2020-10-15 18:12:26,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:12:26,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-15 18:12:26,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:12:26,809 INFO L225 Difference]: With dead ends: 974 [2020-10-15 18:12:26,809 INFO L226 Difference]: Without dead ends: 794 [2020-10-15 18:12:26,811 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-15 18:12:26,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2020-10-15 18:12:26,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2020-10-15 18:12:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-10-15 18:12:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 2498 transitions. [2020-10-15 18:12:26,945 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 2498 transitions. Word has length 3 [2020-10-15 18:12:26,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:12:26,945 INFO L481 AbstractCegarLoop]: Abstraction has 794 states and 2498 transitions. [2020-10-15 18:12:26,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:12:26,945 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 2498 transitions. [2020-10-15 18:12:26,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 18:12:26,947 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:12:26,947 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:12:26,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 18:12:26,948 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:12:26,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:12:26,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1909619194, now seen corresponding path program 1 times [2020-10-15 18:12:26,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:12:26,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943349386] [2020-10-15 18:12:26,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:12:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:12:27,095 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-15 18:12:27,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943349386] [2020-10-15 18:12:27,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:12:27,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:12:27,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174243000] [2020-10-15 18:12:27,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:12:27,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:12:27,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:12:27,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:12:27,099 INFO L87 Difference]: Start difference. First operand 794 states and 2498 transitions. Second operand 3 states. [2020-10-15 18:12:27,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:12:27,112 INFO L93 Difference]: Finished difference Result 734 states and 2280 transitions. [2020-10-15 18:12:27,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:12:27,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-15 18:12:27,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:12:27,120 INFO L225 Difference]: With dead ends: 734 [2020-10-15 18:12:27,120 INFO L226 Difference]: Without dead ends: 734 [2020-10-15 18:12:27,121 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-15 18:12:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2020-10-15 18:12:27,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2020-10-15 18:12:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2020-10-15 18:12:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 2280 transitions. [2020-10-15 18:12:27,147 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 2280 transitions. Word has length 9 [2020-10-15 18:12:27,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:12:27,148 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 2280 transitions. [2020-10-15 18:12:27,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:12:27,149 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 2280 transitions. [2020-10-15 18:12:27,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 18:12:27,151 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:12:27,151 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:12:27,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 18:12:27,152 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:12:27,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:12:27,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1193024224, now seen corresponding path program 1 times [2020-10-15 18:12:27,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:12:27,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945168421] [2020-10-15 18:12:27,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:12:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:12:27,211 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-15 18:12:27,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945168421] [2020-10-15 18:12:27,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:12:27,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:12:27,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296278067] [2020-10-15 18:12:27,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:12:27,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:12:27,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:12:27,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:12:27,214 INFO L87 Difference]: Start difference. First operand 734 states and 2280 transitions. Second operand 3 states. [2020-10-15 18:12:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:12:27,227 INFO L93 Difference]: Finished difference Result 694 states and 2138 transitions. [2020-10-15 18:12:27,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:12:27,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-15 18:12:27,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:12:27,233 INFO L225 Difference]: With dead ends: 694 [2020-10-15 18:12:27,234 INFO L226 Difference]: Without dead ends: 694 [2020-10-15 18:12:27,235 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-15 18:12:27,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2020-10-15 18:12:27,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2020-10-15 18:12:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2020-10-15 18:12:27,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 2138 transitions. [2020-10-15 18:12:27,259 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 2138 transitions. Word has length 11 [2020-10-15 18:12:27,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:12:27,260 INFO L481 AbstractCegarLoop]: Abstraction has 694 states and 2138 transitions. [2020-10-15 18:12:27,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:12:27,260 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 2138 transitions. [2020-10-15 18:12:27,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 18:12:27,269 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:12:27,269 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:12:27,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 18:12:27,269 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:12:27,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:12:27,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2125835106, now seen corresponding path program 1 times [2020-10-15 18:12:27,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:12:27,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330062258] [2020-10-15 18:12:27,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:12:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:12:27,418 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-15 18:12:27,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330062258] [2020-10-15 18:12:27,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:12:27,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:12:27,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610076330] [2020-10-15 18:12:27,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:12:27,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:12:27,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:12:27,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:12:27,421 INFO L87 Difference]: Start difference. First operand 694 states and 2138 transitions. Second operand 4 states. [2020-10-15 18:12:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:12:27,463 INFO L93 Difference]: Finished difference Result 638 states and 1738 transitions. [2020-10-15 18:12:27,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:12:27,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-15 18:12:27,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:12:27,467 INFO L225 Difference]: With dead ends: 638 [2020-10-15 18:12:27,467 INFO L226 Difference]: Without dead ends: 458 [2020-10-15 18:12:27,468 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:12:27,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-10-15 18:12:27,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2020-10-15 18:12:27,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-10-15 18:12:27,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1194 transitions. [2020-10-15 18:12:27,482 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1194 transitions. Word has length 13 [2020-10-15 18:12:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:12:27,482 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 1194 transitions. [2020-10-15 18:12:27,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:12:27,482 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1194 transitions. [2020-10-15 18:12:27,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:12:27,484 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:12:27,484 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:12:27,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 18:12:27,484 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:12:27,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:12:27,485 INFO L82 PathProgramCache]: Analyzing trace with hash -971258912, now seen corresponding path program 1 times [2020-10-15 18:12:27,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:12:27,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161264823] [2020-10-15 18:12:27,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:12:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:12:27,623 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-15 18:12:27,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161264823] [2020-10-15 18:12:27,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:12:27,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:12:27,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44155251] [2020-10-15 18:12:27,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:12:27,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:12:27,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:12:27,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:12:27,626 INFO L87 Difference]: Start difference. First operand 458 states and 1194 transitions. Second operand 5 states. [2020-10-15 18:12:27,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:12:27,682 INFO L93 Difference]: Finished difference Result 375 states and 914 transitions. [2020-10-15 18:12:27,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:12:27,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-15 18:12:27,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:12:27,685 INFO L225 Difference]: With dead ends: 375 [2020-10-15 18:12:27,686 INFO L226 Difference]: Without dead ends: 295 [2020-10-15 18:12:27,686 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:12:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-10-15 18:12:27,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2020-10-15 18:12:27,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-10-15 18:12:27,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 705 transitions. [2020-10-15 18:12:27,696 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 705 transitions. Word has length 16 [2020-10-15 18:12:27,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:12:27,696 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 705 transitions. [2020-10-15 18:12:27,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:12:27,696 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 705 transitions. [2020-10-15 18:12:27,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:12:27,698 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:12:27,698 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:12:27,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 18:12:27,698 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:12:27,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:12:27,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1231003595, now seen corresponding path program 1 times [2020-10-15 18:12:27,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:12:27,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097498970] [2020-10-15 18:12:27,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:12:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:12:27,927 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-15 18:12:27,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097498970] [2020-10-15 18:12:27,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:12:27,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:12:27,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131638174] [2020-10-15 18:12:27,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:12:27,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:12:27,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:12:27,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:12:27,930 INFO L87 Difference]: Start difference. First operand 295 states and 705 transitions. Second operand 6 states. [2020-10-15 18:12:27,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:12:27,981 INFO L93 Difference]: Finished difference Result 272 states and 657 transitions. [2020-10-15 18:12:27,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:12:27,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-15 18:12:27,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:12:27,984 INFO L225 Difference]: With dead ends: 272 [2020-10-15 18:12:27,984 INFO L226 Difference]: Without dead ends: 257 [2020-10-15 18:12:27,984 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:12:27,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-10-15 18:12:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2020-10-15 18:12:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-10-15 18:12:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 629 transitions. [2020-10-15 18:12:27,991 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 629 transitions. Word has length 19 [2020-10-15 18:12:27,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:12:27,991 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 629 transitions. [2020-10-15 18:12:27,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:12:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 629 transitions. [2020-10-15 18:12:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-15 18:12:27,993 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:12:27,993 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, 1, 1] [2020-10-15 18:12:27,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 18:12:27,993 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:12:27,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:12:27,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1352854248, now seen corresponding path program 1 times [2020-10-15 18:12:27,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:12:27,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579516240] [2020-10-15 18:12:27,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:12:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:12:28,060 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-15 18:12:28,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579516240] [2020-10-15 18:12:28,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:12:28,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:12:28,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669596872] [2020-10-15 18:12:28,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:12:28,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:12:28,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:12:28,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:12:28,062 INFO L87 Difference]: Start difference. First operand 257 states and 629 transitions. Second operand 4 states. [2020-10-15 18:12:28,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:12:28,077 INFO L93 Difference]: Finished difference Result 355 states and 851 transitions. [2020-10-15 18:12:28,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:12:28,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-10-15 18:12:28,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:12:28,079 INFO L225 Difference]: With dead ends: 355 [2020-10-15 18:12:28,079 INFO L226 Difference]: Without dead ends: 161 [2020-10-15 18:12:28,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:12:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-10-15 18:12:28,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2020-10-15 18:12:28,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-10-15 18:12:28,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 353 transitions. [2020-10-15 18:12:28,084 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 353 transitions. Word has length 23 [2020-10-15 18:12:28,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:12:28,084 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 353 transitions. [2020-10-15 18:12:28,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:12:28,084 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 353 transitions. [2020-10-15 18:12:28,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-15 18:12:28,085 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:12:28,085 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, 1, 1] [2020-10-15 18:12:28,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 18:12:28,086 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:12:28,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:12:28,086 INFO L82 PathProgramCache]: Analyzing trace with hash -745269336, now seen corresponding path program 2 times [2020-10-15 18:12:28,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:12:28,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404740068] [2020-10-15 18:12:28,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:12:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:12:28,144 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-15 18:12:28,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404740068] [2020-10-15 18:12:28,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:12:28,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:12:28,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520245578] [2020-10-15 18:12:28,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:12:28,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:12:28,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:12:28,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:12:28,146 INFO L87 Difference]: Start difference. First operand 161 states and 353 transitions. Second operand 4 states. [2020-10-15 18:12:28,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:12:28,164 INFO L93 Difference]: Finished difference Result 208 states and 451 transitions. [2020-10-15 18:12:28,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:12:28,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-10-15 18:12:28,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:12:28,165 INFO L225 Difference]: With dead ends: 208 [2020-10-15 18:12:28,166 INFO L226 Difference]: Without dead ends: 116 [2020-10-15 18:12:28,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:12:28,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-10-15 18:12:28,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2020-10-15 18:12:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-10-15 18:12:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 243 transitions. [2020-10-15 18:12:28,169 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 243 transitions. Word has length 23 [2020-10-15 18:12:28,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:12:28,169 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 243 transitions. [2020-10-15 18:12:28,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:12:28,170 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 243 transitions. [2020-10-15 18:12:28,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-15 18:12:28,170 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:12:28,171 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, 1, 1] [2020-10-15 18:12:28,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 18:12:28,171 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:12:28,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:12:28,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1424404896, now seen corresponding path program 3 times [2020-10-15 18:12:28,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:12:28,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86665923] [2020-10-15 18:12:28,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:12:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:12:28,228 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:12:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:12:28,296 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:12:28,338 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 18:12:28,338 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 18:12:28,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 18:12:28,339 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 18:12:28,366 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L848-->L855: Formula: (let ((.cse6 (= 0 (mod ~a$r_buff0_thd0~0_In1210185233 256))) (.cse7 (= 0 (mod ~a$w_buff0_used~0_In1210185233 256))) (.cse9 (= 0 (mod ~a$w_buff1_used~0_In1210185233 256))) (.cse8 (= (mod ~a$r_buff1_thd0~0_In1210185233 256) 0))) (let ((.cse5 (or .cse9 .cse8)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse0 (not .cse7)) (.cse1 (not .cse6)) (.cse2 (or .cse6 .cse7))) (and (or (and .cse0 .cse1 (= ~a$w_buff0~0_In1210185233 ~a~0_Out1210185233)) (and .cse2 (or (and .cse3 .cse4 (= ~a$w_buff1~0_In1210185233 ~a~0_Out1210185233)) (and (= ~a~0_In1210185233 ~a~0_Out1210185233) .cse5)))) (or (and .cse5 (= ~a$w_buff1_used~0_Out1210185233 ~a$w_buff1_used~0_In1210185233)) (and .cse3 .cse4 (= ~a$w_buff1_used~0_Out1210185233 0))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1210185233 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1210185233|) (= ~a$r_buff1_thd0~0_Out1210185233 ~a$r_buff1_thd0~0_In1210185233) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1210185233 0)) (= ~a$r_buff0_thd0~0_In1210185233 ~a$r_buff0_thd0~0_Out1210185233) (or (and .cse0 (= ~a$w_buff0_used~0_Out1210185233 0) .cse1) (and .cse2 (= ~a$w_buff0_used~0_In1210185233 ~a$w_buff0_used~0_Out1210185233)))))) InVars {~a~0=~a~0_In1210185233, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1210185233|, ~a$w_buff1~0=~a$w_buff1~0_In1210185233, ~a$w_buff0~0=~a$w_buff0~0_In1210185233, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1210185233, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1210185233, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1210185233, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1210185233} OutVars{ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1210185233|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out1210185233, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1210185233|, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1210185233|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_Out1210185233, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1210185233|, ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1210185233|, ~a~0=~a~0_Out1210185233, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1210185233|, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1210185233|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1210185233, ~a$w_buff1~0=~a$w_buff1~0_In1210185233, ~a$w_buff0~0=~a$w_buff0~0_In1210185233, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out1210185233, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out1210185233} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite47, ~a$r_buff1_thd0~0, ~a$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite48, ~a$w_buff1_used~0] because there is no mapped edge [2020-10-15 18:12:28,375 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-15 18:12:28,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,376 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-15 18:12:28,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,377 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-15 18:12:28,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,377 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-15 18:12:28,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,377 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-15 18:12:28,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,378 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-15 18:12:28,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,378 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-15 18:12:28,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,379 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-15 18:12:28,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,379 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-15 18:12:28,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,380 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-15 18:12:28,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,383 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-15 18:12:28,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,383 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-15 18:12:28,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,384 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-15 18:12:28,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,384 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-15 18:12:28,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,385 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-15 18:12:28,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,385 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-15 18:12:28,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,390 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-15 18:12:28,391 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,391 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-15 18:12:28,391 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,391 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-15 18:12:28,391 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,391 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-15 18:12:28,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,392 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-15 18:12:28,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,393 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-15 18:12:28,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,394 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-15 18:12:28,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,394 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-15 18:12:28,395 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,395 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-15 18:12:28,395 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,395 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-15 18:12:28,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:12:28,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:12:28 BasicIcfg [2020-10-15 18:12:28,508 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 18:12:28,510 INFO L168 Benchmark]: Toolchain (without parser) took 10034.41 ms. Allocated memory was 253.2 MB in the beginning and 518.5 MB in the end (delta: 265.3 MB). Free memory was 208.4 MB in the beginning and 377.4 MB in the end (delta: -169.1 MB). Peak memory consumption was 96.2 MB. Max. memory is 14.2 GB. [2020-10-15 18:12:28,510 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 18:12:28,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 721.89 ms. Allocated memory was 253.2 MB in the beginning and 320.9 MB in the end (delta: 67.6 MB). Free memory was 208.4 MB in the beginning and 269.2 MB in the end (delta: -60.8 MB). Peak memory consumption was 29.4 MB. Max. memory is 14.2 GB. [2020-10-15 18:12:28,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.18 ms. Allocated memory is still 320.9 MB. Free memory was 269.2 MB in the beginning and 266.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:12:28,513 INFO L168 Benchmark]: Boogie Preprocessor took 39.98 ms. Allocated memory is still 320.9 MB. Free memory was 266.7 MB in the beginning and 264.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:12:28,513 INFO L168 Benchmark]: RCFGBuilder took 2025.04 ms. Allocated memory was 320.9 MB in the beginning and 361.8 MB in the end (delta: 40.9 MB). Free memory was 264.2 MB in the beginning and 191.9 MB in the end (delta: 72.3 MB). Peak memory consumption was 113.2 MB. Max. memory is 14.2 GB. [2020-10-15 18:12:28,514 INFO L168 Benchmark]: TraceAbstraction took 7182.73 ms. Allocated memory was 361.8 MB in the beginning and 518.5 MB in the end (delta: 156.8 MB). Free memory was 191.9 MB in the beginning and 377.4 MB in the end (delta: -185.5 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 18:12:28,518 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 721.89 ms. Allocated memory was 253.2 MB in the beginning and 320.9 MB in the end (delta: 67.6 MB). Free memory was 208.4 MB in the beginning and 269.2 MB in the end (delta: -60.8 MB). Peak memory consumption was 29.4 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 59.18 ms. Allocated memory is still 320.9 MB. Free memory was 269.2 MB in the beginning and 266.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 39.98 ms. Allocated memory is still 320.9 MB. Free memory was 266.7 MB in the beginning and 264.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2025.04 ms. Allocated memory was 320.9 MB in the beginning and 361.8 MB in the end (delta: 40.9 MB). Free memory was 264.2 MB in the beginning and 191.9 MB in the end (delta: 72.3 MB). Peak memory consumption was 113.2 MB. Max. memory is 14.2 GB. * TraceAbstraction took 7182.73 ms. Allocated memory was 361.8 MB in the beginning and 518.5 MB in the end (delta: 156.8 MB). Free memory was 191.9 MB in the beginning and 377.4 MB in the end (delta: -185.5 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1300 VarBasedMoverChecksPositive, 76 VarBasedMoverChecksNegative, 14 SemBasedMoverChecksPositive, 62 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 177 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.7s, 108 PlacesBefore, 38 PlacesAfterwards, 100 TransitionsBefore, 28 TransitionsAfterwards, 1928 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 81 TotalNumberOfCompositions, 5291 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L702] 0 int __unbuffered_p0_EBX = 0; [L704] 0 int __unbuffered_p1_EAX = 0; [L706] 0 int __unbuffered_p2_EAX = 0; [L708] 0 int __unbuffered_p2_EBX = 0; [L710] 0 int a = 0; [L711] 0 _Bool a$flush_delayed; [L712] 0 int a$mem_tmp; [L713] 0 _Bool a$r_buff0_thd0; [L714] 0 _Bool a$r_buff0_thd1; [L715] 0 _Bool a$r_buff0_thd2; [L716] 0 _Bool a$r_buff0_thd3; [L717] 0 _Bool a$r_buff1_thd0; [L718] 0 _Bool a$r_buff1_thd1; [L719] 0 _Bool a$r_buff1_thd2; [L720] 0 _Bool a$r_buff1_thd3; [L721] 0 _Bool a$read_delayed; [L722] 0 int *a$read_delayed_var; [L723] 0 int a$w_buff0; [L724] 0 _Bool a$w_buff0_used; [L725] 0 int a$w_buff1; [L726] 0 _Bool a$w_buff1_used; [L727] 0 _Bool main$tmp_guard0; [L728] 0 _Bool main$tmp_guard1; [L730] 0 int x = 0; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L839] 0 pthread_t t403; [L840] FCALL, FORK 0 pthread_create(&t403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] 0 pthread_t t404; [L842] FCALL, FORK 0 pthread_create(&t404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L843] 0 pthread_t t405; [L844] FCALL, FORK 0 pthread_create(&t405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L740] 1 a$w_buff1 = a$w_buff0 [L741] 1 a$w_buff0 = 1 [L742] 1 a$w_buff1_used = a$w_buff0_used [L743] 1 a$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L745] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L746] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L747] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L748] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L749] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 x = 1 [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L758] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L781] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L781] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L781] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L781] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L782] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L782] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L783] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L784] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L785] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L785] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L795] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L798] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L801] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L802] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L803] 3 a$flush_delayed = weak$$choice2 [L804] 3 a$mem_tmp = a [L805] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L805] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L806] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L806] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L806] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L806] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L807] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L807] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L808] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L808] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L809] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L810] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L811] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L812] 3 __unbuffered_p2_EBX = a [L813] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L813] 3 a = a$flush_delayed ? a$mem_tmp : a [L814] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=0, x=1, y=1, z=1] [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L817] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L818] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L818] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L819] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L819] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L820] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L820] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L821] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L821] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L761] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L761] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L762] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L763] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L763] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L764] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L765] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L768] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L770] 1 return 0; [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=0, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.8s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 234 SDtfs, 215 SDslu, 325 SDs, 0 SdLazy, 108 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1136occurred 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.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 4997 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...