/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:23:43,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:23:43,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:23:43,064 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:23:43,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:23:43,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:23:43,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:23:43,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:23:43,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:23:43,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:23:43,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:23:43,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:23:43,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:23:43,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:23:43,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:23:43,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:23:43,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:23:43,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:23:43,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:23:43,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:23:43,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:23:43,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:23:43,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:23:43,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:23:43,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:23:43,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:23:43,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:23:43,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:23:43,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:23:43,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:23:43,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:23:43,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:23:43,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:23:43,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:23:43,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:23:43,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:23:43,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:23:43,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:23:43,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:23:43,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:23:43,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:23:43,098 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:23:43,112 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:23:43,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:23:43,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:23:43,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:23:43,114 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:23:43,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:23:43,115 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:23:43,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:23:43,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:23:43,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:23:43,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:23:43,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:23:43,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:23:43,116 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:23:43,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:23:43,116 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:23:43,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:23:43,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:23:43,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:23:43,117 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:23:43,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:23:43,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:23:43,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:23:43,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:23:43,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:23:43,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:23:43,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:23:43,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:23:43,119 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:23:43,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:23:43,406 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:23:43,410 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:23:43,411 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:23:43,412 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:23:43,412 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_power.oepc.i [2019-12-27 01:23:43,482 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff4a939b7/f5dc17ee67074404aa4fbc6103eab641/FLAG7653c45d8 [2019-12-27 01:23:44,070 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:23:44,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_power.oepc.i [2019-12-27 01:23:44,098 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff4a939b7/f5dc17ee67074404aa4fbc6103eab641/FLAG7653c45d8 [2019-12-27 01:23:44,306 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff4a939b7/f5dc17ee67074404aa4fbc6103eab641 [2019-12-27 01:23:44,314 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:23:44,316 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:23:44,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:23:44,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:23:44,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:23:44,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:23:44" (1/1) ... [2019-12-27 01:23:44,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36036b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:23:44, skipping insertion in model container [2019-12-27 01:23:44,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:23:44" (1/1) ... [2019-12-27 01:23:44,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:23:44,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:23:44,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:23:44,890 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:23:45,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:23:45,105 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:23:45,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:23:45 WrapperNode [2019-12-27 01:23:45,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:23:45,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:23:45,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:23:45,107 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:23:45,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:23:45" (1/1) ... [2019-12-27 01:23:45,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:23:45" (1/1) ... [2019-12-27 01:23:45,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:23:45,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:23:45,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:23:45,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:23:45,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:23:45" (1/1) ... [2019-12-27 01:23:45,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:23:45" (1/1) ... [2019-12-27 01:23:45,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:23:45" (1/1) ... [2019-12-27 01:23:45,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:23:45" (1/1) ... [2019-12-27 01:23:45,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:23:45" (1/1) ... [2019-12-27 01:23:45,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:23:45" (1/1) ... [2019-12-27 01:23:45,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:23:45" (1/1) ... [2019-12-27 01:23:45,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:23:45,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:23:45,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:23:45,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:23:45,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:23:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:23:45,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:23:45,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:23:45,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:23:45,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:23:45,279 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:23:45,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:23:45,279 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:23:45,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:23:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:23:45,280 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:23:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:23:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:23:45,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:23:45,283 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:23:46,121 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:23:46,122 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:23:46,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:23:46 BoogieIcfgContainer [2019-12-27 01:23:46,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:23:46,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:23:46,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:23:46,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:23:46,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:23:44" (1/3) ... [2019-12-27 01:23:46,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0e8afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:23:46, skipping insertion in model container [2019-12-27 01:23:46,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:23:45" (2/3) ... [2019-12-27 01:23:46,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0e8afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:23:46, skipping insertion in model container [2019-12-27 01:23:46,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:23:46" (3/3) ... [2019-12-27 01:23:46,132 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_power.oepc.i [2019-12-27 01:23:46,143 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:23:46,144 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:23:46,152 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:23:46,153 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:23:46,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,199 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,200 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,200 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,213 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,214 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,229 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,229 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,285 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,288 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,306 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,306 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:23:46,324 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:23:46,341 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:23:46,342 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:23:46,342 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:23:46,342 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:23:46,342 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:23:46,342 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:23:46,342 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:23:46,342 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:23:46,358 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 01:23:46,360 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 01:23:46,467 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 01:23:46,467 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:23:46,485 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:23:46,510 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 01:23:46,566 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 01:23:46,566 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:23:46,575 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:23:46,595 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 01:23:46,596 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:23:52,000 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 01:23:52,157 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 01:23:52,190 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91218 [2019-12-27 01:23:52,190 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 01:23:52,195 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 105 transitions [2019-12-27 01:24:13,481 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-27 01:24:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-27 01:24:13,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:24:13,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:24:13,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:24:13,490 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-27 01:24:13,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:24:13,494 INFO L82 PathProgramCache]: Analyzing trace with hash 921826, now seen corresponding path program 1 times [2019-12-27 01:24:13,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:24:13,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780329659] [2019-12-27 01:24:13,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:24:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:24:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:24:13,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780329659] [2019-12-27 01:24:13,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:24:13,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:24:13,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015419654] [2019-12-27 01:24:13,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:24:13,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:24:13,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:24:13,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:24:13,741 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-27 01:24:14,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:24:14,898 INFO L93 Difference]: Finished difference Result 125226 states and 534182 transitions. [2019-12-27 01:24:14,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:24:14,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:24:14,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:24:19,207 INFO L225 Difference]: With dead ends: 125226 [2019-12-27 01:24:19,208 INFO L226 Difference]: Without dead ends: 117946 [2019-12-27 01:24:19,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:24:24,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117946 states. [2019-12-27 01:24:27,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117946 to 117946. [2019-12-27 01:24:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117946 states. [2019-12-27 01:24:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117946 states to 117946 states and 502500 transitions. [2019-12-27 01:24:27,735 INFO L78 Accepts]: Start accepts. Automaton has 117946 states and 502500 transitions. Word has length 3 [2019-12-27 01:24:27,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:24:27,735 INFO L462 AbstractCegarLoop]: Abstraction has 117946 states and 502500 transitions. [2019-12-27 01:24:27,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:24:27,736 INFO L276 IsEmpty]: Start isEmpty. Operand 117946 states and 502500 transitions. [2019-12-27 01:24:27,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:24:27,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:24:27,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:24:27,741 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-27 01:24:27,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:24:27,741 INFO L82 PathProgramCache]: Analyzing trace with hash -2034548154, now seen corresponding path program 1 times [2019-12-27 01:24:27,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:24:27,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934739014] [2019-12-27 01:24:27,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:24:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:24:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:24:27,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934739014] [2019-12-27 01:24:27,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:24:27,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:24:27,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957824680] [2019-12-27 01:24:27,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:24:27,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:24:27,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:24:27,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:24:27,916 INFO L87 Difference]: Start difference. First operand 117946 states and 502500 transitions. Second operand 4 states. [2019-12-27 01:24:33,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:24:33,090 INFO L93 Difference]: Finished difference Result 183040 states and 750092 transitions. [2019-12-27 01:24:33,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:24:33,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:24:33,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:24:33,640 INFO L225 Difference]: With dead ends: 183040 [2019-12-27 01:24:33,640 INFO L226 Difference]: Without dead ends: 182991 [2019-12-27 01:24:33,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:24:41,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182991 states. [2019-12-27 01:24:49,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182991 to 168271. [2019-12-27 01:24:49,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168271 states. [2019-12-27 01:24:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168271 states to 168271 states and 697811 transitions. [2019-12-27 01:24:50,180 INFO L78 Accepts]: Start accepts. Automaton has 168271 states and 697811 transitions. Word has length 11 [2019-12-27 01:24:50,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:24:50,181 INFO L462 AbstractCegarLoop]: Abstraction has 168271 states and 697811 transitions. [2019-12-27 01:24:50,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:24:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 168271 states and 697811 transitions. [2019-12-27 01:24:50,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:24:50,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:24:50,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:24:50,189 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-27 01:24:50,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:24:50,189 INFO L82 PathProgramCache]: Analyzing trace with hash -579003435, now seen corresponding path program 1 times [2019-12-27 01:24:50,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:24:50,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207623553] [2019-12-27 01:24:50,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:24:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:24:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:24:50,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207623553] [2019-12-27 01:24:50,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:24:50,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:24:50,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920379490] [2019-12-27 01:24:50,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:24:50,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:24:50,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:24:50,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:24:50,288 INFO L87 Difference]: Start difference. First operand 168271 states and 697811 transitions. Second operand 3 states. [2019-12-27 01:24:50,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:24:50,427 INFO L93 Difference]: Finished difference Result 35531 states and 115505 transitions. [2019-12-27 01:24:50,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:24:50,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:24:50,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:24:50,538 INFO L225 Difference]: With dead ends: 35531 [2019-12-27 01:24:50,538 INFO L226 Difference]: Without dead ends: 35531 [2019-12-27 01:24:50,540 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-27 01:24:50,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35531 states. [2019-12-27 01:24:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35531 to 35531. [2019-12-27 01:24:51,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35531 states. [2019-12-27 01:24:51,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35531 states to 35531 states and 115505 transitions. [2019-12-27 01:24:51,289 INFO L78 Accepts]: Start accepts. Automaton has 35531 states and 115505 transitions. Word has length 13 [2019-12-27 01:24:51,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:24:51,290 INFO L462 AbstractCegarLoop]: Abstraction has 35531 states and 115505 transitions. [2019-12-27 01:24:51,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:24:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand 35531 states and 115505 transitions. [2019-12-27 01:24:51,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:24:51,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:24:51,293 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:24:51,293 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-27 01:24:51,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:24:51,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1458626840, now seen corresponding path program 1 times [2019-12-27 01:24:51,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:24:51,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140559974] [2019-12-27 01:24:51,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:24:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:24:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:24:51,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140559974] [2019-12-27 01:24:51,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:24:51,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:24:51,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993107918] [2019-12-27 01:24:51,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:24:51,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:24:51,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:24:51,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:24:51,391 INFO L87 Difference]: Start difference. First operand 35531 states and 115505 transitions. Second operand 5 states. [2019-12-27 01:24:54,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:24:54,703 INFO L93 Difference]: Finished difference Result 49606 states and 159424 transitions. [2019-12-27 01:24:54,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:24:54,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 01:24:54,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:24:54,809 INFO L225 Difference]: With dead ends: 49606 [2019-12-27 01:24:54,810 INFO L226 Difference]: Without dead ends: 49606 [2019-12-27 01:24:54,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:24:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49606 states. [2019-12-27 01:24:55,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49606 to 42335. [2019-12-27 01:24:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42335 states. [2019-12-27 01:24:55,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42335 states to 42335 states and 137188 transitions. [2019-12-27 01:24:55,703 INFO L78 Accepts]: Start accepts. Automaton has 42335 states and 137188 transitions. Word has length 16 [2019-12-27 01:24:55,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:24:55,704 INFO L462 AbstractCegarLoop]: Abstraction has 42335 states and 137188 transitions. [2019-12-27 01:24:55,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:24:55,704 INFO L276 IsEmpty]: Start isEmpty. Operand 42335 states and 137188 transitions. [2019-12-27 01:24:55,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:24:55,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:24:55,717 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-27 01:24:55,717 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-27 01:24:55,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:24:55,717 INFO L82 PathProgramCache]: Analyzing trace with hash -311730194, now seen corresponding path program 1 times [2019-12-27 01:24:55,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:24:55,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288208273] [2019-12-27 01:24:55,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:24:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:24:55,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:24:55,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288208273] [2019-12-27 01:24:55,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:24:55,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:24:55,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990513592] [2019-12-27 01:24:55,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:24:55,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:24:55,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:24:55,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:24:55,855 INFO L87 Difference]: Start difference. First operand 42335 states and 137188 transitions. Second operand 7 states. [2019-12-27 01:24:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:24:56,907 INFO L93 Difference]: Finished difference Result 68217 states and 214442 transitions. [2019-12-27 01:24:56,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 01:24:56,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 01:24:56,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:24:57,043 INFO L225 Difference]: With dead ends: 68217 [2019-12-27 01:24:57,044 INFO L226 Difference]: Without dead ends: 68203 [2019-12-27 01:24:57,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:24:57,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68203 states. [2019-12-27 01:24:58,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68203 to 42009. [2019-12-27 01:24:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42009 states. [2019-12-27 01:24:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42009 states to 42009 states and 135594 transitions. [2019-12-27 01:24:58,406 INFO L78 Accepts]: Start accepts. Automaton has 42009 states and 135594 transitions. Word has length 22 [2019-12-27 01:24:58,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:24:58,406 INFO L462 AbstractCegarLoop]: Abstraction has 42009 states and 135594 transitions. [2019-12-27 01:24:58,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:24:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 42009 states and 135594 transitions. [2019-12-27 01:24:58,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:24:58,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:24:58,423 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-27 01:24:58,423 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-27 01:24:58,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:24:58,423 INFO L82 PathProgramCache]: Analyzing trace with hash 573582081, now seen corresponding path program 1 times [2019-12-27 01:24:58,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:24:58,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114040913] [2019-12-27 01:24:58,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:24:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:24:58,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:24:58,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114040913] [2019-12-27 01:24:58,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:24:58,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:24:58,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255663353] [2019-12-27 01:24:58,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:24:58,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:24:58,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:24:58,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:24:58,488 INFO L87 Difference]: Start difference. First operand 42009 states and 135594 transitions. Second operand 4 states. [2019-12-27 01:24:58,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:24:58,571 INFO L93 Difference]: Finished difference Result 16636 states and 50803 transitions. [2019-12-27 01:24:58,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:24:58,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:24:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:24:58,602 INFO L225 Difference]: With dead ends: 16636 [2019-12-27 01:24:58,603 INFO L226 Difference]: Without dead ends: 16636 [2019-12-27 01:24:58,603 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-27 01:24:58,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16636 states. [2019-12-27 01:24:58,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16636 to 16378. [2019-12-27 01:24:58,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16378 states. [2019-12-27 01:24:58,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16378 states to 16378 states and 50067 transitions. [2019-12-27 01:24:58,878 INFO L78 Accepts]: Start accepts. Automaton has 16378 states and 50067 transitions. Word has length 25 [2019-12-27 01:24:58,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:24:58,878 INFO L462 AbstractCegarLoop]: Abstraction has 16378 states and 50067 transitions. [2019-12-27 01:24:58,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:24:58,878 INFO L276 IsEmpty]: Start isEmpty. Operand 16378 states and 50067 transitions. [2019-12-27 01:24:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:24:58,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:24:58,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:24:58,891 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-27 01:24:58,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:24:58,892 INFO L82 PathProgramCache]: Analyzing trace with hash 574668024, now seen corresponding path program 1 times [2019-12-27 01:24:58,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:24:58,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720917098] [2019-12-27 01:24:58,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:24:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:24:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:24:59,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720917098] [2019-12-27 01:24:59,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:24:59,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:24:59,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311068444] [2019-12-27 01:24:59,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:24:59,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:24:59,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:24:59,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:24:59,010 INFO L87 Difference]: Start difference. First operand 16378 states and 50067 transitions. Second operand 6 states. [2019-12-27 01:24:59,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:24:59,531 INFO L93 Difference]: Finished difference Result 23754 states and 70239 transitions. [2019-12-27 01:24:59,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 01:24:59,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 01:24:59,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:24:59,576 INFO L225 Difference]: With dead ends: 23754 [2019-12-27 01:24:59,576 INFO L226 Difference]: Without dead ends: 23754 [2019-12-27 01:24:59,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:24:59,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23754 states. [2019-12-27 01:24:59,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23754 to 19127. [2019-12-27 01:24:59,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19127 states. [2019-12-27 01:24:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19127 states to 19127 states and 57723 transitions. [2019-12-27 01:24:59,939 INFO L78 Accepts]: Start accepts. Automaton has 19127 states and 57723 transitions. Word has length 27 [2019-12-27 01:24:59,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:24:59,939 INFO L462 AbstractCegarLoop]: Abstraction has 19127 states and 57723 transitions. [2019-12-27 01:24:59,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:24:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 19127 states and 57723 transitions. [2019-12-27 01:24:59,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:24:59,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:24:59,960 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-27 01:24:59,960 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-27 01:24:59,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:24:59,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1393723506, now seen corresponding path program 1 times [2019-12-27 01:24:59,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:24:59,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211626068] [2019-12-27 01:24:59,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:24:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:00,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:00,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211626068] [2019-12-27 01:25:00,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:00,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:25:00,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276588131] [2019-12-27 01:25:00,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:25:00,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:00,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:25:00,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:25:00,036 INFO L87 Difference]: Start difference. First operand 19127 states and 57723 transitions. Second operand 5 states. [2019-12-27 01:25:00,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:00,546 INFO L93 Difference]: Finished difference Result 23902 states and 71215 transitions. [2019-12-27 01:25:00,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:25:00,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 01:25:00,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:00,590 INFO L225 Difference]: With dead ends: 23902 [2019-12-27 01:25:00,590 INFO L226 Difference]: Without dead ends: 23902 [2019-12-27 01:25:00,591 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-27 01:25:00,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23902 states. [2019-12-27 01:25:00,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23902 to 20179. [2019-12-27 01:25:00,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20179 states. [2019-12-27 01:25:00,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20179 states to 20179 states and 61180 transitions. [2019-12-27 01:25:00,934 INFO L78 Accepts]: Start accepts. Automaton has 20179 states and 61180 transitions. Word has length 33 [2019-12-27 01:25:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:00,934 INFO L462 AbstractCegarLoop]: Abstraction has 20179 states and 61180 transitions. [2019-12-27 01:25:00,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:25:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 20179 states and 61180 transitions. [2019-12-27 01:25:00,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:25:00,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:00,957 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-27 01:25:00,958 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-27 01:25:00,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:00,958 INFO L82 PathProgramCache]: Analyzing trace with hash 305072172, now seen corresponding path program 2 times [2019-12-27 01:25:00,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:00,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371185271] [2019-12-27 01:25:00,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:01,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371185271] [2019-12-27 01:25:01,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:01,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:25:01,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660746440] [2019-12-27 01:25:01,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:25:01,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:01,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:25:01,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:25:01,093 INFO L87 Difference]: Start difference. First operand 20179 states and 61180 transitions. Second operand 8 states. [2019-12-27 01:25:02,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:02,508 INFO L93 Difference]: Finished difference Result 27626 states and 80996 transitions. [2019-12-27 01:25:02,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 01:25:02,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 01:25:02,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:02,548 INFO L225 Difference]: With dead ends: 27626 [2019-12-27 01:25:02,548 INFO L226 Difference]: Without dead ends: 27626 [2019-12-27 01:25:02,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-27 01:25:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27626 states. [2019-12-27 01:25:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27626 to 17400. [2019-12-27 01:25:02,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17400 states. [2019-12-27 01:25:02,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17400 states to 17400 states and 52480 transitions. [2019-12-27 01:25:02,922 INFO L78 Accepts]: Start accepts. Automaton has 17400 states and 52480 transitions. Word has length 33 [2019-12-27 01:25:02,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:02,923 INFO L462 AbstractCegarLoop]: Abstraction has 17400 states and 52480 transitions. [2019-12-27 01:25:02,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:25:02,923 INFO L276 IsEmpty]: Start isEmpty. Operand 17400 states and 52480 transitions. [2019-12-27 01:25:02,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:25:02,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:02,945 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-27 01:25:02,945 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-27 01:25:02,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:02,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1779229683, now seen corresponding path program 1 times [2019-12-27 01:25:02,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:02,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124638861] [2019-12-27 01:25:02,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:03,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:03,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124638861] [2019-12-27 01:25:03,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:03,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:25:03,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818140409] [2019-12-27 01:25:03,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:25:03,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:03,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:25:03,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:25:03,013 INFO L87 Difference]: Start difference. First operand 17400 states and 52480 transitions. Second operand 3 states. [2019-12-27 01:25:03,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:03,086 INFO L93 Difference]: Finished difference Result 17399 states and 52478 transitions. [2019-12-27 01:25:03,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:25:03,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:25:03,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:03,121 INFO L225 Difference]: With dead ends: 17399 [2019-12-27 01:25:03,121 INFO L226 Difference]: Without dead ends: 17399 [2019-12-27 01:25:03,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:25:03,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17399 states. [2019-12-27 01:25:03,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17399 to 17399. [2019-12-27 01:25:03,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17399 states. [2019-12-27 01:25:03,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17399 states to 17399 states and 52478 transitions. [2019-12-27 01:25:03,594 INFO L78 Accepts]: Start accepts. Automaton has 17399 states and 52478 transitions. Word has length 39 [2019-12-27 01:25:03,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:03,594 INFO L462 AbstractCegarLoop]: Abstraction has 17399 states and 52478 transitions. [2019-12-27 01:25:03,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:25:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 17399 states and 52478 transitions. [2019-12-27 01:25:03,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:25:03,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:03,624 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-27 01:25:03,624 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-27 01:25:03,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:03,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1175786798, now seen corresponding path program 1 times [2019-12-27 01:25:03,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:03,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204665997] [2019-12-27 01:25:03,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:03,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204665997] [2019-12-27 01:25:03,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:03,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:25:03,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355576948] [2019-12-27 01:25:03,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:25:03,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:03,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:25:03,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:25:03,766 INFO L87 Difference]: Start difference. First operand 17399 states and 52478 transitions. Second operand 6 states. [2019-12-27 01:25:04,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:04,855 INFO L93 Difference]: Finished difference Result 34243 states and 103303 transitions. [2019-12-27 01:25:04,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:25:04,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 01:25:04,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:04,907 INFO L225 Difference]: With dead ends: 34243 [2019-12-27 01:25:04,908 INFO L226 Difference]: Without dead ends: 34243 [2019-12-27 01:25:04,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:25:05,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34243 states. [2019-12-27 01:25:05,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34243 to 22015. [2019-12-27 01:25:05,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22015 states. [2019-12-27 01:25:05,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22015 states to 22015 states and 66470 transitions. [2019-12-27 01:25:05,369 INFO L78 Accepts]: Start accepts. Automaton has 22015 states and 66470 transitions. Word has length 40 [2019-12-27 01:25:05,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:05,370 INFO L462 AbstractCegarLoop]: Abstraction has 22015 states and 66470 transitions. [2019-12-27 01:25:05,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:25:05,370 INFO L276 IsEmpty]: Start isEmpty. Operand 22015 states and 66470 transitions. [2019-12-27 01:25:05,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:25:05,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:05,401 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-27 01:25:05,401 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-27 01:25:05,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:05,401 INFO L82 PathProgramCache]: Analyzing trace with hash -93454286, now seen corresponding path program 2 times [2019-12-27 01:25:05,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:05,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944582539] [2019-12-27 01:25:05,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:05,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944582539] [2019-12-27 01:25:05,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:05,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:25:05,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853817022] [2019-12-27 01:25:05,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:25:05,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:05,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:25:05,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:25:05,508 INFO L87 Difference]: Start difference. First operand 22015 states and 66470 transitions. Second operand 5 states. [2019-12-27 01:25:06,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:06,230 INFO L93 Difference]: Finished difference Result 30046 states and 90242 transitions. [2019-12-27 01:25:06,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:25:06,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:25:06,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:06,284 INFO L225 Difference]: With dead ends: 30046 [2019-12-27 01:25:06,284 INFO L226 Difference]: Without dead ends: 30046 [2019-12-27 01:25:06,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:25:06,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30046 states. [2019-12-27 01:25:06,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30046 to 26807. [2019-12-27 01:25:06,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26807 states. [2019-12-27 01:25:06,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26807 states to 26807 states and 81221 transitions. [2019-12-27 01:25:06,735 INFO L78 Accepts]: Start accepts. Automaton has 26807 states and 81221 transitions. Word has length 40 [2019-12-27 01:25:06,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:06,735 INFO L462 AbstractCegarLoop]: Abstraction has 26807 states and 81221 transitions. [2019-12-27 01:25:06,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:25:06,735 INFO L276 IsEmpty]: Start isEmpty. Operand 26807 states and 81221 transitions. [2019-12-27 01:25:06,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:25:06,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:06,769 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-27 01:25:06,769 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-27 01:25:06,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:06,770 INFO L82 PathProgramCache]: Analyzing trace with hash 152430908, now seen corresponding path program 3 times [2019-12-27 01:25:06,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:06,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144850509] [2019-12-27 01:25:06,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:06,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:06,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144850509] [2019-12-27 01:25:06,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:06,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:25:06,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278926939] [2019-12-27 01:25:06,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:25:06,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:06,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:25:06,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:25:06,822 INFO L87 Difference]: Start difference. First operand 26807 states and 81221 transitions. Second operand 5 states. [2019-12-27 01:25:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:06,949 INFO L93 Difference]: Finished difference Result 25470 states and 78136 transitions. [2019-12-27 01:25:06,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:25:06,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:25:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:06,996 INFO L225 Difference]: With dead ends: 25470 [2019-12-27 01:25:06,996 INFO L226 Difference]: Without dead ends: 25470 [2019-12-27 01:25:06,997 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-27 01:25:07,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25470 states. [2019-12-27 01:25:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25470 to 24504. [2019-12-27 01:25:07,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24504 states. [2019-12-27 01:25:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24504 states to 24504 states and 75530 transitions. [2019-12-27 01:25:07,604 INFO L78 Accepts]: Start accepts. Automaton has 24504 states and 75530 transitions. Word has length 40 [2019-12-27 01:25:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:07,604 INFO L462 AbstractCegarLoop]: Abstraction has 24504 states and 75530 transitions. [2019-12-27 01:25:07,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:25:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 24504 states and 75530 transitions. [2019-12-27 01:25:07,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:25:07,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:07,638 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] [2019-12-27 01:25:07,638 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-27 01:25:07,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:07,639 INFO L82 PathProgramCache]: Analyzing trace with hash 974609302, now seen corresponding path program 1 times [2019-12-27 01:25:07,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:07,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328598269] [2019-12-27 01:25:07,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:07,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:07,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328598269] [2019-12-27 01:25:07,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:07,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:25:07,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707836027] [2019-12-27 01:25:07,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:25:07,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:07,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:25:07,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:25:07,693 INFO L87 Difference]: Start difference. First operand 24504 states and 75530 transitions. Second operand 3 states. [2019-12-27 01:25:07,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:07,877 INFO L93 Difference]: Finished difference Result 34625 states and 106821 transitions. [2019-12-27 01:25:07,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:25:07,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:25:07,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:07,931 INFO L225 Difference]: With dead ends: 34625 [2019-12-27 01:25:07,931 INFO L226 Difference]: Without dead ends: 34625 [2019-12-27 01:25:07,931 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-27 01:25:08,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34625 states. [2019-12-27 01:25:08,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34625 to 27128. [2019-12-27 01:25:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27128 states. [2019-12-27 01:25:08,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27128 states to 27128 states and 84304 transitions. [2019-12-27 01:25:08,447 INFO L78 Accepts]: Start accepts. Automaton has 27128 states and 84304 transitions. Word has length 64 [2019-12-27 01:25:08,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:08,448 INFO L462 AbstractCegarLoop]: Abstraction has 27128 states and 84304 transitions. [2019-12-27 01:25:08,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:25:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand 27128 states and 84304 transitions. [2019-12-27 01:25:08,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:25:08,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:08,477 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] [2019-12-27 01:25:08,477 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-27 01:25:08,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:08,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1487362447, now seen corresponding path program 1 times [2019-12-27 01:25:08,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:08,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249237389] [2019-12-27 01:25:08,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:08,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:08,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249237389] [2019-12-27 01:25:08,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:08,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:25:08,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071913042] [2019-12-27 01:25:08,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:25:08,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:08,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:25:08,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:25:08,566 INFO L87 Difference]: Start difference. First operand 27128 states and 84304 transitions. Second operand 7 states. [2019-12-27 01:25:09,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:09,131 INFO L93 Difference]: Finished difference Result 73273 states and 226524 transitions. [2019-12-27 01:25:09,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:25:09,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:25:09,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:09,230 INFO L225 Difference]: With dead ends: 73273 [2019-12-27 01:25:09,231 INFO L226 Difference]: Without dead ends: 55201 [2019-12-27 01:25:09,231 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-27 01:25:09,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55201 states. [2019-12-27 01:25:10,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55201 to 31445. [2019-12-27 01:25:10,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31445 states. [2019-12-27 01:25:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31445 states to 31445 states and 97708 transitions. [2019-12-27 01:25:10,268 INFO L78 Accepts]: Start accepts. Automaton has 31445 states and 97708 transitions. Word has length 64 [2019-12-27 01:25:10,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:10,268 INFO L462 AbstractCegarLoop]: Abstraction has 31445 states and 97708 transitions. [2019-12-27 01:25:10,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:25:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 31445 states and 97708 transitions. [2019-12-27 01:25:10,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:25:10,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:10,302 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] [2019-12-27 01:25:10,302 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-27 01:25:10,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:10,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1007546921, now seen corresponding path program 2 times [2019-12-27 01:25:10,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:10,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823127313] [2019-12-27 01:25:10,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:10,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823127313] [2019-12-27 01:25:10,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:10,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:25:10,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567047834] [2019-12-27 01:25:10,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:25:10,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:10,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:25:10,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:25:10,394 INFO L87 Difference]: Start difference. First operand 31445 states and 97708 transitions. Second operand 7 states. [2019-12-27 01:25:10,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:10,958 INFO L93 Difference]: Finished difference Result 81140 states and 248111 transitions. [2019-12-27 01:25:10,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:25:10,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:25:10,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:11,046 INFO L225 Difference]: With dead ends: 81140 [2019-12-27 01:25:11,046 INFO L226 Difference]: Without dead ends: 57495 [2019-12-27 01:25:11,047 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-27 01:25:11,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57495 states. [2019-12-27 01:25:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57495 to 35246. [2019-12-27 01:25:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35246 states. [2019-12-27 01:25:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35246 states to 35246 states and 109148 transitions. [2019-12-27 01:25:11,807 INFO L78 Accepts]: Start accepts. Automaton has 35246 states and 109148 transitions. Word has length 64 [2019-12-27 01:25:11,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:11,807 INFO L462 AbstractCegarLoop]: Abstraction has 35246 states and 109148 transitions. [2019-12-27 01:25:11,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:25:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand 35246 states and 109148 transitions. [2019-12-27 01:25:11,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:25:11,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:11,847 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] [2019-12-27 01:25:11,848 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-27 01:25:11,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:11,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1228276157, now seen corresponding path program 3 times [2019-12-27 01:25:11,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:11,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360490528] [2019-12-27 01:25:11,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:11,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360490528] [2019-12-27 01:25:11,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:11,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:25:11,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651917841] [2019-12-27 01:25:11,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:25:11,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:11,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:25:11,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:25:11,957 INFO L87 Difference]: Start difference. First operand 35246 states and 109148 transitions. Second operand 8 states. [2019-12-27 01:25:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:13,115 INFO L93 Difference]: Finished difference Result 98595 states and 302496 transitions. [2019-12-27 01:25:13,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 01:25:13,115 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 01:25:13,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:13,569 INFO L225 Difference]: With dead ends: 98595 [2019-12-27 01:25:13,570 INFO L226 Difference]: Without dead ends: 87943 [2019-12-27 01:25:13,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-27 01:25:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87943 states. [2019-12-27 01:25:14,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87943 to 35744. [2019-12-27 01:25:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35744 states. [2019-12-27 01:25:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35744 states to 35744 states and 111048 transitions. [2019-12-27 01:25:14,547 INFO L78 Accepts]: Start accepts. Automaton has 35744 states and 111048 transitions. Word has length 64 [2019-12-27 01:25:14,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:14,547 INFO L462 AbstractCegarLoop]: Abstraction has 35744 states and 111048 transitions. [2019-12-27 01:25:14,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:25:14,547 INFO L276 IsEmpty]: Start isEmpty. Operand 35744 states and 111048 transitions. [2019-12-27 01:25:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:25:14,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:14,585 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] [2019-12-27 01:25:14,585 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-27 01:25:14,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:14,585 INFO L82 PathProgramCache]: Analyzing trace with hash -2056816817, now seen corresponding path program 4 times [2019-12-27 01:25:14,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:14,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014113929] [2019-12-27 01:25:14,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:14,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:14,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014113929] [2019-12-27 01:25:14,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:14,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:25:14,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815868270] [2019-12-27 01:25:14,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:25:14,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:14,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:25:14,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:25:14,691 INFO L87 Difference]: Start difference. First operand 35744 states and 111048 transitions. Second operand 9 states. [2019-12-27 01:25:16,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:16,568 INFO L93 Difference]: Finished difference Result 119468 states and 363005 transitions. [2019-12-27 01:25:16,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 01:25:16,568 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:25:16,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:16,750 INFO L225 Difference]: With dead ends: 119468 [2019-12-27 01:25:16,750 INFO L226 Difference]: Without dead ends: 105156 [2019-12-27 01:25:16,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-12-27 01:25:17,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105156 states. [2019-12-27 01:25:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105156 to 35780. [2019-12-27 01:25:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35780 states. [2019-12-27 01:25:18,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35780 states to 35780 states and 111205 transitions. [2019-12-27 01:25:18,273 INFO L78 Accepts]: Start accepts. Automaton has 35780 states and 111205 transitions. Word has length 64 [2019-12-27 01:25:18,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:18,273 INFO L462 AbstractCegarLoop]: Abstraction has 35780 states and 111205 transitions. [2019-12-27 01:25:18,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:25:18,274 INFO L276 IsEmpty]: Start isEmpty. Operand 35780 states and 111205 transitions. [2019-12-27 01:25:18,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:25:18,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:18,312 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] [2019-12-27 01:25:18,312 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-27 01:25:18,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:18,312 INFO L82 PathProgramCache]: Analyzing trace with hash 836129701, now seen corresponding path program 5 times [2019-12-27 01:25:18,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:18,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438978576] [2019-12-27 01:25:18,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:18,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438978576] [2019-12-27 01:25:18,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:18,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:25:18,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632262827] [2019-12-27 01:25:18,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:25:18,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:18,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:25:18,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:25:18,431 INFO L87 Difference]: Start difference. First operand 35780 states and 111205 transitions. Second operand 9 states. [2019-12-27 01:25:19,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:19,982 INFO L93 Difference]: Finished difference Result 131669 states and 399951 transitions. [2019-12-27 01:25:19,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 01:25:19,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:25:19,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:20,175 INFO L225 Difference]: With dead ends: 131669 [2019-12-27 01:25:20,175 INFO L226 Difference]: Without dead ends: 121803 [2019-12-27 01:25:20,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2019-12-27 01:25:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121803 states. [2019-12-27 01:25:21,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121803 to 35817. [2019-12-27 01:25:21,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35817 states. [2019-12-27 01:25:21,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35817 states to 35817 states and 111367 transitions. [2019-12-27 01:25:21,829 INFO L78 Accepts]: Start accepts. Automaton has 35817 states and 111367 transitions. Word has length 64 [2019-12-27 01:25:21,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:21,829 INFO L462 AbstractCegarLoop]: Abstraction has 35817 states and 111367 transitions. [2019-12-27 01:25:21,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:25:21,830 INFO L276 IsEmpty]: Start isEmpty. Operand 35817 states and 111367 transitions. [2019-12-27 01:25:21,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:25:21,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:21,868 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] [2019-12-27 01:25:21,868 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-27 01:25:21,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:21,868 INFO L82 PathProgramCache]: Analyzing trace with hash -17789391, now seen corresponding path program 6 times [2019-12-27 01:25:21,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:21,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788967078] [2019-12-27 01:25:21,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:21,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:21,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788967078] [2019-12-27 01:25:21,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:21,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:25:21,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105550328] [2019-12-27 01:25:21,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:25:21,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:21,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:25:21,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:25:21,936 INFO L87 Difference]: Start difference. First operand 35817 states and 111367 transitions. Second operand 3 states. [2019-12-27 01:25:22,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:22,222 INFO L93 Difference]: Finished difference Result 42547 states and 131537 transitions. [2019-12-27 01:25:22,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:25:22,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:25:22,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:22,331 INFO L225 Difference]: With dead ends: 42547 [2019-12-27 01:25:22,331 INFO L226 Difference]: Without dead ends: 42547 [2019-12-27 01:25:22,331 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-27 01:25:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42547 states. [2019-12-27 01:25:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42547 to 37071. [2019-12-27 01:25:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37071 states. [2019-12-27 01:25:23,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37071 states to 37071 states and 115326 transitions. [2019-12-27 01:25:23,279 INFO L78 Accepts]: Start accepts. Automaton has 37071 states and 115326 transitions. Word has length 64 [2019-12-27 01:25:23,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:23,279 INFO L462 AbstractCegarLoop]: Abstraction has 37071 states and 115326 transitions. [2019-12-27 01:25:23,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:25:23,280 INFO L276 IsEmpty]: Start isEmpty. Operand 37071 states and 115326 transitions. [2019-12-27 01:25:23,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:25:23,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:23,319 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-27 01:25:23,319 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-27 01:25:23,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:23,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1046831716, now seen corresponding path program 1 times [2019-12-27 01:25:23,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:23,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078234936] [2019-12-27 01:25:23,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:23,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:23,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078234936] [2019-12-27 01:25:23,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:23,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:25:23,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088100978] [2019-12-27 01:25:23,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:25:23,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:23,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:25:23,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:25:23,411 INFO L87 Difference]: Start difference. First operand 37071 states and 115326 transitions. Second operand 8 states. [2019-12-27 01:25:24,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:24,997 INFO L93 Difference]: Finished difference Result 111740 states and 339408 transitions. [2019-12-27 01:25:24,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 01:25:24,998 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 01:25:24,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:25,163 INFO L225 Difference]: With dead ends: 111740 [2019-12-27 01:25:25,163 INFO L226 Difference]: Without dead ends: 99733 [2019-12-27 01:25:25,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-27 01:25:25,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99733 states. [2019-12-27 01:25:26,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99733 to 37073. [2019-12-27 01:25:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37073 states. [2019-12-27 01:25:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37073 states to 37073 states and 115341 transitions. [2019-12-27 01:25:26,258 INFO L78 Accepts]: Start accepts. Automaton has 37073 states and 115341 transitions. Word has length 65 [2019-12-27 01:25:26,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:26,258 INFO L462 AbstractCegarLoop]: Abstraction has 37073 states and 115341 transitions. [2019-12-27 01:25:26,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:25:26,258 INFO L276 IsEmpty]: Start isEmpty. Operand 37073 states and 115341 transitions. [2019-12-27 01:25:26,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:25:26,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:26,300 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-27 01:25:26,300 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-27 01:25:26,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:26,301 INFO L82 PathProgramCache]: Analyzing trace with hash 501635668, now seen corresponding path program 2 times [2019-12-27 01:25:26,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:26,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202825745] [2019-12-27 01:25:26,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:26,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202825745] [2019-12-27 01:25:26,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:26,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:25:26,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519709305] [2019-12-27 01:25:26,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:25:26,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:26,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:25:26,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:25:26,414 INFO L87 Difference]: Start difference. First operand 37073 states and 115341 transitions. Second operand 9 states. [2019-12-27 01:25:28,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:28,033 INFO L93 Difference]: Finished difference Result 134194 states and 407074 transitions. [2019-12-27 01:25:28,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 01:25:28,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 01:25:28,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:28,221 INFO L225 Difference]: With dead ends: 134194 [2019-12-27 01:25:28,221 INFO L226 Difference]: Without dead ends: 122325 [2019-12-27 01:25:28,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-12-27 01:25:28,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122325 states. [2019-12-27 01:25:29,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122325 to 37029. [2019-12-27 01:25:29,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37029 states. [2019-12-27 01:25:29,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37029 states to 37029 states and 115116 transitions. [2019-12-27 01:25:29,882 INFO L78 Accepts]: Start accepts. Automaton has 37029 states and 115116 transitions. Word has length 65 [2019-12-27 01:25:29,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:29,882 INFO L462 AbstractCegarLoop]: Abstraction has 37029 states and 115116 transitions. [2019-12-27 01:25:29,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:25:29,882 INFO L276 IsEmpty]: Start isEmpty. Operand 37029 states and 115116 transitions. [2019-12-27 01:25:29,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:25:29,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:29,922 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-27 01:25:29,922 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-27 01:25:29,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:29,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1293437306, now seen corresponding path program 3 times [2019-12-27 01:25:29,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:29,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320621344] [2019-12-27 01:25:29,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:30,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320621344] [2019-12-27 01:25:30,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:30,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:25:30,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473825716] [2019-12-27 01:25:30,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:25:30,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:30,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:25:30,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:25:30,037 INFO L87 Difference]: Start difference. First operand 37029 states and 115116 transitions. Second operand 9 states. [2019-12-27 01:25:31,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:31,976 INFO L93 Difference]: Finished difference Result 153077 states and 465403 transitions. [2019-12-27 01:25:31,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 01:25:31,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 01:25:31,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:32,178 INFO L225 Difference]: With dead ends: 153077 [2019-12-27 01:25:32,178 INFO L226 Difference]: Without dead ends: 125434 [2019-12-27 01:25:32,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2019-12-27 01:25:32,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125434 states. [2019-12-27 01:25:33,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125434 to 40153. [2019-12-27 01:25:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40153 states. [2019-12-27 01:25:33,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40153 states to 40153 states and 125039 transitions. [2019-12-27 01:25:33,961 INFO L78 Accepts]: Start accepts. Automaton has 40153 states and 125039 transitions. Word has length 65 [2019-12-27 01:25:33,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:33,962 INFO L462 AbstractCegarLoop]: Abstraction has 40153 states and 125039 transitions. [2019-12-27 01:25:33,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:25:33,962 INFO L276 IsEmpty]: Start isEmpty. Operand 40153 states and 125039 transitions. [2019-12-27 01:25:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:25:34,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:34,005 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-27 01:25:34,005 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-27 01:25:34,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:34,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1980366454, now seen corresponding path program 4 times [2019-12-27 01:25:34,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:34,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107726335] [2019-12-27 01:25:34,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:34,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:34,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107726335] [2019-12-27 01:25:34,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:34,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:25:34,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787402444] [2019-12-27 01:25:34,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:25:34,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:34,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:25:34,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:25:34,104 INFO L87 Difference]: Start difference. First operand 40153 states and 125039 transitions. Second operand 7 states. [2019-12-27 01:25:35,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:35,144 INFO L93 Difference]: Finished difference Result 55596 states and 169227 transitions. [2019-12-27 01:25:35,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 01:25:35,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 01:25:35,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:35,227 INFO L225 Difference]: With dead ends: 55596 [2019-12-27 01:25:35,227 INFO L226 Difference]: Without dead ends: 55596 [2019-12-27 01:25:35,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:25:35,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55596 states. [2019-12-27 01:25:35,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55596 to 42525. [2019-12-27 01:25:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42525 states. [2019-12-27 01:25:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42525 states to 42525 states and 131689 transitions. [2019-12-27 01:25:36,025 INFO L78 Accepts]: Start accepts. Automaton has 42525 states and 131689 transitions. Word has length 65 [2019-12-27 01:25:36,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:36,025 INFO L462 AbstractCegarLoop]: Abstraction has 42525 states and 131689 transitions. [2019-12-27 01:25:36,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:25:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 42525 states and 131689 transitions. [2019-12-27 01:25:36,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:25:36,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:36,070 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-27 01:25:36,070 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-27 01:25:36,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:36,071 INFO L82 PathProgramCache]: Analyzing trace with hash -25014344, now seen corresponding path program 5 times [2019-12-27 01:25:36,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:36,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252574831] [2019-12-27 01:25:36,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:36,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252574831] [2019-12-27 01:25:36,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:36,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:25:36,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618994681] [2019-12-27 01:25:36,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:25:36,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:36,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:25:36,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:25:36,218 INFO L87 Difference]: Start difference. First operand 42525 states and 131689 transitions. Second operand 9 states. [2019-12-27 01:25:38,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:38,524 INFO L93 Difference]: Finished difference Result 66164 states and 202890 transitions. [2019-12-27 01:25:38,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 01:25:38,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 01:25:38,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:38,621 INFO L225 Difference]: With dead ends: 66164 [2019-12-27 01:25:38,621 INFO L226 Difference]: Without dead ends: 66164 [2019-12-27 01:25:38,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:25:38,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66164 states. [2019-12-27 01:25:39,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66164 to 41944. [2019-12-27 01:25:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41944 states. [2019-12-27 01:25:39,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41944 states to 41944 states and 130085 transitions. [2019-12-27 01:25:39,481 INFO L78 Accepts]: Start accepts. Automaton has 41944 states and 130085 transitions. Word has length 65 [2019-12-27 01:25:39,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:39,482 INFO L462 AbstractCegarLoop]: Abstraction has 41944 states and 130085 transitions. [2019-12-27 01:25:39,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:25:39,482 INFO L276 IsEmpty]: Start isEmpty. Operand 41944 states and 130085 transitions. [2019-12-27 01:25:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:25:39,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:39,527 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-27 01:25:39,527 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-27 01:25:39,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:39,527 INFO L82 PathProgramCache]: Analyzing trace with hash 373916454, now seen corresponding path program 1 times [2019-12-27 01:25:39,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:39,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067538622] [2019-12-27 01:25:39,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:39,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:39,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067538622] [2019-12-27 01:25:39,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:39,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:25:39,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896414072] [2019-12-27 01:25:39,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:25:39,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:39,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:25:39,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:25:39,651 INFO L87 Difference]: Start difference. First operand 41944 states and 130085 transitions. Second operand 8 states. [2019-12-27 01:25:41,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:41,281 INFO L93 Difference]: Finished difference Result 55795 states and 168786 transitions. [2019-12-27 01:25:41,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 01:25:41,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 01:25:41,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:41,360 INFO L225 Difference]: With dead ends: 55795 [2019-12-27 01:25:41,360 INFO L226 Difference]: Without dead ends: 55795 [2019-12-27 01:25:41,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-12-27 01:25:41,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55795 states. [2019-12-27 01:25:42,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55795 to 43437. [2019-12-27 01:25:42,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43437 states. [2019-12-27 01:25:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43437 states to 43437 states and 134338 transitions. [2019-12-27 01:25:42,166 INFO L78 Accepts]: Start accepts. Automaton has 43437 states and 134338 transitions. Word has length 65 [2019-12-27 01:25:42,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:42,167 INFO L462 AbstractCegarLoop]: Abstraction has 43437 states and 134338 transitions. [2019-12-27 01:25:42,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:25:42,167 INFO L276 IsEmpty]: Start isEmpty. Operand 43437 states and 134338 transitions. [2019-12-27 01:25:42,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:25:42,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:42,213 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-27 01:25:42,213 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-27 01:25:42,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:42,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1193547640, now seen corresponding path program 2 times [2019-12-27 01:25:42,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:42,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825473695] [2019-12-27 01:25:42,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:42,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:42,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825473695] [2019-12-27 01:25:42,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:42,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:25:42,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994634800] [2019-12-27 01:25:42,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:25:42,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:42,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:25:42,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:25:42,404 INFO L87 Difference]: Start difference. First operand 43437 states and 134338 transitions. Second operand 9 states. [2019-12-27 01:25:44,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:44,123 INFO L93 Difference]: Finished difference Result 66620 states and 204092 transitions. [2019-12-27 01:25:44,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 01:25:44,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 01:25:44,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:44,222 INFO L225 Difference]: With dead ends: 66620 [2019-12-27 01:25:44,222 INFO L226 Difference]: Without dead ends: 66620 [2019-12-27 01:25:44,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:25:44,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66620 states. [2019-12-27 01:25:45,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66620 to 43912. [2019-12-27 01:25:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43912 states. [2019-12-27 01:25:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43912 states to 43912 states and 136009 transitions. [2019-12-27 01:25:45,144 INFO L78 Accepts]: Start accepts. Automaton has 43912 states and 136009 transitions. Word has length 65 [2019-12-27 01:25:45,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:45,145 INFO L462 AbstractCegarLoop]: Abstraction has 43912 states and 136009 transitions. [2019-12-27 01:25:45,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:25:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand 43912 states and 136009 transitions. [2019-12-27 01:25:45,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:25:45,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:45,191 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-27 01:25:45,191 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-27 01:25:45,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:45,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1646807062, now seen corresponding path program 3 times [2019-12-27 01:25:45,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:45,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799106184] [2019-12-27 01:25:45,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:45,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799106184] [2019-12-27 01:25:45,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:45,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:25:45,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874266965] [2019-12-27 01:25:45,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:25:45,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:45,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:25:45,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:25:45,257 INFO L87 Difference]: Start difference. First operand 43912 states and 136009 transitions. Second operand 3 states. [2019-12-27 01:25:45,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:45,465 INFO L93 Difference]: Finished difference Result 43911 states and 136007 transitions. [2019-12-27 01:25:45,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:25:45,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 01:25:45,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:45,574 INFO L225 Difference]: With dead ends: 43911 [2019-12-27 01:25:45,574 INFO L226 Difference]: Without dead ends: 43911 [2019-12-27 01:25:45,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:25:45,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43911 states. [2019-12-27 01:25:46,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43911 to 33680. [2019-12-27 01:25:46,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33680 states. [2019-12-27 01:25:46,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33680 states to 33680 states and 106815 transitions. [2019-12-27 01:25:46,763 INFO L78 Accepts]: Start accepts. Automaton has 33680 states and 106815 transitions. Word has length 65 [2019-12-27 01:25:46,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:46,763 INFO L462 AbstractCegarLoop]: Abstraction has 33680 states and 106815 transitions. [2019-12-27 01:25:46,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:25:46,763 INFO L276 IsEmpty]: Start isEmpty. Operand 33680 states and 106815 transitions. [2019-12-27 01:25:46,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:25:46,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:46,800 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-27 01:25:46,800 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-27 01:25:46,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:46,800 INFO L82 PathProgramCache]: Analyzing trace with hash 392067852, now seen corresponding path program 1 times [2019-12-27 01:25:46,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:46,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532054330] [2019-12-27 01:25:46,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:46,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:46,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532054330] [2019-12-27 01:25:46,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:46,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:25:46,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259773982] [2019-12-27 01:25:46,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:25:46,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:46,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:25:46,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:25:46,889 INFO L87 Difference]: Start difference. First operand 33680 states and 106815 transitions. Second operand 3 states. [2019-12-27 01:25:47,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:47,003 INFO L93 Difference]: Finished difference Result 26975 states and 84191 transitions. [2019-12-27 01:25:47,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:25:47,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 01:25:47,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:47,045 INFO L225 Difference]: With dead ends: 26975 [2019-12-27 01:25:47,045 INFO L226 Difference]: Without dead ends: 26975 [2019-12-27 01:25:47,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:25:47,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26975 states. [2019-12-27 01:25:47,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26975 to 25149. [2019-12-27 01:25:47,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25149 states. [2019-12-27 01:25:47,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25149 states to 25149 states and 78181 transitions. [2019-12-27 01:25:47,644 INFO L78 Accepts]: Start accepts. Automaton has 25149 states and 78181 transitions. Word has length 66 [2019-12-27 01:25:47,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:47,644 INFO L462 AbstractCegarLoop]: Abstraction has 25149 states and 78181 transitions. [2019-12-27 01:25:47,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:25:47,644 INFO L276 IsEmpty]: Start isEmpty. Operand 25149 states and 78181 transitions. [2019-12-27 01:25:47,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:25:47,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:47,673 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-27 01:25:47,673 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-27 01:25:47,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:47,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1912825147, now seen corresponding path program 1 times [2019-12-27 01:25:47,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:47,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740607416] [2019-12-27 01:25:47,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:47,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740607416] [2019-12-27 01:25:47,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:47,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:25:47,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669357111] [2019-12-27 01:25:47,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:25:47,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:47,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:25:47,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:25:47,804 INFO L87 Difference]: Start difference. First operand 25149 states and 78181 transitions. Second operand 9 states. [2019-12-27 01:25:49,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:49,471 INFO L93 Difference]: Finished difference Result 49581 states and 153164 transitions. [2019-12-27 01:25:49,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 01:25:49,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 01:25:49,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:49,529 INFO L225 Difference]: With dead ends: 49581 [2019-12-27 01:25:49,529 INFO L226 Difference]: Without dead ends: 40302 [2019-12-27 01:25:49,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-27 01:25:49,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40302 states. [2019-12-27 01:25:50,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40302 to 25954. [2019-12-27 01:25:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25954 states. [2019-12-27 01:25:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25954 states to 25954 states and 80170 transitions. [2019-12-27 01:25:50,064 INFO L78 Accepts]: Start accepts. Automaton has 25954 states and 80170 transitions. Word has length 67 [2019-12-27 01:25:50,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:50,064 INFO L462 AbstractCegarLoop]: Abstraction has 25954 states and 80170 transitions. [2019-12-27 01:25:50,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:25:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand 25954 states and 80170 transitions. [2019-12-27 01:25:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:25:50,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:50,091 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-27 01:25:50,091 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-27 01:25:50,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:50,091 INFO L82 PathProgramCache]: Analyzing trace with hash 815980505, now seen corresponding path program 2 times [2019-12-27 01:25:50,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:50,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192891506] [2019-12-27 01:25:50,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:50,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192891506] [2019-12-27 01:25:50,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:50,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:25:50,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688942604] [2019-12-27 01:25:50,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:25:50,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:50,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:25:50,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:25:50,162 INFO L87 Difference]: Start difference. First operand 25954 states and 80170 transitions. Second operand 4 states. [2019-12-27 01:25:50,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:50,355 INFO L93 Difference]: Finished difference Result 25954 states and 79946 transitions. [2019-12-27 01:25:50,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:25:50,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 01:25:50,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:50,421 INFO L225 Difference]: With dead ends: 25954 [2019-12-27 01:25:50,422 INFO L226 Difference]: Without dead ends: 25954 [2019-12-27 01:25:50,422 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-27 01:25:50,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25954 states. [2019-12-27 01:25:50,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25954 to 22778. [2019-12-27 01:25:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22778 states. [2019-12-27 01:25:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22778 states to 22778 states and 70805 transitions. [2019-12-27 01:25:50,988 INFO L78 Accepts]: Start accepts. Automaton has 22778 states and 70805 transitions. Word has length 67 [2019-12-27 01:25:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:50,988 INFO L462 AbstractCegarLoop]: Abstraction has 22778 states and 70805 transitions. [2019-12-27 01:25:50,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:25:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 22778 states and 70805 transitions. [2019-12-27 01:25:51,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:25:51,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:51,011 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-27 01:25:51,012 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:25:51,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:51,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1535531457, now seen corresponding path program 1 times [2019-12-27 01:25:51,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:51,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086540236] [2019-12-27 01:25:51,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:51,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086540236] [2019-12-27 01:25:51,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:51,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:25:51,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127036256] [2019-12-27 01:25:51,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:25:51,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:51,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:25:51,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:25:51,196 INFO L87 Difference]: Start difference. First operand 22778 states and 70805 transitions. Second operand 10 states. [2019-12-27 01:25:52,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:52,162 INFO L93 Difference]: Finished difference Result 44683 states and 137584 transitions. [2019-12-27 01:25:52,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 01:25:52,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 01:25:52,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:52,223 INFO L225 Difference]: With dead ends: 44683 [2019-12-27 01:25:52,223 INFO L226 Difference]: Without dead ends: 42768 [2019-12-27 01:25:52,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2019-12-27 01:25:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42768 states. [2019-12-27 01:25:52,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42768 to 26032. [2019-12-27 01:25:52,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26032 states. [2019-12-27 01:25:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26032 states to 26032 states and 80627 transitions. [2019-12-27 01:25:52,939 INFO L78 Accepts]: Start accepts. Automaton has 26032 states and 80627 transitions. Word has length 67 [2019-12-27 01:25:52,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:52,939 INFO L462 AbstractCegarLoop]: Abstraction has 26032 states and 80627 transitions. [2019-12-27 01:25:52,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:25:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 26032 states and 80627 transitions. [2019-12-27 01:25:52,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:25:52,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:52,969 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-27 01:25:52,969 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:25:52,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:52,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1442171729, now seen corresponding path program 2 times [2019-12-27 01:25:52,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:52,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779218315] [2019-12-27 01:25:52,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:53,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:53,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779218315] [2019-12-27 01:25:53,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:53,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:25:53,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684458842] [2019-12-27 01:25:53,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:25:53,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:53,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:25:53,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:25:53,094 INFO L87 Difference]: Start difference. First operand 26032 states and 80627 transitions. Second operand 10 states. [2019-12-27 01:25:54,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:54,100 INFO L93 Difference]: Finished difference Result 43340 states and 133082 transitions. [2019-12-27 01:25:54,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:25:54,101 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 01:25:54,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:54,151 INFO L225 Difference]: With dead ends: 43340 [2019-12-27 01:25:54,151 INFO L226 Difference]: Without dead ends: 36825 [2019-12-27 01:25:54,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 01:25:54,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36825 states. [2019-12-27 01:25:54,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36825 to 22389. [2019-12-27 01:25:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22389 states. [2019-12-27 01:25:54,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22389 states to 22389 states and 69376 transitions. [2019-12-27 01:25:54,602 INFO L78 Accepts]: Start accepts. Automaton has 22389 states and 69376 transitions. Word has length 67 [2019-12-27 01:25:54,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:54,602 INFO L462 AbstractCegarLoop]: Abstraction has 22389 states and 69376 transitions. [2019-12-27 01:25:54,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:25:54,602 INFO L276 IsEmpty]: Start isEmpty. Operand 22389 states and 69376 transitions. [2019-12-27 01:25:54,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:25:54,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:54,623 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-27 01:25:54,623 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:25:54,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:54,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2065446981, now seen corresponding path program 3 times [2019-12-27 01:25:54,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:54,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141926867] [2019-12-27 01:25:54,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:54,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141926867] [2019-12-27 01:25:54,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:54,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:25:54,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669761028] [2019-12-27 01:25:54,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:25:54,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:54,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:25:54,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:25:54,781 INFO L87 Difference]: Start difference. First operand 22389 states and 69376 transitions. Second operand 11 states. [2019-12-27 01:25:55,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:55,817 INFO L93 Difference]: Finished difference Result 39336 states and 121084 transitions. [2019-12-27 01:25:55,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 01:25:55,817 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 01:25:55,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:55,869 INFO L225 Difference]: With dead ends: 39336 [2019-12-27 01:25:55,870 INFO L226 Difference]: Without dead ends: 38317 [2019-12-27 01:25:55,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-27 01:25:56,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38317 states. [2019-12-27 01:25:56,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38317 to 24692. [2019-12-27 01:25:56,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24692 states. [2019-12-27 01:25:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24692 states to 24692 states and 76375 transitions. [2019-12-27 01:25:56,388 INFO L78 Accepts]: Start accepts. Automaton has 24692 states and 76375 transitions. Word has length 67 [2019-12-27 01:25:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:56,388 INFO L462 AbstractCegarLoop]: Abstraction has 24692 states and 76375 transitions. [2019-12-27 01:25:56,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:25:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 24692 states and 76375 transitions. [2019-12-27 01:25:56,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:25:56,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:56,416 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-27 01:25:56,417 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:25:56,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:56,417 INFO L82 PathProgramCache]: Analyzing trace with hash 2136160587, now seen corresponding path program 4 times [2019-12-27 01:25:56,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:56,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256419318] [2019-12-27 01:25:56,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:56,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:56,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256419318] [2019-12-27 01:25:56,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:56,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 01:25:56,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644722373] [2019-12-27 01:25:56,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 01:25:56,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:56,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 01:25:56,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:25:56,967 INFO L87 Difference]: Start difference. First operand 24692 states and 76375 transitions. Second operand 18 states. [2019-12-27 01:26:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:01,393 INFO L93 Difference]: Finished difference Result 40846 states and 123183 transitions. [2019-12-27 01:26:01,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 01:26:01,394 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-27 01:26:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:01,446 INFO L225 Difference]: With dead ends: 40846 [2019-12-27 01:26:01,447 INFO L226 Difference]: Without dead ends: 39379 [2019-12-27 01:26:01,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=292, Invalid=1268, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 01:26:01,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39379 states. [2019-12-27 01:26:01,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39379 to 24908. [2019-12-27 01:26:01,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24908 states. [2019-12-27 01:26:01,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24908 states to 24908 states and 76938 transitions. [2019-12-27 01:26:01,944 INFO L78 Accepts]: Start accepts. Automaton has 24908 states and 76938 transitions. Word has length 67 [2019-12-27 01:26:01,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:01,944 INFO L462 AbstractCegarLoop]: Abstraction has 24908 states and 76938 transitions. [2019-12-27 01:26:01,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 01:26:01,944 INFO L276 IsEmpty]: Start isEmpty. Operand 24908 states and 76938 transitions. [2019-12-27 01:26:01,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:26:01,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:01,970 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-27 01:26:01,970 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:01,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:01,970 INFO L82 PathProgramCache]: Analyzing trace with hash -83242899, now seen corresponding path program 5 times [2019-12-27 01:26:01,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:01,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640054826] [2019-12-27 01:26:01,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:02,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:02,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640054826] [2019-12-27 01:26:02,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:02,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:26:02,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734657179] [2019-12-27 01:26:02,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:26:02,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:02,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:26:02,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:26:02,121 INFO L87 Difference]: Start difference. First operand 24908 states and 76938 transitions. Second operand 11 states. [2019-12-27 01:26:03,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:03,112 INFO L93 Difference]: Finished difference Result 39095 states and 119829 transitions. [2019-12-27 01:26:03,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 01:26:03,113 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 01:26:03,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:03,160 INFO L225 Difference]: With dead ends: 39095 [2019-12-27 01:26:03,160 INFO L226 Difference]: Without dead ends: 35558 [2019-12-27 01:26:03,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-27 01:26:03,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35558 states. [2019-12-27 01:26:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35558 to 21700. [2019-12-27 01:26:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21700 states. [2019-12-27 01:26:03,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21700 states to 21700 states and 67268 transitions. [2019-12-27 01:26:03,589 INFO L78 Accepts]: Start accepts. Automaton has 21700 states and 67268 transitions. Word has length 67 [2019-12-27 01:26:03,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:03,590 INFO L462 AbstractCegarLoop]: Abstraction has 21700 states and 67268 transitions. [2019-12-27 01:26:03,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:26:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 21700 states and 67268 transitions. [2019-12-27 01:26:03,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:26:03,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:03,609 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-27 01:26:03,610 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:03,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:03,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1853423759, now seen corresponding path program 6 times [2019-12-27 01:26:03,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:03,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971457804] [2019-12-27 01:26:03,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:03,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971457804] [2019-12-27 01:26:03,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:03,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:26:03,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610449820] [2019-12-27 01:26:03,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:26:03,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:03,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:26:03,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:26:03,858 INFO L87 Difference]: Start difference. First operand 21700 states and 67268 transitions. Second operand 12 states. [2019-12-27 01:26:04,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:04,797 INFO L93 Difference]: Finished difference Result 35737 states and 109819 transitions. [2019-12-27 01:26:04,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:26:04,797 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 01:26:04,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:04,846 INFO L225 Difference]: With dead ends: 35737 [2019-12-27 01:26:04,846 INFO L226 Difference]: Without dead ends: 35526 [2019-12-27 01:26:04,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 01:26:04,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35526 states. [2019-12-27 01:26:05,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35526 to 21524. [2019-12-27 01:26:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21524 states. [2019-12-27 01:26:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21524 states to 21524 states and 66796 transitions. [2019-12-27 01:26:05,447 INFO L78 Accepts]: Start accepts. Automaton has 21524 states and 66796 transitions. Word has length 67 [2019-12-27 01:26:05,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:05,447 INFO L462 AbstractCegarLoop]: Abstraction has 21524 states and 66796 transitions. [2019-12-27 01:26:05,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:26:05,447 INFO L276 IsEmpty]: Start isEmpty. Operand 21524 states and 66796 transitions. [2019-12-27 01:26:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:26:05,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:05,470 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-27 01:26:05,470 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:05,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:05,470 INFO L82 PathProgramCache]: Analyzing trace with hash 594227727, now seen corresponding path program 7 times [2019-12-27 01:26:05,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:05,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145177166] [2019-12-27 01:26:05,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:26:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:26:05,605 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:26:05,605 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:26:05,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~x~0_45 0) (= 0 v_~a$w_buff0_used~0_768) (= v_~y~0_18 0) (= 0 v_~a$r_buff1_thd1~0_150) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t257~0.base_33|) (= 0 v_~__unbuffered_p2_EAX~0_31) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$w_buff1_used~0_426) (= v_~main$tmp_guard0~0_29 0) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$w_buff1~0_200) (= v_~a$r_buff1_thd3~0_269 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~__unbuffered_p0_EAX~0_111) (= v_~a$r_buff0_thd3~0_320 0) (= v_~a~0_184 0) (= 0 |v_ULTIMATE.start_main_~#t257~0.offset_23|) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~__unbuffered_cnt~0_102 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t257~0.base_33| 4) |v_#length_21|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t257~0.base_33|)) (= 0 |v_#NULL.base_4|) (= v_~a$flush_delayed~0_25 0) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$r_buff0_thd0~0_107 0) (= v_~main$tmp_guard1~0_32 0) (= v_~a$r_buff1_thd0~0_160 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t257~0.base_33| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t257~0.base_33|) |v_ULTIMATE.start_main_~#t257~0.offset_23| 0)) |v_#memory_int_19|) (= v_~a$w_buff0~0_274 0) (= v_~z~0_21 0) (= |v_#NULL.offset_4| 0) (= v_~a$mem_tmp~0_14 0) (= 0 v_~a$r_buff0_thd1~0_184) (= 0 v_~a$r_buff1_thd2~0_145) (= v_~a$r_buff0_thd2~0_95 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t257~0.base_33| 1) |v_#valid_63|) (= v_~weak$$choice2~0_110 0) (= v_~__unbuffered_p2_EBX~0_40 0) (= 0 v_~a$read_delayed~0_8) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t258~0.offset=|v_ULTIMATE.start_main_~#t258~0.offset_19|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_145, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_67|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_471|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ~a~0=v_~a~0_184, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_111, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_40, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_269, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_768, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_184, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_274, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_45, ULTIMATE.start_main_~#t259~0.base=|v_ULTIMATE.start_main_~#t259~0.base_25|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_95, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ULTIMATE.start_main_~#t257~0.offset=|v_ULTIMATE.start_main_~#t257~0.offset_23|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_29|, ~a$w_buff1~0=v_~a$w_buff1~0_200, ~y~0=v_~y~0_18, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_150, ULTIMATE.start_main_~#t257~0.base=|v_ULTIMATE.start_main_~#t257~0.base_33|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t258~0.base=|v_ULTIMATE.start_main_~#t258~0.base_25|, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ULTIMATE.start_main_~#t259~0.offset=|v_ULTIMATE.start_main_~#t259~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_21, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_426, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t258~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t259~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t257~0.offset, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t257~0.base, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t258~0.base, ~a$flush_delayed~0, ULTIMATE.start_main_~#t259~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 01:26:05,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_20 |v_P0Thread1of1ForFork1_#in~arg.offset_20|) (= 1 v_~a$w_buff0_used~0_240) (= (mod v_~a$w_buff1_used~0_130 256) 0) (= v_~a$w_buff0_used~0_241 v_~a$w_buff1_used~0_130) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_24 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|) (= |v_P0Thread1of1ForFork1_#in~arg.base_20| v_P0Thread1of1ForFork1_~arg.base_20) (= 1 v_~a$w_buff0~0_55) (= v_~a$w_buff0~0_56 v_~a$w_buff1~0_50) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_241, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_50, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_55, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_240, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_20} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 01:26:05,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L837-1-->L839: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t258~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t258~0.base_12|) |v_ULTIMATE.start_main_~#t258~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t258~0.base_12|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t258~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t258~0.base_12|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t258~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t258~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t258~0.base_12| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t258~0.base=|v_ULTIMATE.start_main_~#t258~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t258~0.offset=|v_ULTIMATE.start_main_~#t258~0.offset_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t258~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t258~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 01:26:05,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L839-1-->L841: Formula: (and (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t259~0.base_12|) 0) (= |v_ULTIMATE.start_main_~#t259~0.offset_10| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t259~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t259~0.base_12|) |v_ULTIMATE.start_main_~#t259~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t259~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t259~0.base_12| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t259~0.base_12|)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t259~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t259~0.base=|v_ULTIMATE.start_main_~#t259~0.base_12|, ULTIMATE.start_main_~#t259~0.offset=|v_ULTIMATE.start_main_~#t259~0.offset_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t259~0.base, ULTIMATE.start_main_~#t259~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 01:26:05,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L778-2-->L778-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In607656518 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In607656518 256)))) (or (and (= ~a~0_In607656518 |P1Thread1of1ForFork2_#t~ite9_Out607656518|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out607656518| ~a$w_buff1~0_In607656518)))) InVars {~a~0=~a~0_In607656518, ~a$w_buff1~0=~a$w_buff1~0_In607656518, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In607656518, ~a$w_buff1_used~0=~a$w_buff1_used~0_In607656518} OutVars{~a~0=~a~0_In607656518, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out607656518|, ~a$w_buff1~0=~a$w_buff1~0_In607656518, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In607656518, ~a$w_buff1_used~0=~a$w_buff1_used~0_In607656518} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 01:26:05,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_16| v_~a~0_33) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_16|} OutVars{~a~0=v_~a~0_33, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_15|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_23|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 01:26:05,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In532435719 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In532435719 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out532435719| 0)) (and (= ~a$w_buff0_used~0_In532435719 |P1Thread1of1ForFork2_#t~ite11_Out532435719|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In532435719, ~a$w_buff0_used~0=~a$w_buff0_used~0_In532435719} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In532435719, ~a$w_buff0_used~0=~a$w_buff0_used~0_In532435719, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out532435719|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 01:26:05,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In859145994 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In859145994 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out859145994|)) (and (= ~a$w_buff0_used~0_In859145994 |P0Thread1of1ForFork1_#t~ite5_Out859145994|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In859145994, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In859145994} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out859145994|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In859145994, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In859145994} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 01:26:05,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L754-->L754-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd1~0_In-1368787472 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-1368787472 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1368787472 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1368787472 256)))) (or (and (= ~a$w_buff1_used~0_In-1368787472 |P0Thread1of1ForFork1_#t~ite6_Out-1368787472|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1368787472|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1368787472, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1368787472, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1368787472, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1368787472} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1368787472|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1368787472, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1368787472, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1368787472, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1368787472} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:26:05,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L755-->L756: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1047326596 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1047326596 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In1047326596 ~a$r_buff0_thd1~0_Out1047326596)) (and (= 0 ~a$r_buff0_thd1~0_Out1047326596) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1047326596, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1047326596} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1047326596|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1047326596, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1047326596} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:26:05,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L756-->L756-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1540672662 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-1540672662 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-1540672662 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd1~0_In-1540672662 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out-1540672662| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite8_Out-1540672662| ~a$r_buff1_thd1~0_In-1540672662)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1540672662, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1540672662, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1540672662, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1540672662} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1540672662|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1540672662, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1540672662, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1540672662, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1540672662} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 01:26:05,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L756-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_50|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_49|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:26:05,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In775470744 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_Out775470744| ~a$w_buff0~0_In775470744) (= |P2Thread1of1ForFork0_#t~ite21_Out775470744| |P2Thread1of1ForFork0_#t~ite20_Out775470744|) (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In775470744 256) 0))) (or (and (= 0 (mod ~a$w_buff1_used~0_In775470744 256)) .cse0) (and .cse0 (= (mod ~a$r_buff1_thd3~0_In775470744 256) 0)) (= (mod ~a$w_buff0_used~0_In775470744 256) 0))) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite20_In775470744| |P2Thread1of1ForFork0_#t~ite20_Out775470744|) (= |P2Thread1of1ForFork0_#t~ite21_Out775470744| ~a$w_buff0~0_In775470744)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In775470744, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In775470744, ~a$w_buff0_used~0=~a$w_buff0_used~0_In775470744, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In775470744, ~a$w_buff1_used~0=~a$w_buff1_used~0_In775470744, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In775470744|, ~weak$$choice2~0=~weak$$choice2~0_In775470744} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out775470744|, ~a$w_buff0~0=~a$w_buff0~0_In775470744, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In775470744, ~a$w_buff0_used~0=~a$w_buff0_used~0_In775470744, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In775470744, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out775470744|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In775470744, ~weak$$choice2~0=~weak$$choice2~0_In775470744} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 01:26:05,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L805-->L805-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In481651089 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_In481651089| |P2Thread1of1ForFork0_#t~ite26_Out481651089|) (= |P2Thread1of1ForFork0_#t~ite27_Out481651089| ~a$w_buff0_used~0_In481651089) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite26_Out481651089| ~a$w_buff0_used~0_In481651089) .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out481651089| |P2Thread1of1ForFork0_#t~ite26_Out481651089|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In481651089 256)))) (or (= (mod ~a$w_buff0_used~0_In481651089 256) 0) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In481651089 256))) (and (= (mod ~a$w_buff1_used~0_In481651089 256) 0) .cse1)))))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In481651089|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In481651089, ~a$w_buff0_used~0=~a$w_buff0_used~0_In481651089, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In481651089, ~a$w_buff1_used~0=~a$w_buff1_used~0_In481651089, ~weak$$choice2~0=~weak$$choice2~0_In481651089} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out481651089|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out481651089|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In481651089, ~a$w_buff0_used~0=~a$w_buff0_used~0_In481651089, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In481651089, ~a$w_buff1_used~0=~a$w_buff1_used~0_In481651089, ~weak$$choice2~0=~weak$$choice2~0_In481651089} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 01:26:05,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_61 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 01:26:05,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_20 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 01:26:05,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L814-2-->L814-5: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-334631047 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd3~0_In-334631047 256) 0)) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out-334631047| |P2Thread1of1ForFork0_#t~ite38_Out-334631047|))) (or (and (not .cse0) (not .cse1) .cse2 (= ~a$w_buff1~0_In-334631047 |P2Thread1of1ForFork0_#t~ite38_Out-334631047|)) (and (or .cse1 .cse0) (= ~a~0_In-334631047 |P2Thread1of1ForFork0_#t~ite38_Out-334631047|) .cse2))) InVars {~a~0=~a~0_In-334631047, ~a$w_buff1~0=~a$w_buff1~0_In-334631047, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-334631047, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-334631047} OutVars{~a~0=~a~0_In-334631047, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-334631047|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-334631047|, ~a$w_buff1~0=~a$w_buff1~0_In-334631047, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-334631047, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-334631047} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:26:05,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1745997577 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1745997577 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-1745997577| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-1745997577| ~a$w_buff0_used~0_In-1745997577)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1745997577, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1745997577} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1745997577|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1745997577, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1745997577} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 01:26:05,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In862755262 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In862755262 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In862755262 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In862755262 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In862755262 |P2Thread1of1ForFork0_#t~ite41_Out862755262|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out862755262| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In862755262, ~a$w_buff0_used~0=~a$w_buff0_used~0_In862755262, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In862755262, ~a$w_buff1_used~0=~a$w_buff1_used~0_In862755262} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In862755262, ~a$w_buff0_used~0=~a$w_buff0_used~0_In862755262, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In862755262, ~a$w_buff1_used~0=~a$w_buff1_used~0_In862755262, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out862755262|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 01:26:05,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-1861241557 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1861241557 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-1861241557 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-1861241557 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1861241557|)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1861241557| ~a$w_buff1_used~0_In-1861241557) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1861241557, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1861241557, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1861241557, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1861241557} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1861241557, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1861241557, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1861241557, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1861241557|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1861241557} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 01:26:05,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In79179452 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In79179452 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out79179452| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out79179452| ~a$r_buff0_thd2~0_In79179452)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In79179452, ~a$w_buff0_used~0=~a$w_buff0_used~0_In79179452} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In79179452, ~a$w_buff0_used~0=~a$w_buff0_used~0_In79179452, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out79179452|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 01:26:05,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In1951197663 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1951197663 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1951197663 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In1951197663 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out1951197663| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite14_Out1951197663| ~a$r_buff1_thd2~0_In1951197663) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1951197663, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1951197663, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1951197663, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1951197663} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1951197663, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1951197663, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1951197663, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1951197663, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1951197663|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:26:05,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L782-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_36| v_~a$r_buff1_thd2~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_36|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_35|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 01:26:05,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L817-->L817-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-775826450 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd3~0_In-775826450 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-775826450|)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd3~0_In-775826450 |P2Thread1of1ForFork0_#t~ite42_Out-775826450|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-775826450, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-775826450} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-775826450, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-775826450, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-775826450|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:26:05,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In910316702 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In910316702 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In910316702 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In910316702 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out910316702| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite43_Out910316702| ~a$r_buff1_thd3~0_In910316702) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In910316702, ~a$w_buff0_used~0=~a$w_buff0_used~0_In910316702, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In910316702, ~a$w_buff1_used~0=~a$w_buff1_used~0_In910316702} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out910316702|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In910316702, ~a$w_buff0_used~0=~a$w_buff0_used~0_In910316702, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In910316702, ~a$w_buff1_used~0=~a$w_buff1_used~0_In910316702} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 01:26:05,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_149 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_149, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 01:26:05,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L841-1-->L847: Formula: (and (= 3 v_~__unbuffered_cnt~0_40) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:26:05,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L847-2-->L847-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-576821911 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In-576821911 256) 0))) (or (and (or .cse0 .cse1) (= ~a~0_In-576821911 |ULTIMATE.start_main_#t~ite47_Out-576821911|)) (and (not .cse1) (= ~a$w_buff1~0_In-576821911 |ULTIMATE.start_main_#t~ite47_Out-576821911|) (not .cse0)))) InVars {~a~0=~a~0_In-576821911, ~a$w_buff1~0=~a$w_buff1~0_In-576821911, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-576821911, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-576821911} OutVars{~a~0=~a~0_In-576821911, ~a$w_buff1~0=~a$w_buff1~0_In-576821911, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-576821911|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-576821911, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-576821911} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 01:26:05,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L847-4-->L848: Formula: (= v_~a~0_39 |v_ULTIMATE.start_main_#t~ite47_15|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|} OutVars{~a~0=v_~a~0_39, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 01:26:05,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In272174321 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In272174321 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out272174321|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In272174321 |ULTIMATE.start_main_#t~ite49_Out272174321|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In272174321, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In272174321} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In272174321, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out272174321|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In272174321} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 01:26:05,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1820935429 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1820935429 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1820935429 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-1820935429 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out-1820935429| ~a$w_buff1_used~0_In-1820935429)) (and (= |ULTIMATE.start_main_#t~ite50_Out-1820935429| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1820935429, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1820935429, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1820935429, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1820935429} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1820935429|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1820935429, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1820935429, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1820935429, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1820935429} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 01:26:05,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L850-->L850-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-202755192 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-202755192 256) 0))) (or (and (= ~a$r_buff0_thd0~0_In-202755192 |ULTIMATE.start_main_#t~ite51_Out-202755192|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-202755192| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-202755192, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-202755192} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-202755192|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-202755192, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-202755192} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 01:26:05,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In1484633834 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1484633834 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In1484633834 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In1484633834 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out1484633834| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out1484633834| ~a$r_buff1_thd0~0_In1484633834) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1484633834, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1484633834, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1484633834, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1484633834} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1484633834|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1484633834, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1484633834, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1484633834, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1484633834} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 01:26:05,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_17) (= v_~__unbuffered_p1_EBX~0_17 0) (= 0 v_~__unbuffered_p0_EAX~0_39) (= v_~main$tmp_guard1~0_12 0) (= 1 v_~__unbuffered_p1_EAX~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start_main_#t~ite52_30| v_~a$r_buff1_thd0~0_75) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_12 256)) (= v_~__unbuffered_p2_EBX~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_29|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:26:05,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:26:05 BasicIcfg [2019-12-27 01:26:05,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:26:05,782 INFO L168 Benchmark]: Toolchain (without parser) took 141466.84 ms. Allocated memory was 142.6 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.5 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 723.8 MB. Max. memory is 7.1 GB. [2019-12-27 01:26:05,783 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 01:26:05,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.13 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 99.1 MB in the beginning and 153.6 MB in the end (delta: -54.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 01:26:05,784 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.94 ms. Allocated memory is still 200.3 MB. Free memory was 152.9 MB in the beginning and 150.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 01:26:05,784 INFO L168 Benchmark]: Boogie Preprocessor took 41.19 ms. Allocated memory is still 200.3 MB. Free memory was 150.7 MB in the beginning and 147.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 01:26:05,786 INFO L168 Benchmark]: RCFGBuilder took 915.89 ms. Allocated memory is still 200.3 MB. Free memory was 147.9 MB in the beginning and 97.3 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:26:05,787 INFO L168 Benchmark]: TraceAbstraction took 139655.75 ms. Allocated memory was 200.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 96.5 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 663.2 MB. Max. memory is 7.1 GB. [2019-12-27 01:26:05,789 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.47 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.13 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 99.1 MB in the beginning and 153.6 MB in the end (delta: -54.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.94 ms. Allocated memory is still 200.3 MB. Free memory was 152.9 MB in the beginning and 150.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.19 ms. Allocated memory is still 200.3 MB. Free memory was 150.7 MB in the beginning and 147.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 915.89 ms. Allocated memory is still 200.3 MB. Free memory was 147.9 MB in the beginning and 97.3 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 139655.75 ms. Allocated memory was 200.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 96.5 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 663.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 179 ProgramPointsBefore, 95 ProgramPointsAfterwards, 216 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6646 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 59 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 91218 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t257, ((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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L742] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L743] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L744] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L745] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L746] 1 a$r_buff0_thd1 = (_Bool)1 [L749] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t258, ((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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 __unbuffered_p1_EBX = 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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L841] FCALL, FORK 0 pthread_create(&t259, ((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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) 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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 139.2s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 53.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11055 SDtfs, 16887 SDslu, 43025 SDs, 0 SdLazy, 22533 SolverSat, 830 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 602 GetRequests, 72 SyntacticMatches, 25 SemanticMatches, 505 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2469 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168271occurred 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: 52.8s AutomataMinimizationTime, 37 MinimizatonAttempts, 772294 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1979 NumberOfCodeBlocks, 1979 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1875 ConstructedInterpolants, 0 QuantifiedInterpolants, 436707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...