/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix003_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:07:31,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:07:31,153 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:07:31,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:07:31,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:07:31,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:07:31,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:07:31,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:07:31,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:07:31,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:07:31,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:07:31,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:07:31,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:07:31,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:07:31,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:07:31,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:07:31,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:07:31,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:07:31,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:07:31,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:07:31,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:07:31,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:07:31,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:07:31,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:07:31,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:07:31,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:07:31,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:07:31,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:07:31,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:07:31,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:07:31,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:07:31,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:07:31,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:07:31,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:07:31,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:07:31,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:07:31,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:07:31,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:07:31,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:07:31,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:07:31,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:07:31,215 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 [2019-12-18 12:07:31,233 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:07:31,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:07:31,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:07:31,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:07:31,237 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:07:31,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:07:31,237 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:07:31,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:07:31,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:07:31,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:07:31,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:07:31,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:07:31,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:07:31,239 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:07:31,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:07:31,240 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:07:31,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:07:31,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:07:31,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:07:31,241 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:07:31,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:07:31,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:07:31,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:07:31,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:07:31,242 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:07:31,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:07:31,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:07:31,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:07:31,243 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:07:31,243 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:07:31,501 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:07:31,521 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:07:31,526 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:07:31,528 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:07:31,528 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:07:31,529 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_rmo.oepc.i [2019-12-18 12:07:31,603 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e1f5a30/a2e265bc5576408bbb642d8d91473cc3/FLAG50e715fa5 [2019-12-18 12:07:32,181 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:07:32,182 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_rmo.oepc.i [2019-12-18 12:07:32,212 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e1f5a30/a2e265bc5576408bbb642d8d91473cc3/FLAG50e715fa5 [2019-12-18 12:07:32,504 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e1f5a30/a2e265bc5576408bbb642d8d91473cc3 [2019-12-18 12:07:32,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:07:32,514 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:07:32,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:07:32,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:07:32,518 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:07:32,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:07:32" (1/1) ... [2019-12-18 12:07:32,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ffe542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:32, skipping insertion in model container [2019-12-18 12:07:32,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:07:32" (1/1) ... [2019-12-18 12:07:32,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:07:32,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:07:33,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:07:33,135 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:07:33,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:07:33,316 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:07:33,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:33 WrapperNode [2019-12-18 12:07:33,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:07:33,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:07:33,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:07:33,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:07:33,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:33" (1/1) ... [2019-12-18 12:07:33,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:33" (1/1) ... [2019-12-18 12:07:33,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:07:33,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:07:33,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:07:33,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:07:33,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:33" (1/1) ... [2019-12-18 12:07:33,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:33" (1/1) ... [2019-12-18 12:07:33,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:33" (1/1) ... [2019-12-18 12:07:33,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:33" (1/1) ... [2019-12-18 12:07:33,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:33" (1/1) ... [2019-12-18 12:07:33,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:33" (1/1) ... [2019-12-18 12:07:33,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:33" (1/1) ... [2019-12-18 12:07:33,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:07:33,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:07:33,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:07:33,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:07:33,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:07:33,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:07:33,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:07:33,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:07:33,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:07:33,495 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:07:33,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:07:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:07:33,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:07:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:07:33,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:07:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:07:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:07:33,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:07:33,499 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:07:34,279 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:07:34,280 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:07:34,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:07:34 BoogieIcfgContainer [2019-12-18 12:07:34,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:07:34,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:07:34,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:07:34,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:07:34,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:07:32" (1/3) ... [2019-12-18 12:07:34,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fce58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:07:34, skipping insertion in model container [2019-12-18 12:07:34,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:33" (2/3) ... [2019-12-18 12:07:34,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fce58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:07:34, skipping insertion in model container [2019-12-18 12:07:34,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:07:34" (3/3) ... [2019-12-18 12:07:34,290 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_rmo.oepc.i [2019-12-18 12:07:34,301 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:07:34,301 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:07:34,310 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:07:34,311 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:07:34,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,354 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,354 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,354 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,355 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,356 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,365 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,365 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,401 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,401 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,452 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,453 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,470 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,470 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,470 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,472 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,472 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:34,494 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:07:34,516 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:07:34,516 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:07:34,516 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:07:34,516 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:07:34,516 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:07:34,516 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:07:34,516 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:07:34,516 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:07:34,531 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 12:07:34,532 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 12:07:34,619 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 12:07:34,619 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:07:34,639 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:07:34,669 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 12:07:34,717 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 12:07:34,717 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:07:34,725 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:07:34,748 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:07:34,749 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:07:39,993 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 12:07:40,142 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 12:07:40,469 INFO L206 etLargeBlockEncoding]: Checked pairs total: 132619 [2019-12-18 12:07:40,469 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 12:07:40,473 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-18 12:08:00,831 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-18 12:08:00,833 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-18 12:08:00,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:08:00,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:00,839 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:08:00,839 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:00,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:00,845 INFO L82 PathProgramCache]: Analyzing trace with hash 919842, now seen corresponding path program 1 times [2019-12-18 12:08:00,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:00,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140619388] [2019-12-18 12:08:00,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:01,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140619388] [2019-12-18 12:08:01,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:01,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:08:01,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157189847] [2019-12-18 12:08:01,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:08:01,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:01,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:08:01,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:01,118 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-18 12:08:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:04,772 INFO L93 Difference]: Finished difference Result 119613 states and 515253 transitions. [2019-12-18 12:08:04,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:08:04,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:08:04,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:05,431 INFO L225 Difference]: With dead ends: 119613 [2019-12-18 12:08:05,431 INFO L226 Difference]: Without dead ends: 105755 [2019-12-18 12:08:05,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:11,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105755 states. [2019-12-18 12:08:14,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105755 to 105755. [2019-12-18 12:08:14,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105755 states. [2019-12-18 12:08:18,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105755 states to 105755 states and 454361 transitions. [2019-12-18 12:08:18,392 INFO L78 Accepts]: Start accepts. Automaton has 105755 states and 454361 transitions. Word has length 3 [2019-12-18 12:08:18,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:18,392 INFO L462 AbstractCegarLoop]: Abstraction has 105755 states and 454361 transitions. [2019-12-18 12:08:18,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:08:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand 105755 states and 454361 transitions. [2019-12-18 12:08:18,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:08:18,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:18,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:18,397 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:18,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:18,398 INFO L82 PathProgramCache]: Analyzing trace with hash 474732739, now seen corresponding path program 1 times [2019-12-18 12:08:18,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:18,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220617788] [2019-12-18 12:08:18,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:18,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220617788] [2019-12-18 12:08:18,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:18,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:08:18,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841708033] [2019-12-18 12:08:18,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:08:18,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:18,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:08:18,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:08:18,518 INFO L87 Difference]: Start difference. First operand 105755 states and 454361 transitions. Second operand 4 states. [2019-12-18 12:08:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:23,921 INFO L93 Difference]: Finished difference Result 168845 states and 694815 transitions. [2019-12-18 12:08:23,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:08:23,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:08:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:24,774 INFO L225 Difference]: With dead ends: 168845 [2019-12-18 12:08:24,774 INFO L226 Difference]: Without dead ends: 168747 [2019-12-18 12:08:24,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:08:29,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168747 states. [2019-12-18 12:08:33,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168747 to 153153. [2019-12-18 12:08:33,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153153 states. [2019-12-18 12:08:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153153 states to 153153 states and 639357 transitions. [2019-12-18 12:08:33,935 INFO L78 Accepts]: Start accepts. Automaton has 153153 states and 639357 transitions. Word has length 11 [2019-12-18 12:08:33,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:33,936 INFO L462 AbstractCegarLoop]: Abstraction has 153153 states and 639357 transitions. [2019-12-18 12:08:33,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:08:33,936 INFO L276 IsEmpty]: Start isEmpty. Operand 153153 states and 639357 transitions. [2019-12-18 12:08:33,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:08:33,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:33,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:33,942 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:33,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:33,943 INFO L82 PathProgramCache]: Analyzing trace with hash -512415605, now seen corresponding path program 1 times [2019-12-18 12:08:33,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:33,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716937624] [2019-12-18 12:08:33,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:34,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:34,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716937624] [2019-12-18 12:08:34,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:34,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:08:34,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940797369] [2019-12-18 12:08:34,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:08:34,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:34,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:08:34,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:34,027 INFO L87 Difference]: Start difference. First operand 153153 states and 639357 transitions. Second operand 3 states. [2019-12-18 12:08:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:34,179 INFO L93 Difference]: Finished difference Result 33476 states and 109893 transitions. [2019-12-18 12:08:34,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:08:34,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:08:34,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:34,251 INFO L225 Difference]: With dead ends: 33476 [2019-12-18 12:08:34,252 INFO L226 Difference]: Without dead ends: 33476 [2019-12-18 12:08:34,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:34,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33476 states. [2019-12-18 12:08:39,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33476 to 33476. [2019-12-18 12:08:39,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33476 states. [2019-12-18 12:08:39,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33476 states to 33476 states and 109893 transitions. [2019-12-18 12:08:39,731 INFO L78 Accepts]: Start accepts. Automaton has 33476 states and 109893 transitions. Word has length 13 [2019-12-18 12:08:39,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:39,731 INFO L462 AbstractCegarLoop]: Abstraction has 33476 states and 109893 transitions. [2019-12-18 12:08:39,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:08:39,731 INFO L276 IsEmpty]: Start isEmpty. Operand 33476 states and 109893 transitions. [2019-12-18 12:08:39,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:08:39,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:39,734 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:39,734 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:39,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:39,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1719969010, now seen corresponding path program 1 times [2019-12-18 12:08:39,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:39,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475751066] [2019-12-18 12:08:39,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:39,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475751066] [2019-12-18 12:08:39,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:39,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:08:39,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992386105] [2019-12-18 12:08:39,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:08:39,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:39,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:08:39,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:08:39,819 INFO L87 Difference]: Start difference. First operand 33476 states and 109893 transitions. Second operand 4 states. [2019-12-18 12:08:40,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:40,162 INFO L93 Difference]: Finished difference Result 41508 states and 134890 transitions. [2019-12-18 12:08:40,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:08:40,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:08:40,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:40,261 INFO L225 Difference]: With dead ends: 41508 [2019-12-18 12:08:40,261 INFO L226 Difference]: Without dead ends: 41508 [2019-12-18 12:08:40,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:08:40,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41508 states. [2019-12-18 12:08:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41508 to 37458. [2019-12-18 12:08:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37458 states. [2019-12-18 12:08:40,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37458 states to 37458 states and 122375 transitions. [2019-12-18 12:08:40,966 INFO L78 Accepts]: Start accepts. Automaton has 37458 states and 122375 transitions. Word has length 16 [2019-12-18 12:08:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:40,967 INFO L462 AbstractCegarLoop]: Abstraction has 37458 states and 122375 transitions. [2019-12-18 12:08:40,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:08:40,967 INFO L276 IsEmpty]: Start isEmpty. Operand 37458 states and 122375 transitions. [2019-12-18 12:08:40,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:08:40,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:40,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:40,970 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:40,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:40,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1720071868, now seen corresponding path program 1 times [2019-12-18 12:08:40,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:40,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331817533] [2019-12-18 12:08:40,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:41,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331817533] [2019-12-18 12:08:41,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:41,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:08:41,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048735807] [2019-12-18 12:08:41,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:08:41,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:41,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:08:41,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:41,034 INFO L87 Difference]: Start difference. First operand 37458 states and 122375 transitions. Second operand 3 states. [2019-12-18 12:08:41,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:41,648 INFO L93 Difference]: Finished difference Result 54855 states and 178352 transitions. [2019-12-18 12:08:41,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:08:41,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 12:08:41,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:41,742 INFO L225 Difference]: With dead ends: 54855 [2019-12-18 12:08:41,742 INFO L226 Difference]: Without dead ends: 54855 [2019-12-18 12:08:41,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:41,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54855 states. [2019-12-18 12:08:42,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54855 to 41888. [2019-12-18 12:08:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41888 states. [2019-12-18 12:08:42,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41888 states to 41888 states and 137861 transitions. [2019-12-18 12:08:42,528 INFO L78 Accepts]: Start accepts. Automaton has 41888 states and 137861 transitions. Word has length 16 [2019-12-18 12:08:42,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:42,528 INFO L462 AbstractCegarLoop]: Abstraction has 41888 states and 137861 transitions. [2019-12-18 12:08:42,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:08:42,528 INFO L276 IsEmpty]: Start isEmpty. Operand 41888 states and 137861 transitions. [2019-12-18 12:08:42,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:08:42,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:42,531 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:42,532 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:42,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:42,532 INFO L82 PathProgramCache]: Analyzing trace with hash 759335912, now seen corresponding path program 1 times [2019-12-18 12:08:42,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:42,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117249847] [2019-12-18 12:08:42,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:42,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117249847] [2019-12-18 12:08:42,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:42,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:08:42,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140453843] [2019-12-18 12:08:42,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:08:42,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:42,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:08:42,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:08:42,639 INFO L87 Difference]: Start difference. First operand 41888 states and 137861 transitions. Second operand 4 states. [2019-12-18 12:08:42,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:42,992 INFO L93 Difference]: Finished difference Result 49903 states and 162773 transitions. [2019-12-18 12:08:42,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:08:42,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:08:42,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:43,081 INFO L225 Difference]: With dead ends: 49903 [2019-12-18 12:08:43,082 INFO L226 Difference]: Without dead ends: 49903 [2019-12-18 12:08:43,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:08:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49903 states. [2019-12-18 12:08:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49903 to 43402. [2019-12-18 12:08:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43402 states. [2019-12-18 12:08:44,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43402 states to 43402 states and 142861 transitions. [2019-12-18 12:08:44,208 INFO L78 Accepts]: Start accepts. Automaton has 43402 states and 142861 transitions. Word has length 16 [2019-12-18 12:08:44,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:44,208 INFO L462 AbstractCegarLoop]: Abstraction has 43402 states and 142861 transitions. [2019-12-18 12:08:44,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:08:44,209 INFO L276 IsEmpty]: Start isEmpty. Operand 43402 states and 142861 transitions. [2019-12-18 12:08:44,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:08:44,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:44,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:44,218 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:44,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:44,219 INFO L82 PathProgramCache]: Analyzing trace with hash -390431288, now seen corresponding path program 1 times [2019-12-18 12:08:44,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:44,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807548320] [2019-12-18 12:08:44,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:44,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:44,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807548320] [2019-12-18 12:08:44,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:44,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:08:44,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105738032] [2019-12-18 12:08:44,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:08:44,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:44,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:08:44,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:08:44,327 INFO L87 Difference]: Start difference. First operand 43402 states and 142861 transitions. Second operand 5 states. [2019-12-18 12:08:45,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:45,019 INFO L93 Difference]: Finished difference Result 59763 states and 191505 transitions. [2019-12-18 12:08:45,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:08:45,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:08:45,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:45,126 INFO L225 Difference]: With dead ends: 59763 [2019-12-18 12:08:45,126 INFO L226 Difference]: Without dead ends: 59749 [2019-12-18 12:08:45,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:08:45,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59749 states. [2019-12-18 12:08:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59749 to 44536. [2019-12-18 12:08:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44536 states. [2019-12-18 12:08:46,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44536 states to 44536 states and 146317 transitions. [2019-12-18 12:08:46,344 INFO L78 Accepts]: Start accepts. Automaton has 44536 states and 146317 transitions. Word has length 22 [2019-12-18 12:08:46,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:46,345 INFO L462 AbstractCegarLoop]: Abstraction has 44536 states and 146317 transitions. [2019-12-18 12:08:46,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:08:46,345 INFO L276 IsEmpty]: Start isEmpty. Operand 44536 states and 146317 transitions. [2019-12-18 12:08:46,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:08:46,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:46,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:46,355 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:46,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:46,355 INFO L82 PathProgramCache]: Analyzing trace with hash 2088873634, now seen corresponding path program 1 times [2019-12-18 12:08:46,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:46,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208774264] [2019-12-18 12:08:46,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:46,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208774264] [2019-12-18 12:08:46,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:46,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:08:46,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313366646] [2019-12-18 12:08:46,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:08:46,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:46,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:08:46,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:08:46,437 INFO L87 Difference]: Start difference. First operand 44536 states and 146317 transitions. Second operand 5 states. [2019-12-18 12:08:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:47,102 INFO L93 Difference]: Finished difference Result 62779 states and 200555 transitions. [2019-12-18 12:08:47,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:08:47,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:08:47,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:47,213 INFO L225 Difference]: With dead ends: 62779 [2019-12-18 12:08:47,214 INFO L226 Difference]: Without dead ends: 62765 [2019-12-18 12:08:47,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:08:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62765 states. [2019-12-18 12:08:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62765 to 43009. [2019-12-18 12:08:48,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43009 states. [2019-12-18 12:08:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43009 states to 43009 states and 141377 transitions. [2019-12-18 12:08:48,456 INFO L78 Accepts]: Start accepts. Automaton has 43009 states and 141377 transitions. Word has length 22 [2019-12-18 12:08:48,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:48,456 INFO L462 AbstractCegarLoop]: Abstraction has 43009 states and 141377 transitions. [2019-12-18 12:08:48,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:08:48,456 INFO L276 IsEmpty]: Start isEmpty. Operand 43009 states and 141377 transitions. [2019-12-18 12:08:48,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:08:48,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:48,467 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:48,468 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:48,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:48,468 INFO L82 PathProgramCache]: Analyzing trace with hash -697105977, now seen corresponding path program 1 times [2019-12-18 12:08:48,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:48,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092913574] [2019-12-18 12:08:48,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:48,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:48,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092913574] [2019-12-18 12:08:48,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:48,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:08:48,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36388765] [2019-12-18 12:08:48,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:08:48,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:48,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:08:48,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:08:48,522 INFO L87 Difference]: Start difference. First operand 43009 states and 141377 transitions. Second operand 4 states. [2019-12-18 12:08:48,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:48,607 INFO L93 Difference]: Finished difference Result 17503 states and 54477 transitions. [2019-12-18 12:08:48,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:08:48,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:08:48,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:48,631 INFO L225 Difference]: With dead ends: 17503 [2019-12-18 12:08:48,632 INFO L226 Difference]: Without dead ends: 17503 [2019-12-18 12:08:48,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:08:48,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17503 states. [2019-12-18 12:08:48,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17503 to 17140. [2019-12-18 12:08:48,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-18 12:08:48,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 53441 transitions. [2019-12-18 12:08:48,906 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 53441 transitions. Word has length 25 [2019-12-18 12:08:48,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:48,907 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 53441 transitions. [2019-12-18 12:08:48,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:08:48,907 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 53441 transitions. [2019-12-18 12:08:48,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:08:48,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:48,921 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:48,921 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:48,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:48,921 INFO L82 PathProgramCache]: Analyzing trace with hash 967503752, now seen corresponding path program 1 times [2019-12-18 12:08:48,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:48,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070281877] [2019-12-18 12:08:48,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:48,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:48,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070281877] [2019-12-18 12:08:48,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:48,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:08:48,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269365504] [2019-12-18 12:08:48,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:08:48,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:48,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:08:48,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:48,958 INFO L87 Difference]: Start difference. First operand 17140 states and 53441 transitions. Second operand 3 states. [2019-12-18 12:08:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:49,050 INFO L93 Difference]: Finished difference Result 22571 states and 66756 transitions. [2019-12-18 12:08:49,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:08:49,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:08:49,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:49,080 INFO L225 Difference]: With dead ends: 22571 [2019-12-18 12:08:49,080 INFO L226 Difference]: Without dead ends: 22571 [2019-12-18 12:08:49,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:49,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22571 states. [2019-12-18 12:08:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22571 to 17140. [2019-12-18 12:08:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-18 12:08:49,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 51063 transitions. [2019-12-18 12:08:49,361 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 51063 transitions. Word has length 27 [2019-12-18 12:08:49,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:49,362 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 51063 transitions. [2019-12-18 12:08:49,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:08:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 51063 transitions. [2019-12-18 12:08:49,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:08:49,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:49,374 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:49,375 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:49,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:49,375 INFO L82 PathProgramCache]: Analyzing trace with hash 196927527, now seen corresponding path program 1 times [2019-12-18 12:08:49,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:49,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220220245] [2019-12-18 12:08:49,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:49,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220220245] [2019-12-18 12:08:49,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:49,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:08:49,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225208587] [2019-12-18 12:08:49,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:08:49,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:49,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:08:49,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:08:49,441 INFO L87 Difference]: Start difference. First operand 17140 states and 51063 transitions. Second operand 5 states. [2019-12-18 12:08:49,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:49,824 INFO L93 Difference]: Finished difference Result 21146 states and 62188 transitions. [2019-12-18 12:08:49,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:08:49,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 12:08:49,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:49,865 INFO L225 Difference]: With dead ends: 21146 [2019-12-18 12:08:49,865 INFO L226 Difference]: Without dead ends: 21146 [2019-12-18 12:08:49,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:08:49,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21146 states. [2019-12-18 12:08:50,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21146 to 19815. [2019-12-18 12:08:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19815 states. [2019-12-18 12:08:50,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19815 states to 19815 states and 58833 transitions. [2019-12-18 12:08:50,442 INFO L78 Accepts]: Start accepts. Automaton has 19815 states and 58833 transitions. Word has length 27 [2019-12-18 12:08:50,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:50,442 INFO L462 AbstractCegarLoop]: Abstraction has 19815 states and 58833 transitions. [2019-12-18 12:08:50,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:08:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 19815 states and 58833 transitions. [2019-12-18 12:08:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:08:50,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:50,457 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:50,457 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:50,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:50,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1188103809, now seen corresponding path program 1 times [2019-12-18 12:08:50,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:50,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339920365] [2019-12-18 12:08:50,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:50,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339920365] [2019-12-18 12:08:50,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:50,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:08:50,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603235137] [2019-12-18 12:08:50,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:08:50,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:50,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:08:50,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:08:50,538 INFO L87 Difference]: Start difference. First operand 19815 states and 58833 transitions. Second operand 5 states. [2019-12-18 12:08:50,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:50,904 INFO L93 Difference]: Finished difference Result 23192 states and 68046 transitions. [2019-12-18 12:08:50,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:08:50,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:08:50,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:50,946 INFO L225 Difference]: With dead ends: 23192 [2019-12-18 12:08:50,946 INFO L226 Difference]: Without dead ends: 23192 [2019-12-18 12:08:50,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:08:51,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23192 states. [2019-12-18 12:08:51,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23192 to 19826. [2019-12-18 12:08:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19826 states. [2019-12-18 12:08:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19826 states to 19826 states and 58720 transitions. [2019-12-18 12:08:51,295 INFO L78 Accepts]: Start accepts. Automaton has 19826 states and 58720 transitions. Word has length 28 [2019-12-18 12:08:51,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:51,296 INFO L462 AbstractCegarLoop]: Abstraction has 19826 states and 58720 transitions. [2019-12-18 12:08:51,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:08:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 19826 states and 58720 transitions. [2019-12-18 12:08:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:08:51,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:51,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:51,316 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:51,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:51,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1042720045, now seen corresponding path program 1 times [2019-12-18 12:08:51,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:51,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124310610] [2019-12-18 12:08:51,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:51,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124310610] [2019-12-18 12:08:51,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:51,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:08:51,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401552377] [2019-12-18 12:08:51,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:08:51,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:51,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:08:51,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:08:51,402 INFO L87 Difference]: Start difference. First operand 19826 states and 58720 transitions. Second operand 6 states. [2019-12-18 12:08:52,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:52,064 INFO L93 Difference]: Finished difference Result 26785 states and 78213 transitions. [2019-12-18 12:08:52,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:08:52,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 12:08:52,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:52,100 INFO L225 Difference]: With dead ends: 26785 [2019-12-18 12:08:52,101 INFO L226 Difference]: Without dead ends: 26785 [2019-12-18 12:08:52,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:08:52,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26785 states. [2019-12-18 12:08:52,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26785 to 20969. [2019-12-18 12:08:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20969 states. [2019-12-18 12:08:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 62212 transitions. [2019-12-18 12:08:52,450 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 62212 transitions. Word has length 33 [2019-12-18 12:08:52,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:52,450 INFO L462 AbstractCegarLoop]: Abstraction has 20969 states and 62212 transitions. [2019-12-18 12:08:52,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:08:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 62212 transitions. [2019-12-18 12:08:52,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:08:52,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:52,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:52,471 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:52,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:52,472 INFO L82 PathProgramCache]: Analyzing trace with hash -738339527, now seen corresponding path program 1 times [2019-12-18 12:08:52,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:52,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584683541] [2019-12-18 12:08:52,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:52,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:52,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584683541] [2019-12-18 12:08:52,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:52,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:08:52,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875951863] [2019-12-18 12:08:52,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:08:52,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:52,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:08:52,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:08:52,559 INFO L87 Difference]: Start difference. First operand 20969 states and 62212 transitions. Second operand 6 states. [2019-12-18 12:08:53,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:53,255 INFO L93 Difference]: Finished difference Result 25915 states and 75815 transitions. [2019-12-18 12:08:53,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:08:53,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 12:08:53,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:53,302 INFO L225 Difference]: With dead ends: 25915 [2019-12-18 12:08:53,303 INFO L226 Difference]: Without dead ends: 25915 [2019-12-18 12:08:53,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:08:53,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25915 states. [2019-12-18 12:08:53,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25915 to 17954. [2019-12-18 12:08:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17954 states. [2019-12-18 12:08:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17954 states to 17954 states and 53419 transitions. [2019-12-18 12:08:53,840 INFO L78 Accepts]: Start accepts. Automaton has 17954 states and 53419 transitions. Word has length 34 [2019-12-18 12:08:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:53,840 INFO L462 AbstractCegarLoop]: Abstraction has 17954 states and 53419 transitions. [2019-12-18 12:08:53,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:08:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 17954 states and 53419 transitions. [2019-12-18 12:08:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:08:53,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:53,860 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:53,861 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:53,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:53,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1814402429, now seen corresponding path program 1 times [2019-12-18 12:08:53,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:53,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639434022] [2019-12-18 12:08:53,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:53,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639434022] [2019-12-18 12:08:53,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:53,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:08:53,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172718800] [2019-12-18 12:08:53,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:08:53,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:53,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:08:53,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:53,918 INFO L87 Difference]: Start difference. First operand 17954 states and 53419 transitions. Second operand 3 states. [2019-12-18 12:08:53,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:53,996 INFO L93 Difference]: Finished difference Result 17953 states and 53417 transitions. [2019-12-18 12:08:53,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:08:53,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:08:53,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:54,029 INFO L225 Difference]: With dead ends: 17953 [2019-12-18 12:08:54,029 INFO L226 Difference]: Without dead ends: 17953 [2019-12-18 12:08:54,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:54,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17953 states. [2019-12-18 12:08:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17953 to 17953. [2019-12-18 12:08:54,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17953 states. [2019-12-18 12:08:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17953 states to 17953 states and 53417 transitions. [2019-12-18 12:08:54,321 INFO L78 Accepts]: Start accepts. Automaton has 17953 states and 53417 transitions. Word has length 39 [2019-12-18 12:08:54,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:54,321 INFO L462 AbstractCegarLoop]: Abstraction has 17953 states and 53417 transitions. [2019-12-18 12:08:54,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:08:54,321 INFO L276 IsEmpty]: Start isEmpty. Operand 17953 states and 53417 transitions. [2019-12-18 12:08:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:08:54,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:54,337 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:54,337 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:54,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:54,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1557699484, now seen corresponding path program 1 times [2019-12-18 12:08:54,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:54,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242370151] [2019-12-18 12:08:54,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:54,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:54,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242370151] [2019-12-18 12:08:54,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:54,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:08:54,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648359706] [2019-12-18 12:08:54,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:08:54,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:54,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:08:54,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:54,426 INFO L87 Difference]: Start difference. First operand 17953 states and 53417 transitions. Second operand 3 states. [2019-12-18 12:08:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:54,510 INFO L93 Difference]: Finished difference Result 17953 states and 53342 transitions. [2019-12-18 12:08:54,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:08:54,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 12:08:54,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:54,541 INFO L225 Difference]: With dead ends: 17953 [2019-12-18 12:08:54,541 INFO L226 Difference]: Without dead ends: 17953 [2019-12-18 12:08:54,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17953 states. [2019-12-18 12:08:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17953 to 16037. [2019-12-18 12:08:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16037 states. [2019-12-18 12:08:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16037 states to 16037 states and 48092 transitions. [2019-12-18 12:08:54,999 INFO L78 Accepts]: Start accepts. Automaton has 16037 states and 48092 transitions. Word has length 40 [2019-12-18 12:08:54,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:54,999 INFO L462 AbstractCegarLoop]: Abstraction has 16037 states and 48092 transitions. [2019-12-18 12:08:54,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:08:54,999 INFO L276 IsEmpty]: Start isEmpty. Operand 16037 states and 48092 transitions. [2019-12-18 12:08:55,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 12:08:55,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:55,021 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:55,021 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:55,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:55,022 INFO L82 PathProgramCache]: Analyzing trace with hash -935567252, now seen corresponding path program 1 times [2019-12-18 12:08:55,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:55,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220395537] [2019-12-18 12:08:55,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:55,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:55,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220395537] [2019-12-18 12:08:55,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:55,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:08:55,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562004865] [2019-12-18 12:08:55,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:08:55,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:55,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:08:55,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:08:55,076 INFO L87 Difference]: Start difference. First operand 16037 states and 48092 transitions. Second operand 5 states. [2019-12-18 12:08:55,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:55,155 INFO L93 Difference]: Finished difference Result 14868 states and 45573 transitions. [2019-12-18 12:08:55,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:08:55,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 12:08:55,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:55,181 INFO L225 Difference]: With dead ends: 14868 [2019-12-18 12:08:55,181 INFO L226 Difference]: Without dead ends: 14868 [2019-12-18 12:08:55,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:08:55,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14868 states. [2019-12-18 12:08:55,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14868 to 14868. [2019-12-18 12:08:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14868 states. [2019-12-18 12:08:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14868 states to 14868 states and 45573 transitions. [2019-12-18 12:08:55,403 INFO L78 Accepts]: Start accepts. Automaton has 14868 states and 45573 transitions. Word has length 41 [2019-12-18 12:08:55,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:55,403 INFO L462 AbstractCegarLoop]: Abstraction has 14868 states and 45573 transitions. [2019-12-18 12:08:55,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:08:55,403 INFO L276 IsEmpty]: Start isEmpty. Operand 14868 states and 45573 transitions. [2019-12-18 12:08:55,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:08:55,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:55,424 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:55,424 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:55,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:55,425 INFO L82 PathProgramCache]: Analyzing trace with hash -344664589, now seen corresponding path program 1 times [2019-12-18 12:08:55,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:55,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913905413] [2019-12-18 12:08:55,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:55,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913905413] [2019-12-18 12:08:55,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:55,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:08:55,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097139025] [2019-12-18 12:08:55,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:08:55,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:55,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:08:55,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:08:55,513 INFO L87 Difference]: Start difference. First operand 14868 states and 45573 transitions. Second operand 7 states. [2019-12-18 12:08:56,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:56,074 INFO L93 Difference]: Finished difference Result 43451 states and 132340 transitions. [2019-12-18 12:08:56,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:08:56,075 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:08:56,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:56,149 INFO L225 Difference]: With dead ends: 43451 [2019-12-18 12:08:56,150 INFO L226 Difference]: Without dead ends: 33731 [2019-12-18 12:08:56,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:08:56,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33731 states. [2019-12-18 12:08:56,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33731 to 18516. [2019-12-18 12:08:56,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18516 states. [2019-12-18 12:08:56,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18516 states to 18516 states and 56848 transitions. [2019-12-18 12:08:56,834 INFO L78 Accepts]: Start accepts. Automaton has 18516 states and 56848 transitions. Word has length 65 [2019-12-18 12:08:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:56,834 INFO L462 AbstractCegarLoop]: Abstraction has 18516 states and 56848 transitions. [2019-12-18 12:08:56,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:08:56,835 INFO L276 IsEmpty]: Start isEmpty. Operand 18516 states and 56848 transitions. [2019-12-18 12:08:56,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:08:56,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:56,862 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:56,862 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:56,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:56,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1662753005, now seen corresponding path program 2 times [2019-12-18 12:08:56,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:56,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452304832] [2019-12-18 12:08:56,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:56,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:56,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452304832] [2019-12-18 12:08:56,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:56,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:08:56,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985822110] [2019-12-18 12:08:56,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:08:56,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:56,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:08:56,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:08:56,950 INFO L87 Difference]: Start difference. First operand 18516 states and 56848 transitions. Second operand 7 states. [2019-12-18 12:08:57,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:57,427 INFO L93 Difference]: Finished difference Result 49218 states and 148223 transitions. [2019-12-18 12:08:57,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:08:57,427 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:08:57,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:57,476 INFO L225 Difference]: With dead ends: 49218 [2019-12-18 12:08:57,476 INFO L226 Difference]: Without dead ends: 35999 [2019-12-18 12:08:57,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:08:57,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35999 states. [2019-12-18 12:08:57,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35999 to 21947. [2019-12-18 12:08:57,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21947 states. [2019-12-18 12:08:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21947 states to 21947 states and 66970 transitions. [2019-12-18 12:08:57,918 INFO L78 Accepts]: Start accepts. Automaton has 21947 states and 66970 transitions. Word has length 65 [2019-12-18 12:08:57,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:57,918 INFO L462 AbstractCegarLoop]: Abstraction has 21947 states and 66970 transitions. [2019-12-18 12:08:57,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:08:57,918 INFO L276 IsEmpty]: Start isEmpty. Operand 21947 states and 66970 transitions. [2019-12-18 12:08:57,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:08:57,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:57,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:57,940 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:57,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:57,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1251052155, now seen corresponding path program 3 times [2019-12-18 12:08:57,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:57,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670767475] [2019-12-18 12:08:57,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:58,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670767475] [2019-12-18 12:08:58,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:58,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:08:58,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086517962] [2019-12-18 12:08:58,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:08:58,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:58,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:08:58,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:08:58,039 INFO L87 Difference]: Start difference. First operand 21947 states and 66970 transitions. Second operand 7 states. [2019-12-18 12:08:58,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:58,477 INFO L93 Difference]: Finished difference Result 42421 states and 127518 transitions. [2019-12-18 12:08:58,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:08:58,478 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:08:58,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:58,530 INFO L225 Difference]: With dead ends: 42421 [2019-12-18 12:08:58,530 INFO L226 Difference]: Without dead ends: 39710 [2019-12-18 12:08:58,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:08:58,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39710 states. [2019-12-18 12:08:59,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39710 to 22043. [2019-12-18 12:08:59,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22043 states. [2019-12-18 12:08:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22043 states to 22043 states and 67314 transitions. [2019-12-18 12:08:59,257 INFO L78 Accepts]: Start accepts. Automaton has 22043 states and 67314 transitions. Word has length 65 [2019-12-18 12:08:59,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:59,258 INFO L462 AbstractCegarLoop]: Abstraction has 22043 states and 67314 transitions. [2019-12-18 12:08:59,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:08:59,258 INFO L276 IsEmpty]: Start isEmpty. Operand 22043 states and 67314 transitions. [2019-12-18 12:08:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:08:59,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:59,283 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:59,283 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:59,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:59,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1414187811, now seen corresponding path program 4 times [2019-12-18 12:08:59,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:59,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494863032] [2019-12-18 12:08:59,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:59,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:59,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494863032] [2019-12-18 12:08:59,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:59,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:08:59,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746229134] [2019-12-18 12:08:59,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:08:59,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:59,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:08:59,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:59,343 INFO L87 Difference]: Start difference. First operand 22043 states and 67314 transitions. Second operand 3 states. [2019-12-18 12:08:59,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:59,502 INFO L93 Difference]: Finished difference Result 25110 states and 76797 transitions. [2019-12-18 12:08:59,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:08:59,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:08:59,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:59,548 INFO L225 Difference]: With dead ends: 25110 [2019-12-18 12:08:59,548 INFO L226 Difference]: Without dead ends: 25110 [2019-12-18 12:08:59,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:59,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25110 states. [2019-12-18 12:08:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25110 to 20735. [2019-12-18 12:08:59,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20735 states. [2019-12-18 12:08:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20735 states to 20735 states and 64104 transitions. [2019-12-18 12:08:59,892 INFO L78 Accepts]: Start accepts. Automaton has 20735 states and 64104 transitions. Word has length 65 [2019-12-18 12:08:59,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:59,893 INFO L462 AbstractCegarLoop]: Abstraction has 20735 states and 64104 transitions. [2019-12-18 12:08:59,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:08:59,893 INFO L276 IsEmpty]: Start isEmpty. Operand 20735 states and 64104 transitions. [2019-12-18 12:08:59,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:08:59,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:59,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:59,924 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:59,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:59,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1928104461, now seen corresponding path program 1 times [2019-12-18 12:08:59,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:59,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41295983] [2019-12-18 12:08:59,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:00,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:09:00,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41295983] [2019-12-18 12:09:00,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:00,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:09:00,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770419896] [2019-12-18 12:09:00,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:09:00,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:00,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:09:00,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:09:00,006 INFO L87 Difference]: Start difference. First operand 20735 states and 64104 transitions. Second operand 7 states. [2019-12-18 12:09:00,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:00,633 INFO L93 Difference]: Finished difference Result 43564 states and 133585 transitions. [2019-12-18 12:09:00,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:09:00,633 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 12:09:00,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:00,714 INFO L225 Difference]: With dead ends: 43564 [2019-12-18 12:09:00,714 INFO L226 Difference]: Without dead ends: 40319 [2019-12-18 12:09:00,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:09:00,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40319 states. [2019-12-18 12:09:01,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40319 to 20867. [2019-12-18 12:09:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20867 states. [2019-12-18 12:09:01,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20867 states to 20867 states and 64616 transitions. [2019-12-18 12:09:01,219 INFO L78 Accepts]: Start accepts. Automaton has 20867 states and 64616 transitions. Word has length 66 [2019-12-18 12:09:01,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:01,219 INFO L462 AbstractCegarLoop]: Abstraction has 20867 states and 64616 transitions. [2019-12-18 12:09:01,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:09:01,219 INFO L276 IsEmpty]: Start isEmpty. Operand 20867 states and 64616 transitions. [2019-12-18 12:09:01,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:09:01,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:01,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:01,241 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:01,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:01,241 INFO L82 PathProgramCache]: Analyzing trace with hash 104538735, now seen corresponding path program 2 times [2019-12-18 12:09:01,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:01,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204580871] [2019-12-18 12:09:01,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:09:01,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204580871] [2019-12-18 12:09:01,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:01,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:09:01,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424300560] [2019-12-18 12:09:01,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:09:01,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:01,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:09:01,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:09:01,313 INFO L87 Difference]: Start difference. First operand 20867 states and 64616 transitions. Second operand 4 states. [2019-12-18 12:09:01,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:01,512 INFO L93 Difference]: Finished difference Result 20682 states and 63880 transitions. [2019-12-18 12:09:01,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:09:01,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 12:09:01,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:01,560 INFO L225 Difference]: With dead ends: 20682 [2019-12-18 12:09:01,560 INFO L226 Difference]: Without dead ends: 20682 [2019-12-18 12:09:01,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:09:01,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20682 states. [2019-12-18 12:09:02,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20682 to 19455. [2019-12-18 12:09:02,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19455 states. [2019-12-18 12:09:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19455 states to 19455 states and 60082 transitions. [2019-12-18 12:09:02,237 INFO L78 Accepts]: Start accepts. Automaton has 19455 states and 60082 transitions. Word has length 66 [2019-12-18 12:09:02,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:02,237 INFO L462 AbstractCegarLoop]: Abstraction has 19455 states and 60082 transitions. [2019-12-18 12:09:02,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:09:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand 19455 states and 60082 transitions. [2019-12-18 12:09:02,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:09:02,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:02,259 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:02,259 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:02,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:02,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1162997979, now seen corresponding path program 1 times [2019-12-18 12:09:02,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:02,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752220262] [2019-12-18 12:09:02,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:09:02,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752220262] [2019-12-18 12:09:02,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:02,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:09:02,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37147493] [2019-12-18 12:09:02,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:09:02,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:02,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:09:02,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:09:02,351 INFO L87 Difference]: Start difference. First operand 19455 states and 60082 transitions. Second operand 3 states. [2019-12-18 12:09:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:02,436 INFO L93 Difference]: Finished difference Result 16709 states and 50483 transitions. [2019-12-18 12:09:02,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:09:02,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:09:02,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:02,467 INFO L225 Difference]: With dead ends: 16709 [2019-12-18 12:09:02,467 INFO L226 Difference]: Without dead ends: 16709 [2019-12-18 12:09:02,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:09:02,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16709 states. [2019-12-18 12:09:02,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16709 to 15085. [2019-12-18 12:09:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15085 states. [2019-12-18 12:09:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15085 states to 15085 states and 45535 transitions. [2019-12-18 12:09:02,731 INFO L78 Accepts]: Start accepts. Automaton has 15085 states and 45535 transitions. Word has length 66 [2019-12-18 12:09:02,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:02,731 INFO L462 AbstractCegarLoop]: Abstraction has 15085 states and 45535 transitions. [2019-12-18 12:09:02,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:09:02,731 INFO L276 IsEmpty]: Start isEmpty. Operand 15085 states and 45535 transitions. [2019-12-18 12:09:02,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:02,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:02,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:02,747 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:02,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:02,747 INFO L82 PathProgramCache]: Analyzing trace with hash -543525966, now seen corresponding path program 1 times [2019-12-18 12:09:02,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:02,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488348288] [2019-12-18 12:09:02,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:09:02,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488348288] [2019-12-18 12:09:02,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:02,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:09:02,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118611492] [2019-12-18 12:09:02,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:09:02,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:02,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:09:02,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:09:02,984 INFO L87 Difference]: Start difference. First operand 15085 states and 45535 transitions. Second operand 10 states. [2019-12-18 12:09:04,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:04,369 INFO L93 Difference]: Finished difference Result 22528 states and 67687 transitions. [2019-12-18 12:09:04,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:09:04,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:09:04,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:04,395 INFO L225 Difference]: With dead ends: 22528 [2019-12-18 12:09:04,395 INFO L226 Difference]: Without dead ends: 18655 [2019-12-18 12:09:04,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:09:04,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18655 states. [2019-12-18 12:09:04,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18655 to 15486. [2019-12-18 12:09:04,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15486 states. [2019-12-18 12:09:04,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15486 states to 15486 states and 46650 transitions. [2019-12-18 12:09:04,644 INFO L78 Accepts]: Start accepts. Automaton has 15486 states and 46650 transitions. Word has length 67 [2019-12-18 12:09:04,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:04,644 INFO L462 AbstractCegarLoop]: Abstraction has 15486 states and 46650 transitions. [2019-12-18 12:09:04,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:09:04,644 INFO L276 IsEmpty]: Start isEmpty. Operand 15486 states and 46650 transitions. [2019-12-18 12:09:04,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:04,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:04,661 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:04,661 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:04,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:04,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1737332378, now seen corresponding path program 2 times [2019-12-18 12:09:04,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:04,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419181229] [2019-12-18 12:09:04,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:04,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:09:04,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419181229] [2019-12-18 12:09:04,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:04,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:09:04,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826697066] [2019-12-18 12:09:04,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:09:04,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:04,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:09:04,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:09:04,845 INFO L87 Difference]: Start difference. First operand 15486 states and 46650 transitions. Second operand 11 states. [2019-12-18 12:09:06,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:06,057 INFO L93 Difference]: Finished difference Result 20850 states and 62350 transitions. [2019-12-18 12:09:06,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:09:06,057 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:09:06,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:06,082 INFO L225 Difference]: With dead ends: 20850 [2019-12-18 12:09:06,082 INFO L226 Difference]: Without dead ends: 18415 [2019-12-18 12:09:06,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:09:06,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18415 states. [2019-12-18 12:09:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18415 to 15406. [2019-12-18 12:09:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15406 states. [2019-12-18 12:09:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15406 states to 15406 states and 46410 transitions. [2019-12-18 12:09:06,316 INFO L78 Accepts]: Start accepts. Automaton has 15406 states and 46410 transitions. Word has length 67 [2019-12-18 12:09:06,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:06,316 INFO L462 AbstractCegarLoop]: Abstraction has 15406 states and 46410 transitions. [2019-12-18 12:09:06,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:09:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 15406 states and 46410 transitions. [2019-12-18 12:09:06,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:06,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:06,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:06,332 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:06,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:06,332 INFO L82 PathProgramCache]: Analyzing trace with hash 202288426, now seen corresponding path program 3 times [2019-12-18 12:09:06,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:06,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938239175] [2019-12-18 12:09:06,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:06,604 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 7 [2019-12-18 12:09:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:09:06,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938239175] [2019-12-18 12:09:06,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:06,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:09:06,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000016407] [2019-12-18 12:09:06,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:09:06,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:06,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:09:06,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:09:06,681 INFO L87 Difference]: Start difference. First operand 15406 states and 46410 transitions. Second operand 10 states. [2019-12-18 12:09:08,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:08,077 INFO L93 Difference]: Finished difference Result 23323 states and 69368 transitions. [2019-12-18 12:09:08,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:09:08,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:09:08,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:08,105 INFO L225 Difference]: With dead ends: 23323 [2019-12-18 12:09:08,106 INFO L226 Difference]: Without dead ends: 19998 [2019-12-18 12:09:08,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:09:08,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19998 states. [2019-12-18 12:09:08,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19998 to 15790. [2019-12-18 12:09:08,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15790 states. [2019-12-18 12:09:08,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15790 states to 15790 states and 47396 transitions. [2019-12-18 12:09:08,366 INFO L78 Accepts]: Start accepts. Automaton has 15790 states and 47396 transitions. Word has length 67 [2019-12-18 12:09:08,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:08,367 INFO L462 AbstractCegarLoop]: Abstraction has 15790 states and 47396 transitions. [2019-12-18 12:09:08,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:09:08,367 INFO L276 IsEmpty]: Start isEmpty. Operand 15790 states and 47396 transitions. [2019-12-18 12:09:08,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:08,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:08,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:08,382 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:08,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:08,382 INFO L82 PathProgramCache]: Analyzing trace with hash -917850962, now seen corresponding path program 4 times [2019-12-18 12:09:08,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:08,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307797421] [2019-12-18 12:09:08,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:09:08,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307797421] [2019-12-18 12:09:08,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:08,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:09:08,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142317745] [2019-12-18 12:09:08,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:09:08,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:08,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:09:08,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:09:08,541 INFO L87 Difference]: Start difference. First operand 15790 states and 47396 transitions. Second operand 11 states. [2019-12-18 12:09:09,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:09,971 INFO L93 Difference]: Finished difference Result 22253 states and 66116 transitions. [2019-12-18 12:09:09,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:09:09,972 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:09:09,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:10,002 INFO L225 Difference]: With dead ends: 22253 [2019-12-18 12:09:10,003 INFO L226 Difference]: Without dead ends: 19642 [2019-12-18 12:09:10,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:09:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19642 states. [2019-12-18 12:09:10,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19642 to 15486. [2019-12-18 12:09:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15486 states. [2019-12-18 12:09:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15486 states to 15486 states and 46480 transitions. [2019-12-18 12:09:10,280 INFO L78 Accepts]: Start accepts. Automaton has 15486 states and 46480 transitions. Word has length 67 [2019-12-18 12:09:10,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:10,280 INFO L462 AbstractCegarLoop]: Abstraction has 15486 states and 46480 transitions. [2019-12-18 12:09:10,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:09:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 15486 states and 46480 transitions. [2019-12-18 12:09:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:10,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:10,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:10,298 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:10,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:10,298 INFO L82 PathProgramCache]: Analyzing trace with hash 668274002, now seen corresponding path program 5 times [2019-12-18 12:09:10,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:10,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741176185] [2019-12-18 12:09:10,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:09:10,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741176185] [2019-12-18 12:09:10,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:10,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:09:10,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565159909] [2019-12-18 12:09:10,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:09:10,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:10,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:09:10,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:09:10,495 INFO L87 Difference]: Start difference. First operand 15486 states and 46480 transitions. Second operand 11 states. [2019-12-18 12:09:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:11,933 INFO L93 Difference]: Finished difference Result 32811 states and 97292 transitions. [2019-12-18 12:09:11,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 12:09:11,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:09:11,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:11,967 INFO L225 Difference]: With dead ends: 32811 [2019-12-18 12:09:11,967 INFO L226 Difference]: Without dead ends: 26102 [2019-12-18 12:09:11,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 12:09:12,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26102 states. [2019-12-18 12:09:12,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26102 to 14741. [2019-12-18 12:09:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14741 states. [2019-12-18 12:09:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14741 states to 14741 states and 44134 transitions. [2019-12-18 12:09:12,447 INFO L78 Accepts]: Start accepts. Automaton has 14741 states and 44134 transitions. Word has length 67 [2019-12-18 12:09:12,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:12,447 INFO L462 AbstractCegarLoop]: Abstraction has 14741 states and 44134 transitions. [2019-12-18 12:09:12,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:09:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 14741 states and 44134 transitions. [2019-12-18 12:09:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:12,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:12,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:12,462 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:12,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:12,463 INFO L82 PathProgramCache]: Analyzing trace with hash -222673432, now seen corresponding path program 6 times [2019-12-18 12:09:12,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:12,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251778011] [2019-12-18 12:09:12,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:09:12,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251778011] [2019-12-18 12:09:12,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:12,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 12:09:12,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441289488] [2019-12-18 12:09:12,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 12:09:12,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:12,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 12:09:12,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 12:09:12,884 INFO L87 Difference]: Start difference. First operand 14741 states and 44134 transitions. Second operand 16 states. [2019-12-18 12:09:16,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:16,318 INFO L93 Difference]: Finished difference Result 20937 states and 61596 transitions. [2019-12-18 12:09:16,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 12:09:16,319 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 12:09:16,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:16,346 INFO L225 Difference]: With dead ends: 20937 [2019-12-18 12:09:16,346 INFO L226 Difference]: Without dead ends: 20424 [2019-12-18 12:09:16,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=313, Invalid=1327, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 12:09:16,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20424 states. [2019-12-18 12:09:16,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20424 to 15529. [2019-12-18 12:09:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15529 states. [2019-12-18 12:09:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15529 states to 15529 states and 46436 transitions. [2019-12-18 12:09:16,598 INFO L78 Accepts]: Start accepts. Automaton has 15529 states and 46436 transitions. Word has length 67 [2019-12-18 12:09:16,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:16,599 INFO L462 AbstractCegarLoop]: Abstraction has 15529 states and 46436 transitions. [2019-12-18 12:09:16,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 12:09:16,599 INFO L276 IsEmpty]: Start isEmpty. Operand 15529 states and 46436 transitions. [2019-12-18 12:09:16,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:16,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:16,614 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:09:16,614 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:16,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:16,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1210625396, now seen corresponding path program 7 times [2019-12-18 12:09:16,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:16,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734313166] [2019-12-18 12:09:16,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:09:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:09:16,730 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:09:16,730 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:09:16,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~z$r_buff0_thd2~0_185 0) (= 0 |v_ULTIMATE.start_main_~#t74~0.offset_23|) (= 0 v_~x~0_134) (= v_~z$w_buff0_used~0_784 0) (= v_~__unbuffered_p1_EBX~0_36 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$w_buff1_used~0_442 0) (= |v_#NULL.offset_7| 0) (= v_~z~0_178 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t74~0.base_32|)) (= v_~z$r_buff1_thd0~0_195 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~z$read_delayed~0_6 0) (= v_~y~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t74~0.base_32| 1)) (= v_~__unbuffered_p2_EBX~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t74~0.base_32|) (= 0 v_~__unbuffered_cnt~0_87) (= v_~weak$$choice2~0_133 0) (= v_~z$r_buff0_thd1~0_306 0) (= 0 v_~z$flush_delayed~0_26) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff0_thd3~0_400) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t74~0.base_32| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t74~0.base_32|) |v_ULTIMATE.start_main_~#t74~0.offset_23| 0)) |v_#memory_int_21|) (= v_~z$w_buff1~0_222 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t74~0.base_32| 4)) (= 0 v_~__unbuffered_p0_EAX~0_142) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~z$r_buff1_thd3~0_306) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= v_~z$r_buff1_thd1~0_175 0) (= v_~z$r_buff1_thd2~0_185 0) (= v_~z$w_buff0~0_312 0) (= v_~z$r_buff0_thd0~0_204 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t75~0.offset=|v_ULTIMATE.start_main_~#t75~0.offset_22|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_42|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_54|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_34|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_204, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_142, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t76~0.base=|v_ULTIMATE.start_main_~#t76~0.base_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_442, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ULTIMATE.start_main_~#t76~0.offset=|v_ULTIMATE.start_main_~#t76~0.offset_14|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_175, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_400, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~x~0=v_~x~0_134, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_222, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_62|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_195, ULTIMATE.start_main_~#t75~0.base=|v_ULTIMATE.start_main_~#t75~0.base_29|, ULTIMATE.start_main_~#t74~0.offset=|v_ULTIMATE.start_main_~#t74~0.offset_23|, ~y~0=v_~y~0_24, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_185, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_36, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_24|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_784, ~z$w_buff0~0=v_~z$w_buff0~0_312, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t74~0.base=|v_ULTIMATE.start_main_~#t74~0.base_32|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_133, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_306} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t75~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t76~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t76~0.offset, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t75~0.base, ULTIMATE.start_main_~#t74~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t74~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:09:16,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L750: Formula: (and (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In750967914 0)) (= ~x~0_In750967914 ~__unbuffered_p0_EAX~0_Out750967914) (= ~z$r_buff1_thd0~0_Out750967914 ~z$r_buff0_thd0~0_In750967914) (= ~z$r_buff0_thd1~0_Out750967914 1) (= ~z$r_buff1_thd3~0_Out750967914 ~z$r_buff0_thd3~0_In750967914) (= ~z$r_buff1_thd2~0_Out750967914 ~z$r_buff0_thd2~0_In750967914) (= ~z$r_buff0_thd1~0_In750967914 ~z$r_buff1_thd1~0_Out750967914)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In750967914, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In750967914, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In750967914, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In750967914, ~x~0=~x~0_In750967914, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In750967914} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out750967914, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In750967914, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out750967914, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out750967914, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out750967914, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out750967914, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In750967914, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In750967914, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out750967914, ~x~0=~x~0_In750967914, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In750967914} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:09:16,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-1-->L834: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t75~0.base_11| 4)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t75~0.base_11| 1)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t75~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t75~0.base_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t75~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t75~0.base_11|) |v_ULTIMATE.start_main_~#t75~0.offset_10| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t75~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t75~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t75~0.offset=|v_ULTIMATE.start_main_~#t75~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t75~0.base=|v_ULTIMATE.start_main_~#t75~0.base_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t75~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t75~0.base, #length] because there is no mapped edge [2019-12-18 12:09:16,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L773-2-->L773-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In1382863026 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1382863026 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out1382863026| |P1Thread1of1ForFork2_#t~ite10_Out1382863026|))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1382863026| ~z~0_In1382863026) (or .cse0 .cse1) .cse2) (and (= |P1Thread1of1ForFork2_#t~ite9_Out1382863026| ~z$w_buff1~0_In1382863026) (not .cse0) (not .cse1) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1382863026, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1382863026, ~z$w_buff1~0=~z$w_buff1~0_In1382863026, ~z~0=~z~0_In1382863026} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1382863026|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1382863026, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1382863026|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1382863026, ~z$w_buff1~0=~z$w_buff1~0_In1382863026, ~z~0=~z~0_In1382863026} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:09:16,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-541637484 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-541637484 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-541637484| ~z$w_buff0_used~0_In-541637484)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-541637484|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-541637484, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-541637484} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-541637484, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-541637484|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-541637484} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:09:16,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L834-1-->L836: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t76~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t76~0.base_11|) |v_ULTIMATE.start_main_~#t76~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t76~0.base_11|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t76~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t76~0.base_11|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t76~0.base_11| 4) |v_#length_15|) (= |v_ULTIMATE.start_main_~#t76~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t76~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t76~0.offset=|v_ULTIMATE.start_main_~#t76~0.offset_10|, ULTIMATE.start_main_~#t76~0.base=|v_ULTIMATE.start_main_~#t76~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t76~0.offset, ULTIMATE.start_main_~#t76~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-18 12:09:16,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-560038832 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-560038832 256)))) (or (and (= ~z$w_buff0_used~0_In-560038832 |P0Thread1of1ForFork1_#t~ite5_Out-560038832|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-560038832| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-560038832, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-560038832} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-560038832|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-560038832, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-560038832} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:09:16,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In2077753315 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In2077753315 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In2077753315 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In2077753315 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In2077753315 |P0Thread1of1ForFork1_#t~ite6_Out2077753315|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite6_Out2077753315| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2077753315, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2077753315, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2077753315, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2077753315} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2077753315, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out2077753315|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2077753315, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2077753315, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2077753315} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:09:16,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L753-->L754: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In906425828 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In906425828 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out906425828) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In906425828 ~z$r_buff0_thd1~0_Out906425828)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In906425828, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In906425828} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In906425828, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out906425828|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out906425828} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:09:16,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd1~0_In339973772 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In339973772 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In339973772 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In339973772 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out339973772|)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out339973772| ~z$r_buff1_thd1~0_In339973772) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In339973772, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In339973772, ~z$w_buff1_used~0=~z$w_buff1_used~0_In339973772, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In339973772} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out339973772|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In339973772, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In339973772, ~z$w_buff1_used~0=~z$w_buff1_used~0_In339973772, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In339973772} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:09:16,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L754-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_78 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_78, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:09:16,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L775-->L775-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In632902507 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In632902507 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In632902507 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In632902507 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out632902507|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In632902507 |P1Thread1of1ForFork2_#t~ite12_Out632902507|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In632902507, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In632902507, ~z$w_buff1_used~0=~z$w_buff1_used~0_In632902507, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In632902507} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In632902507, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In632902507, ~z$w_buff1_used~0=~z$w_buff1_used~0_In632902507, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out632902507|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In632902507} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:09:16,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1842109400 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1842109400 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1842109400|) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-1842109400 |P1Thread1of1ForFork2_#t~ite13_Out-1842109400|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1842109400, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1842109400} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1842109400, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1842109400|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1842109400} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:09:16,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L777-->L777-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In219722611 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In219722611 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In219722611 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In219722611 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out219722611| ~z$r_buff1_thd2~0_In219722611) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite14_Out219722611| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In219722611, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In219722611, ~z$w_buff1_used~0=~z$w_buff1_used~0_In219722611, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In219722611} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In219722611, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In219722611, ~z$w_buff1_used~0=~z$w_buff1_used~0_In219722611, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out219722611|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In219722611} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:09:16,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L777-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~z$r_buff1_thd2~0_132 |v_P1Thread1of1ForFork2_#t~ite14_36|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_36|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_35|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:09:16,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1198886158 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1198886158 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1198886158 256))) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1198886158 256))) (= (mod ~z$w_buff0_used~0_In-1198886158 256) 0))) (= |P2Thread1of1ForFork0_#t~ite29_Out-1198886158| |P2Thread1of1ForFork0_#t~ite30_Out-1198886158|) (= ~z$w_buff1_used~0_In-1198886158 |P2Thread1of1ForFork0_#t~ite29_Out-1198886158|)) (and (= |P2Thread1of1ForFork0_#t~ite29_In-1198886158| |P2Thread1of1ForFork0_#t~ite29_Out-1198886158|) (not .cse0) (= ~z$w_buff1_used~0_In-1198886158 |P2Thread1of1ForFork0_#t~ite30_Out-1198886158|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1198886158, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1198886158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1198886158, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1198886158, ~weak$$choice2~0=~weak$$choice2~0_In-1198886158, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1198886158|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1198886158, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1198886158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1198886158, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1198886158, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1198886158|, ~weak$$choice2~0=~weak$$choice2~0_In-1198886158, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1198886158|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:09:16,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~z$r_buff0_thd3~0_58 v_~z$r_buff0_thd3~0_59)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 12:09:16,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L805-->L809: Formula: (and (= v_~z~0_56 v_~z$mem_tmp~0_5) (= 0 v_~z$flush_delayed~0_11) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 12:09:16,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-2-->L809-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1157414144 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1157414144 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In1157414144 |P2Thread1of1ForFork0_#t~ite38_Out1157414144|)) (and (not .cse1) (= ~z$w_buff1~0_In1157414144 |P2Thread1of1ForFork0_#t~ite38_Out1157414144|) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1157414144, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1157414144, ~z$w_buff1~0=~z$w_buff1~0_In1157414144, ~z~0=~z~0_In1157414144} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1157414144|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1157414144, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1157414144, ~z$w_buff1~0=~z$w_buff1~0_In1157414144, ~z~0=~z~0_In1157414144} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:09:16,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-4-->L810: Formula: (= v_~z~0_38 |v_P2Thread1of1ForFork0_#t~ite38_14|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_14|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-18 12:09:16,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1381031110 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1381031110 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out1381031110| ~z$w_buff0_used~0_In1381031110) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out1381031110| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1381031110, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1381031110} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1381031110, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1381031110|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1381031110} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:09:16,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1313849631 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1313849631 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1313849631 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1313849631 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out1313849631| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite41_Out1313849631| ~z$w_buff1_used~0_In1313849631)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1313849631, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1313849631, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1313849631, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1313849631} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1313849631, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1313849631, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1313849631, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1313849631, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1313849631|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:09:16,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In345968659 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In345968659 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out345968659| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out345968659| ~z$r_buff0_thd3~0_In345968659)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In345968659, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In345968659} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In345968659, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In345968659, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out345968659|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:09:16,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1540460292 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1540460292 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1540460292 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1540460292 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1540460292|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In1540460292 |P2Thread1of1ForFork0_#t~ite43_Out1540460292|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1540460292, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1540460292, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1540460292, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1540460292} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1540460292|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1540460292, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1540460292, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1540460292, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1540460292} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:09:16,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~z$r_buff1_thd3~0_188 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_188, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:09:16,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:09:16,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L842-2-->L842-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In1163546909 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1163546909 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out1163546909| |ULTIMATE.start_main_#t~ite48_Out1163546909|))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1163546909| ~z$w_buff1~0_In1163546909) (not .cse0) (not .cse1) .cse2) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out1163546909| ~z~0_In1163546909) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1163546909, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1163546909, ~z$w_buff1~0=~z$w_buff1~0_In1163546909, ~z~0=~z~0_In1163546909} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1163546909, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1163546909|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1163546909, ~z$w_buff1~0=~z$w_buff1~0_In1163546909, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1163546909|, ~z~0=~z~0_In1163546909} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:09:16,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-517982396 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-517982396 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-517982396| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-517982396| ~z$w_buff0_used~0_In-517982396)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-517982396, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-517982396} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-517982396, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-517982396, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-517982396|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:09:16,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1546031327 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1546031327 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1546031327 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1546031327 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1546031327|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1546031327 |ULTIMATE.start_main_#t~ite50_Out1546031327|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1546031327, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1546031327, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1546031327, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1546031327} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1546031327|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1546031327, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1546031327, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1546031327, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1546031327} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:09:16,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L845-->L845-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-157476153 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-157476153 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-157476153|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-157476153 |ULTIMATE.start_main_#t~ite51_Out-157476153|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-157476153, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-157476153} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-157476153, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-157476153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-157476153} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:09:16,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In638265813 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In638265813 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In638265813 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In638265813 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In638265813 |ULTIMATE.start_main_#t~ite52_Out638265813|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite52_Out638265813| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In638265813, ~z$w_buff0_used~0=~z$w_buff0_used~0_In638265813, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In638265813, ~z$w_buff1_used~0=~z$w_buff1_used~0_In638265813} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out638265813|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In638265813, ~z$w_buff0_used~0=~z$w_buff0_used~0_In638265813, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In638265813, ~z$w_buff1_used~0=~z$w_buff1_used~0_In638265813} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:09:16,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~z$r_buff1_thd0~0_155 |v_ULTIMATE.start_main_#t~ite52_46|) (= 0 v_~__unbuffered_p0_EAX~0_114) (= 1 v_~__unbuffered_p1_EAX~0_23) (= v_~__unbuffered_p1_EBX~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_46|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_45|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_155, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:09:16,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:09:16 BasicIcfg [2019-12-18 12:09:16,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:09:16,881 INFO L168 Benchmark]: Toolchain (without parser) took 104368.07 ms. Allocated memory was 144.2 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 12:09:16,882 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 12:09:16,882 INFO L168 Benchmark]: CACSL2BoogieTranslator took 802.02 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 98.6 MB in the beginning and 154.4 MB in the end (delta: -55.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 12:09:16,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.42 ms. Allocated memory is still 201.3 MB. Free memory was 154.4 MB in the beginning and 151.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:09:16,888 INFO L168 Benchmark]: Boogie Preprocessor took 38.48 ms. Allocated memory is still 201.3 MB. Free memory was 151.6 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:09:16,889 INFO L168 Benchmark]: RCFGBuilder took 853.79 ms. Allocated memory is still 201.3 MB. Free memory was 149.6 MB in the beginning and 98.5 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:09:16,889 INFO L168 Benchmark]: TraceAbstraction took 102597.43 ms. Allocated memory was 201.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 98.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 12:09:16,891 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.76 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 802.02 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 98.6 MB in the beginning and 154.4 MB in the end (delta: -55.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.42 ms. Allocated memory is still 201.3 MB. Free memory was 154.4 MB in the beginning and 151.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.48 ms. Allocated memory is still 201.3 MB. Free memory was 151.6 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 853.79 ms. Allocated memory is still 201.3 MB. Free memory was 149.6 MB in the beginning and 98.5 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 102597.43 ms. Allocated memory was 201.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 98.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 178 ProgramPointsBefore, 95 ProgramPointsAfterwards, 215 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 35 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 29 ChoiceCompositions, 7593 VarBasedMoverChecksPositive, 373 VarBasedMoverChecksNegative, 200 SemBasedMoverChecksPositive, 268 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 132619 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t74, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 z$w_buff1 = z$w_buff0 [L736] 1 z$w_buff0 = 1 [L737] 1 z$w_buff1_used = z$w_buff0_used [L738] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t75, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = x [L770] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L773] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L836] FCALL, FORK 0 pthread_create(&t76, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 y = 1 [L790] 3 __unbuffered_p2_EAX = y [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L775] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L798] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 102.2s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 30.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6936 SDtfs, 6889 SDslu, 22519 SDs, 0 SdLazy, 13066 SolverSat, 253 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 308 GetRequests, 36 SyntacticMatches, 16 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153153occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 204675 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1340 NumberOfCodeBlocks, 1340 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1243 ConstructedInterpolants, 0 QuantifiedInterpolants, 240913 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...