/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix049_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:47:48,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:47:48,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:47:48,109 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:47:48,109 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:47:48,110 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:47:48,112 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:47:48,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:47:48,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:47:48,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:47:48,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:47:48,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:47:48,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:47:48,136 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:47:48,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:47:48,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:47:48,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:47:48,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:47:48,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:47:48,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:47:48,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:47:48,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:47:48,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:47:48,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:47:48,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:47:48,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:47:48,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:47:48,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:47:48,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:47:48,166 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:47:48,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:47:48,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:47:48,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:47:48,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:47:48,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:47:48,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:47:48,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:47:48,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:47:48,172 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:47:48,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:47:48,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:47:48,175 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:47:48,209 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:47:48,209 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:47:48,212 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:47:48,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:47:48,214 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:47:48,214 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:47:48,214 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:47:48,214 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:47:48,215 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:47:48,215 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:47:48,215 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:47:48,215 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:47:48,215 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:47:48,215 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:47:48,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:47:48,217 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:47:48,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:47:48,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:47:48,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:47:48,218 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:47:48,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:47:48,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:47:48,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:47:48,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:47:48,219 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:47:48,219 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:47:48,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:47:48,219 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:47:48,219 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:47:48,220 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:47:48,504 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:47:48,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:47:48,521 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:47:48,522 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:47:48,523 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:47:48,523 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix049_power.oepc.i [2019-12-26 22:47:48,586 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c22ef3bf0/aa3ac90aaa2a47b2b8a9e3d3fef92b99/FLAGa90fd8f76 [2019-12-26 22:47:49,182 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:47:49,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix049_power.oepc.i [2019-12-26 22:47:49,206 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c22ef3bf0/aa3ac90aaa2a47b2b8a9e3d3fef92b99/FLAGa90fd8f76 [2019-12-26 22:47:49,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c22ef3bf0/aa3ac90aaa2a47b2b8a9e3d3fef92b99 [2019-12-26 22:47:49,432 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:47:49,433 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:47:49,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:47:49,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:47:49,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:47:49,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:47:49" (1/1) ... [2019-12-26 22:47:49,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:49, skipping insertion in model container [2019-12-26 22:47:49,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:47:49" (1/1) ... [2019-12-26 22:47:49,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:47:49,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:47:50,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:47:50,079 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:47:50,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:47:50,227 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:47:50,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:50 WrapperNode [2019-12-26 22:47:50,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:47:50,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:47:50,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:47:50,229 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:47:50,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:50" (1/1) ... [2019-12-26 22:47:50,260 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:50" (1/1) ... [2019-12-26 22:47:50,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:47:50,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:47:50,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:47:50,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:47:50,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:50" (1/1) ... [2019-12-26 22:47:50,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:50" (1/1) ... [2019-12-26 22:47:50,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:50" (1/1) ... [2019-12-26 22:47:50,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:50" (1/1) ... [2019-12-26 22:47:50,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:50" (1/1) ... [2019-12-26 22:47:50,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:50" (1/1) ... [2019-12-26 22:47:50,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:50" (1/1) ... [2019-12-26 22:47:50,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:47:50,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:47:50,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:47:50,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:47:50,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:50" (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-26 22:47:50,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:47:50,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:47:50,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:47:50,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:47:50,413 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:47:50,414 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:47:50,414 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:47:50,414 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:47:50,414 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:47:50,414 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:47:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:47:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:47:50,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:47:50,417 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:47:51,171 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:47:51,171 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:47:51,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:47:51 BoogieIcfgContainer [2019-12-26 22:47:51,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:47:51,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:47:51,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:47:51,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:47:51,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:47:49" (1/3) ... [2019-12-26 22:47:51,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d12fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:47:51, skipping insertion in model container [2019-12-26 22:47:51,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:50" (2/3) ... [2019-12-26 22:47:51,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d12fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:47:51, skipping insertion in model container [2019-12-26 22:47:51,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:47:51" (3/3) ... [2019-12-26 22:47:51,183 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_power.oepc.i [2019-12-26 22:47:51,194 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:47:51,195 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:47:51,206 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:47:51,207 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:47:51,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,260 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,260 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,260 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,261 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,261 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,269 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,270 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,307 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,308 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,335 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,338 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,345 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,346 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,346 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,351 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:51,368 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:47:51,388 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:47:51,388 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:47:51,389 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:47:51,389 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:47:51,389 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:47:51,389 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:47:51,389 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:47:51,389 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:47:51,405 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-26 22:47:51,407 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-26 22:47:51,513 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-26 22:47:51,513 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:47:51,529 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:47:51,553 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-26 22:47:51,609 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-26 22:47:51,610 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:47:51,618 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:47:51,641 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 22:47:51,642 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:47:56,846 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-26 22:47:56,983 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 22:47:57,356 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-26 22:47:57,356 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-26 22:47:57,360 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-26 22:48:21,960 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-26 22:48:21,962 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-26 22:48:21,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 22:48:21,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:48:21,968 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 22:48:21,968 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-26 22:48:21,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:48:21,973 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-26 22:48:21,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:48:21,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596414007] [2019-12-26 22:48:21,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:48:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:48:22,229 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-26 22:48:22,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596414007] [2019-12-26 22:48:22,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:48:22,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:48:22,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431137482] [2019-12-26 22:48:22,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:48:22,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:48:22,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:48:22,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:48:22,249 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-26 22:48:25,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:48:25,895 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-26 22:48:25,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:48:25,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 22:48:25,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:48:26,664 INFO L225 Difference]: With dead ends: 125570 [2019-12-26 22:48:26,665 INFO L226 Difference]: Without dead ends: 111010 [2019-12-26 22:48:26,667 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-26 22:48:31,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-26 22:48:36,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-26 22:48:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-26 22:48:37,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-26 22:48:37,002 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-26 22:48:37,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:48:37,002 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-26 22:48:37,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:48:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-26 22:48:37,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:48:37,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:48:37,008 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:48:37,008 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-26 22:48:37,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:48:37,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-26 22:48:37,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:48:37,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102428085] [2019-12-26 22:48:37,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:48:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:48:37,106 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-26 22:48:37,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102428085] [2019-12-26 22:48:37,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:48:37,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:48:37,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228933974] [2019-12-26 22:48:37,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:48:37,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:48:37,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:48:37,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:48:37,110 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-26 22:48:42,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:48:42,000 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-26 22:48:42,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:48:42,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:48:42,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:48:42,707 INFO L225 Difference]: With dead ends: 172646 [2019-12-26 22:48:42,707 INFO L226 Difference]: Without dead ends: 172548 [2019-12-26 22:48:42,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:48:49,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-26 22:48:52,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-26 22:48:52,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-26 22:49:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-26 22:49:00,218 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-26 22:49:00,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:00,219 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-26 22:49:00,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:49:00,219 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-26 22:49:00,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:49:00,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:00,225 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:49:00,226 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-26 22:49:00,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:00,226 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-26 22:49:00,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:00,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673922217] [2019-12-26 22:49:00,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:00,320 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-26 22:49:00,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673922217] [2019-12-26 22:49:00,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:00,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:49:00,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569494472] [2019-12-26 22:49:00,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:49:00,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:00,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:49:00,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:49:00,322 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-26 22:49:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:00,455 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-26 22:49:00,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:49:00,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:49:00,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:00,514 INFO L225 Difference]: With dead ends: 34208 [2019-12-26 22:49:00,514 INFO L226 Difference]: Without dead ends: 34208 [2019-12-26 22:49:00,515 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-26 22:49:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-26 22:49:01,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-26 22:49:01,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-26 22:49:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-26 22:49:01,182 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-26 22:49:01,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:01,183 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-26 22:49:01,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:49:01,183 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-26 22:49:01,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:49:01,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:01,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:49:01,186 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-26 22:49:01,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:01,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-26 22:49:01,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:01,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053362746] [2019-12-26 22:49:01,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:01,269 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-26 22:49:01,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053362746] [2019-12-26 22:49:01,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:01,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:49:01,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337435331] [2019-12-26 22:49:01,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:49:01,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:01,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:49:01,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:49:01,271 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-26 22:49:01,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:01,478 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-26 22:49:01,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:49:01,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 22:49:01,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:01,571 INFO L225 Difference]: With dead ends: 51809 [2019-12-26 22:49:01,571 INFO L226 Difference]: Without dead ends: 51809 [2019-12-26 22:49:01,572 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-26 22:49:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-26 22:49:05,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-26 22:49:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-26 22:49:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-26 22:49:05,419 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-26 22:49:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:05,421 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-26 22:49:05,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:49:05,421 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-26 22:49:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:49:05,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:05,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:49:05,425 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-26 22:49:05,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:05,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-26 22:49:05,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:05,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048368290] [2019-12-26 22:49:05,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:49:05,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048368290] [2019-12-26 22:49:05,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:05,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:49:05,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108042623] [2019-12-26 22:49:05,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:49:05,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:05,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:49:05,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:49:05,513 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-26 22:49:06,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:06,088 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-26 22:49:06,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:49:06,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 22:49:06,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:06,181 INFO L225 Difference]: With dead ends: 53507 [2019-12-26 22:49:06,181 INFO L226 Difference]: Without dead ends: 53507 [2019-12-26 22:49:06,181 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-26 22:49:06,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-26 22:49:07,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-26 22:49:07,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-26 22:49:07,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-26 22:49:07,405 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-26 22:49:07,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:07,405 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-26 22:49:07,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:49:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-26 22:49:07,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:49:07,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:07,419 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-26 22:49:07,420 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-26 22:49:07,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:07,420 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-26 22:49:07,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:07,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643031635] [2019-12-26 22:49:07,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:07,521 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-26 22:49:07,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643031635] [2019-12-26 22:49:07,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:07,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:49:07,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106199704] [2019-12-26 22:49:07,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:49:07,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:07,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:49:07,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:49:07,524 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 6 states. [2019-12-26 22:49:08,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:08,572 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-26 22:49:08,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:49:08,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 22:49:08,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:08,687 INFO L225 Difference]: With dead ends: 66834 [2019-12-26 22:49:08,687 INFO L226 Difference]: Without dead ends: 66820 [2019-12-26 22:49:08,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:49:08,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-26 22:49:10,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-26 22:49:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-26 22:49:10,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-26 22:49:10,188 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-26 22:49:10,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:10,188 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-26 22:49:10,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:49:10,189 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-26 22:49:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:49:10,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:10,209 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-26 22:49:10,209 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-26 22:49:10,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:10,210 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-26 22:49:10,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:10,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49777486] [2019-12-26 22:49:10,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:10,280 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-26 22:49:10,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49777486] [2019-12-26 22:49:10,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:10,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:49:10,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077301945] [2019-12-26 22:49:10,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:49:10,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:10,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:49:10,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:49:10,283 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 4 states. [2019-12-26 22:49:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:10,380 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-26 22:49:10,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:49:10,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 22:49:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:10,415 INFO L225 Difference]: With dead ends: 18127 [2019-12-26 22:49:10,416 INFO L226 Difference]: Without dead ends: 18127 [2019-12-26 22:49:10,417 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-26 22:49:10,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-26 22:49:10,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-26 22:49:10,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-26 22:49:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-26 22:49:10,723 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-26 22:49:10,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:10,723 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-26 22:49:10,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:49:10,723 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-26 22:49:10,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:49:10,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:10,740 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-26 22:49:10,740 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-26 22:49:10,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:10,741 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-26 22:49:10,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:10,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517662222] [2019-12-26 22:49:10,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:10,845 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-26 22:49:10,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517662222] [2019-12-26 22:49:10,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:10,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:49:10,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165569137] [2019-12-26 22:49:10,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:49:10,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:10,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:49:10,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:49:10,847 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-26 22:49:11,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:11,435 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-26 22:49:11,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:49:11,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 22:49:11,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:11,483 INFO L225 Difference]: With dead ends: 25206 [2019-12-26 22:49:11,483 INFO L226 Difference]: Without dead ends: 25206 [2019-12-26 22:49:11,484 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-26 22:49:11,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-26 22:49:11,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-26 22:49:11,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-26 22:49:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-26 22:49:11,874 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-26 22:49:11,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:11,874 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-26 22:49:11,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:49:11,874 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-26 22:49:11,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 22:49:11,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:11,897 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-26 22:49:11,897 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-26 22:49:12,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:12,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-26 22:49:12,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:12,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887784055] [2019-12-26 22:49:12,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:12,282 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-26 22:49:12,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887784055] [2019-12-26 22:49:12,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:12,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:49:12,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104432001] [2019-12-26 22:49:12,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:49:12,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:12,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:49:12,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:49:12,284 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 7 states. [2019-12-26 22:49:13,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:13,516 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-26 22:49:13,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:49:13,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 22:49:13,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:13,558 INFO L225 Difference]: With dead ends: 28185 [2019-12-26 22:49:13,558 INFO L226 Difference]: Without dead ends: 28185 [2019-12-26 22:49:13,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:49:13,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-26 22:49:13,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-26 22:49:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-26 22:49:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-26 22:49:13,948 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-26 22:49:13,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:13,949 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-26 22:49:13,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:49:13,949 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-26 22:49:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:49:13,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:13,975 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-26 22:49:13,975 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-26 22:49:13,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:13,976 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-26 22:49:13,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:13,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824236077] [2019-12-26 22:49:13,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:14,053 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-26 22:49:14,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824236077] [2019-12-26 22:49:14,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:14,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:49:14,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344585537] [2019-12-26 22:49:14,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:49:14,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:14,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:49:14,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:49:14,055 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 5 states. [2019-12-26 22:49:14,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:14,165 INFO L93 Difference]: Finished difference Result 18279 states and 57074 transitions. [2019-12-26 22:49:14,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:49:14,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-26 22:49:14,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:14,206 INFO L225 Difference]: With dead ends: 18279 [2019-12-26 22:49:14,206 INFO L226 Difference]: Without dead ends: 18279 [2019-12-26 22:49:14,207 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-26 22:49:14,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18279 states. [2019-12-26 22:49:14,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18279 to 17698. [2019-12-26 22:49:14,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17698 states. [2019-12-26 22:49:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17698 states to 17698 states and 55505 transitions. [2019-12-26 22:49:14,682 INFO L78 Accepts]: Start accepts. Automaton has 17698 states and 55505 transitions. Word has length 39 [2019-12-26 22:49:14,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:14,682 INFO L462 AbstractCegarLoop]: Abstraction has 17698 states and 55505 transitions. [2019-12-26 22:49:14,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:49:14,682 INFO L276 IsEmpty]: Start isEmpty. Operand 17698 states and 55505 transitions. [2019-12-26 22:49:14,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:49:14,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:14,716 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-26 22:49:14,717 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-26 22:49:14,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:14,717 INFO L82 PathProgramCache]: Analyzing trace with hash -2116688157, now seen corresponding path program 1 times [2019-12-26 22:49:14,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:14,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471569616] [2019-12-26 22:49:14,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:14,832 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-26 22:49:14,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471569616] [2019-12-26 22:49:14,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:14,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:49:14,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001395624] [2019-12-26 22:49:14,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:49:14,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:14,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:49:14,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:49:14,836 INFO L87 Difference]: Start difference. First operand 17698 states and 55505 transitions. Second operand 7 states. [2019-12-26 22:49:15,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:15,681 INFO L93 Difference]: Finished difference Result 48537 states and 151835 transitions. [2019-12-26 22:49:15,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:49:15,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:49:15,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:15,737 INFO L225 Difference]: With dead ends: 48537 [2019-12-26 22:49:15,737 INFO L226 Difference]: Without dead ends: 38006 [2019-12-26 22:49:15,739 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-26 22:49:15,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38006 states. [2019-12-26 22:49:16,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38006 to 21047. [2019-12-26 22:49:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21047 states. [2019-12-26 22:49:16,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21047 states to 21047 states and 66538 transitions. [2019-12-26 22:49:16,225 INFO L78 Accepts]: Start accepts. Automaton has 21047 states and 66538 transitions. Word has length 64 [2019-12-26 22:49:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:16,226 INFO L462 AbstractCegarLoop]: Abstraction has 21047 states and 66538 transitions. [2019-12-26 22:49:16,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:49:16,226 INFO L276 IsEmpty]: Start isEmpty. Operand 21047 states and 66538 transitions. [2019-12-26 22:49:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:49:16,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:16,251 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-26 22:49:16,251 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-26 22:49:16,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:16,252 INFO L82 PathProgramCache]: Analyzing trace with hash -978914267, now seen corresponding path program 2 times [2019-12-26 22:49:16,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:16,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663745956] [2019-12-26 22:49:16,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:16,359 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-26 22:49:16,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663745956] [2019-12-26 22:49:16,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:16,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:49:16,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733531597] [2019-12-26 22:49:16,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:49:16,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:16,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:49:16,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:49:16,362 INFO L87 Difference]: Start difference. First operand 21047 states and 66538 transitions. Second operand 7 states. [2019-12-26 22:49:17,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:17,013 INFO L93 Difference]: Finished difference Result 57554 states and 178145 transitions. [2019-12-26 22:49:17,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:49:17,014 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:49:17,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:17,077 INFO L225 Difference]: With dead ends: 57554 [2019-12-26 22:49:17,077 INFO L226 Difference]: Without dead ends: 41745 [2019-12-26 22:49:17,078 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-26 22:49:17,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41745 states. [2019-12-26 22:49:17,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41745 to 24743. [2019-12-26 22:49:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24743 states. [2019-12-26 22:49:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24743 states to 24743 states and 78318 transitions. [2019-12-26 22:49:17,653 INFO L78 Accepts]: Start accepts. Automaton has 24743 states and 78318 transitions. Word has length 64 [2019-12-26 22:49:17,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:17,654 INFO L462 AbstractCegarLoop]: Abstraction has 24743 states and 78318 transitions. [2019-12-26 22:49:17,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:49:17,654 INFO L276 IsEmpty]: Start isEmpty. Operand 24743 states and 78318 transitions. [2019-12-26 22:49:17,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:49:17,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:17,687 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-26 22:49:17,687 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-26 22:49:17,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:17,687 INFO L82 PathProgramCache]: Analyzing trace with hash -423923923, now seen corresponding path program 3 times [2019-12-26 22:49:17,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:17,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455821383] [2019-12-26 22:49:17,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:17,780 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-26 22:49:17,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455821383] [2019-12-26 22:49:17,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:17,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:49:17,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572994207] [2019-12-26 22:49:17,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:49:17,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:17,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:49:17,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:49:17,783 INFO L87 Difference]: Start difference. First operand 24743 states and 78318 transitions. Second operand 7 states. [2019-12-26 22:49:18,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:18,544 INFO L93 Difference]: Finished difference Result 51247 states and 161421 transitions. [2019-12-26 22:49:18,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 22:49:18,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:49:18,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:18,612 INFO L225 Difference]: With dead ends: 51247 [2019-12-26 22:49:18,613 INFO L226 Difference]: Without dead ends: 47407 [2019-12-26 22:49:18,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:49:18,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47407 states. [2019-12-26 22:49:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47407 to 24923. [2019-12-26 22:49:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24923 states. [2019-12-26 22:49:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24923 states to 24923 states and 79050 transitions. [2019-12-26 22:49:19,208 INFO L78 Accepts]: Start accepts. Automaton has 24923 states and 79050 transitions. Word has length 64 [2019-12-26 22:49:19,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:19,208 INFO L462 AbstractCegarLoop]: Abstraction has 24923 states and 79050 transitions. [2019-12-26 22:49:19,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:49:19,209 INFO L276 IsEmpty]: Start isEmpty. Operand 24923 states and 79050 transitions. [2019-12-26 22:49:19,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:49:19,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:19,249 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-26 22:49:19,250 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-26 22:49:19,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:19,250 INFO L82 PathProgramCache]: Analyzing trace with hash -314768521, now seen corresponding path program 4 times [2019-12-26 22:49:19,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:19,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930117386] [2019-12-26 22:49:19,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:19,338 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-26 22:49:19,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930117386] [2019-12-26 22:49:19,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:19,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:49:19,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021309077] [2019-12-26 22:49:19,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:49:19,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:19,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:49:19,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:49:19,340 INFO L87 Difference]: Start difference. First operand 24923 states and 79050 transitions. Second operand 3 states. [2019-12-26 22:49:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:19,439 INFO L93 Difference]: Finished difference Result 20919 states and 64986 transitions. [2019-12-26 22:49:19,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:49:19,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 22:49:19,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:19,476 INFO L225 Difference]: With dead ends: 20919 [2019-12-26 22:49:19,477 INFO L226 Difference]: Without dead ends: 20919 [2019-12-26 22:49:19,478 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-26 22:49:19,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20919 states. [2019-12-26 22:49:19,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20919 to 19827. [2019-12-26 22:49:19,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19827 states. [2019-12-26 22:49:19,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19827 states to 19827 states and 61272 transitions. [2019-12-26 22:49:19,846 INFO L78 Accepts]: Start accepts. Automaton has 19827 states and 61272 transitions. Word has length 64 [2019-12-26 22:49:19,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:19,846 INFO L462 AbstractCegarLoop]: Abstraction has 19827 states and 61272 transitions. [2019-12-26 22:49:19,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:49:19,846 INFO L276 IsEmpty]: Start isEmpty. Operand 19827 states and 61272 transitions. [2019-12-26 22:49:19,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:49:19,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:19,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, 1] [2019-12-26 22:49:19,868 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-26 22:49:19,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:19,868 INFO L82 PathProgramCache]: Analyzing trace with hash 231413698, now seen corresponding path program 1 times [2019-12-26 22:49:19,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:19,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034913095] [2019-12-26 22:49:19,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:19,930 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-26 22:49:19,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034913095] [2019-12-26 22:49:19,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:19,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:49:19,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619139873] [2019-12-26 22:49:19,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:49:19,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:19,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:49:19,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:49:19,932 INFO L87 Difference]: Start difference. First operand 19827 states and 61272 transitions. Second operand 3 states. [2019-12-26 22:49:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:20,087 INFO L93 Difference]: Finished difference Result 24197 states and 74265 transitions. [2019-12-26 22:49:20,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:49:20,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 22:49:20,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:20,148 INFO L225 Difference]: With dead ends: 24197 [2019-12-26 22:49:20,148 INFO L226 Difference]: Without dead ends: 24197 [2019-12-26 22:49:20,149 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-26 22:49:20,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24197 states. [2019-12-26 22:49:20,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24197 to 21036. [2019-12-26 22:49:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21036 states. [2019-12-26 22:49:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21036 states to 21036 states and 65069 transitions. [2019-12-26 22:49:20,949 INFO L78 Accepts]: Start accepts. Automaton has 21036 states and 65069 transitions. Word has length 65 [2019-12-26 22:49:20,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:20,949 INFO L462 AbstractCegarLoop]: Abstraction has 21036 states and 65069 transitions. [2019-12-26 22:49:20,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:49:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 21036 states and 65069 transitions. [2019-12-26 22:49:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:49:20,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:20,973 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-26 22:49:20,973 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-26 22:49:20,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:20,974 INFO L82 PathProgramCache]: Analyzing trace with hash 198410648, now seen corresponding path program 1 times [2019-12-26 22:49:20,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:20,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622462841] [2019-12-26 22:49:20,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:21,050 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-26 22:49:21,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622462841] [2019-12-26 22:49:21,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:21,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:49:21,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773767697] [2019-12-26 22:49:21,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:49:21,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:21,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:49:21,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:49:21,052 INFO L87 Difference]: Start difference. First operand 21036 states and 65069 transitions. Second operand 4 states. [2019-12-26 22:49:21,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:21,196 INFO L93 Difference]: Finished difference Result 24621 states and 75632 transitions. [2019-12-26 22:49:21,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:49:21,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-26 22:49:21,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:21,228 INFO L225 Difference]: With dead ends: 24621 [2019-12-26 22:49:21,228 INFO L226 Difference]: Without dead ends: 24621 [2019-12-26 22:49:21,229 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-26 22:49:21,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24621 states. [2019-12-26 22:49:21,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24621 to 21144. [2019-12-26 22:49:21,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21144 states. [2019-12-26 22:49:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21144 states to 21144 states and 65300 transitions. [2019-12-26 22:49:21,583 INFO L78 Accepts]: Start accepts. Automaton has 21144 states and 65300 transitions. Word has length 66 [2019-12-26 22:49:21,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:21,583 INFO L462 AbstractCegarLoop]: Abstraction has 21144 states and 65300 transitions. [2019-12-26 22:49:21,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:49:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 21144 states and 65300 transitions. [2019-12-26 22:49:21,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:49:21,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:21,606 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-26 22:49:21,606 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-26 22:49:21,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:21,606 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-26 22:49:21,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:21,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724439490] [2019-12-26 22:49:21,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:21,778 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-26 22:49:21,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724439490] [2019-12-26 22:49:21,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:21,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:49:21,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154384501] [2019-12-26 22:49:21,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:49:21,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:21,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:49:21,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:49:21,780 INFO L87 Difference]: Start difference. First operand 21144 states and 65300 transitions. Second operand 10 states. [2019-12-26 22:49:23,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:23,871 INFO L93 Difference]: Finished difference Result 38488 states and 118451 transitions. [2019-12-26 22:49:23,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 22:49:23,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 22:49:23,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:23,913 INFO L225 Difference]: With dead ends: 38488 [2019-12-26 22:49:23,914 INFO L226 Difference]: Without dead ends: 30672 [2019-12-26 22:49:23,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-12-26 22:49:24,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30672 states. [2019-12-26 22:49:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30672 to 21745. [2019-12-26 22:49:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21745 states. [2019-12-26 22:49:24,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21745 states to 21745 states and 67061 transitions. [2019-12-26 22:49:24,636 INFO L78 Accepts]: Start accepts. Automaton has 21745 states and 67061 transitions. Word has length 66 [2019-12-26 22:49:24,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:24,636 INFO L462 AbstractCegarLoop]: Abstraction has 21745 states and 67061 transitions. [2019-12-26 22:49:24,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:49:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 21745 states and 67061 transitions. [2019-12-26 22:49:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:49:24,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:24,658 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-26 22:49:24,658 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-26 22:49:24,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:24,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1421968206, now seen corresponding path program 2 times [2019-12-26 22:49:24,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:24,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70725041] [2019-12-26 22:49:24,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:24,861 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-26 22:49:24,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70725041] [2019-12-26 22:49:24,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:24,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:49:24,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504728200] [2019-12-26 22:49:24,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:49:24,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:24,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:49:24,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:49:24,866 INFO L87 Difference]: Start difference. First operand 21745 states and 67061 transitions. Second operand 10 states. [2019-12-26 22:49:26,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:26,680 INFO L93 Difference]: Finished difference Result 37884 states and 115944 transitions. [2019-12-26 22:49:26,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:49:26,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 22:49:26,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:26,725 INFO L225 Difference]: With dead ends: 37884 [2019-12-26 22:49:26,726 INFO L226 Difference]: Without dead ends: 31924 [2019-12-26 22:49:26,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:49:26,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31924 states. [2019-12-26 22:49:27,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31924 to 22197. [2019-12-26 22:49:27,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22197 states. [2019-12-26 22:49:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22197 states to 22197 states and 68309 transitions. [2019-12-26 22:49:27,154 INFO L78 Accepts]: Start accepts. Automaton has 22197 states and 68309 transitions. Word has length 66 [2019-12-26 22:49:27,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:27,154 INFO L462 AbstractCegarLoop]: Abstraction has 22197 states and 68309 transitions. [2019-12-26 22:49:27,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:49:27,154 INFO L276 IsEmpty]: Start isEmpty. Operand 22197 states and 68309 transitions. [2019-12-26 22:49:27,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:49:27,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:27,184 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-26 22:49:27,184 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-26 22:49:27,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:27,185 INFO L82 PathProgramCache]: Analyzing trace with hash 765284024, now seen corresponding path program 3 times [2019-12-26 22:49:27,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:27,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658769167] [2019-12-26 22:49:27,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:27,332 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-26 22:49:27,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658769167] [2019-12-26 22:49:27,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:27,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:49:27,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324849095] [2019-12-26 22:49:27,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:49:27,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:27,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:49:27,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:49:27,335 INFO L87 Difference]: Start difference. First operand 22197 states and 68309 transitions. Second operand 11 states. [2019-12-26 22:49:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:29,521 INFO L93 Difference]: Finished difference Result 34983 states and 107283 transitions. [2019-12-26 22:49:29,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 22:49:29,522 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 22:49:29,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:29,566 INFO L225 Difference]: With dead ends: 34983 [2019-12-26 22:49:29,566 INFO L226 Difference]: Without dead ends: 31500 [2019-12-26 22:49:29,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-26 22:49:29,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31500 states. [2019-12-26 22:49:29,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31500 to 21765. [2019-12-26 22:49:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21765 states. [2019-12-26 22:49:29,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21765 states to 21765 states and 66977 transitions. [2019-12-26 22:49:29,982 INFO L78 Accepts]: Start accepts. Automaton has 21765 states and 66977 transitions. Word has length 66 [2019-12-26 22:49:29,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:29,982 INFO L462 AbstractCegarLoop]: Abstraction has 21765 states and 66977 transitions. [2019-12-26 22:49:29,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:49:29,982 INFO L276 IsEmpty]: Start isEmpty. Operand 21765 states and 66977 transitions. [2019-12-26 22:49:30,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:49:30,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:30,006 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-26 22:49:30,007 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-26 22:49:30,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:30,007 INFO L82 PathProgramCache]: Analyzing trace with hash 53330666, now seen corresponding path program 4 times [2019-12-26 22:49:30,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:30,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762345191] [2019-12-26 22:49:30,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:30,174 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-26 22:49:30,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762345191] [2019-12-26 22:49:30,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:30,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:49:30,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686067262] [2019-12-26 22:49:30,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:49:30,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:30,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:49:30,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:49:30,176 INFO L87 Difference]: Start difference. First operand 21765 states and 66977 transitions. Second operand 11 states. [2019-12-26 22:49:32,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:32,010 INFO L93 Difference]: Finished difference Result 35662 states and 109099 transitions. [2019-12-26 22:49:32,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 22:49:32,010 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 22:49:32,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:32,054 INFO L225 Difference]: With dead ends: 35662 [2019-12-26 22:49:32,054 INFO L226 Difference]: Without dead ends: 31290 [2019-12-26 22:49:32,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-26 22:49:32,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31290 states. [2019-12-26 22:49:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31290 to 21989. [2019-12-26 22:49:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21989 states. [2019-12-26 22:49:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21989 states to 21989 states and 67561 transitions. [2019-12-26 22:49:32,489 INFO L78 Accepts]: Start accepts. Automaton has 21989 states and 67561 transitions. Word has length 66 [2019-12-26 22:49:32,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:32,490 INFO L462 AbstractCegarLoop]: Abstraction has 21989 states and 67561 transitions. [2019-12-26 22:49:32,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:49:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 21989 states and 67561 transitions. [2019-12-26 22:49:32,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:49:32,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:32,515 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-26 22:49:32,515 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-26 22:49:32,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:32,516 INFO L82 PathProgramCache]: Analyzing trace with hash 791396238, now seen corresponding path program 5 times [2019-12-26 22:49:32,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:32,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710010324] [2019-12-26 22:49:32,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:32,695 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-26 22:49:32,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710010324] [2019-12-26 22:49:32,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:32,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:49:32,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727711958] [2019-12-26 22:49:32,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:49:32,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:32,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:49:32,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:49:32,698 INFO L87 Difference]: Start difference. First operand 21989 states and 67561 transitions. Second operand 12 states. [2019-12-26 22:49:35,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:35,255 INFO L93 Difference]: Finished difference Result 33586 states and 102667 transitions. [2019-12-26 22:49:35,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 22:49:35,255 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-26 22:49:35,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:35,300 INFO L225 Difference]: With dead ends: 33586 [2019-12-26 22:49:35,300 INFO L226 Difference]: Without dead ends: 31848 [2019-12-26 22:49:35,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-26 22:49:35,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31848 states. [2019-12-26 22:49:35,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31848 to 21855. [2019-12-26 22:49:35,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21855 states. [2019-12-26 22:49:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21855 states to 21855 states and 67213 transitions. [2019-12-26 22:49:35,746 INFO L78 Accepts]: Start accepts. Automaton has 21855 states and 67213 transitions. Word has length 66 [2019-12-26 22:49:35,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:35,746 INFO L462 AbstractCegarLoop]: Abstraction has 21855 states and 67213 transitions. [2019-12-26 22:49:35,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:49:35,746 INFO L276 IsEmpty]: Start isEmpty. Operand 21855 states and 67213 transitions. [2019-12-26 22:49:35,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:49:35,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:35,780 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-26 22:49:35,780 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-26 22:49:35,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:35,780 INFO L82 PathProgramCache]: Analyzing trace with hash -315236056, now seen corresponding path program 6 times [2019-12-26 22:49:35,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:35,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410575651] [2019-12-26 22:49:35,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:35,943 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-26 22:49:35,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410575651] [2019-12-26 22:49:35,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:35,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:49:35,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021681757] [2019-12-26 22:49:35,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:49:35,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:35,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:49:35,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:49:35,945 INFO L87 Difference]: Start difference. First operand 21855 states and 67213 transitions. Second operand 9 states. [2019-12-26 22:49:39,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:39,071 INFO L93 Difference]: Finished difference Result 38674 states and 115415 transitions. [2019-12-26 22:49:39,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-26 22:49:39,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-26 22:49:39,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:39,123 INFO L225 Difference]: With dead ends: 38674 [2019-12-26 22:49:39,124 INFO L226 Difference]: Without dead ends: 38354 [2019-12-26 22:49:39,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=285, Invalid=1607, Unknown=0, NotChecked=0, Total=1892 [2019-12-26 22:49:39,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38354 states. [2019-12-26 22:49:39,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38354 to 26604. [2019-12-26 22:49:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26604 states. [2019-12-26 22:49:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26604 states to 26604 states and 81297 transitions. [2019-12-26 22:49:39,965 INFO L78 Accepts]: Start accepts. Automaton has 26604 states and 81297 transitions. Word has length 66 [2019-12-26 22:49:39,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:39,965 INFO L462 AbstractCegarLoop]: Abstraction has 26604 states and 81297 transitions. [2019-12-26 22:49:39,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:49:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 26604 states and 81297 transitions. [2019-12-26 22:49:39,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:49:39,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:39,992 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-26 22:49:39,992 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-26 22:49:39,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:39,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1354348786, now seen corresponding path program 7 times [2019-12-26 22:49:39,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:39,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573415197] [2019-12-26 22:49:39,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:40,053 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-26 22:49:40,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573415197] [2019-12-26 22:49:40,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:40,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:49:40,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295827190] [2019-12-26 22:49:40,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:49:40,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:40,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:49:40,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:49:40,059 INFO L87 Difference]: Start difference. First operand 26604 states and 81297 transitions. Second operand 3 states. [2019-12-26 22:49:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:40,162 INFO L93 Difference]: Finished difference Result 26604 states and 81296 transitions. [2019-12-26 22:49:40,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:49:40,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 22:49:40,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:40,199 INFO L225 Difference]: With dead ends: 26604 [2019-12-26 22:49:40,199 INFO L226 Difference]: Without dead ends: 26604 [2019-12-26 22:49:40,199 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-26 22:49:40,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26604 states. [2019-12-26 22:49:40,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26604 to 22233. [2019-12-26 22:49:40,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22233 states. [2019-12-26 22:49:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22233 states to 22233 states and 68724 transitions. [2019-12-26 22:49:40,592 INFO L78 Accepts]: Start accepts. Automaton has 22233 states and 68724 transitions. Word has length 66 [2019-12-26 22:49:40,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:40,592 INFO L462 AbstractCegarLoop]: Abstraction has 22233 states and 68724 transitions. [2019-12-26 22:49:40,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:49:40,592 INFO L276 IsEmpty]: Start isEmpty. Operand 22233 states and 68724 transitions. [2019-12-26 22:49:40,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:49:40,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:40,613 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-26 22:49:40,613 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-26 22:49:40,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:40,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1857250972, now seen corresponding path program 1 times [2019-12-26 22:49:40,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:40,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495934768] [2019-12-26 22:49:40,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:40,787 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-26 22:49:40,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495934768] [2019-12-26 22:49:40,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:40,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:49:40,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290342162] [2019-12-26 22:49:40,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:49:40,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:40,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:49:40,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:49:40,789 INFO L87 Difference]: Start difference. First operand 22233 states and 68724 transitions. Second operand 12 states. [2019-12-26 22:49:43,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:43,576 INFO L93 Difference]: Finished difference Result 39862 states and 121555 transitions. [2019-12-26 22:49:43,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-26 22:49:43,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-26 22:49:43,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:43,626 INFO L225 Difference]: With dead ends: 39862 [2019-12-26 22:49:43,626 INFO L226 Difference]: Without dead ends: 34099 [2019-12-26 22:49:43,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2019-12-26 22:49:43,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34099 states. [2019-12-26 22:49:44,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34099 to 22006. [2019-12-26 22:49:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22006 states. [2019-12-26 22:49:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22006 states to 22006 states and 67786 transitions. [2019-12-26 22:49:44,480 INFO L78 Accepts]: Start accepts. Automaton has 22006 states and 67786 transitions. Word has length 67 [2019-12-26 22:49:44,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:44,480 INFO L462 AbstractCegarLoop]: Abstraction has 22006 states and 67786 transitions. [2019-12-26 22:49:44,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:49:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 22006 states and 67786 transitions. [2019-12-26 22:49:44,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:49:44,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:44,505 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-26 22:49:44,505 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-26 22:49:44,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:44,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1823504856, now seen corresponding path program 2 times [2019-12-26 22:49:44,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:44,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024373790] [2019-12-26 22:49:44,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:44,950 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-26 22:49:44,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024373790] [2019-12-26 22:49:44,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:44,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 22:49:44,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330011402] [2019-12-26 22:49:44,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 22:49:44,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:44,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 22:49:44,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-26 22:49:44,953 INFO L87 Difference]: Start difference. First operand 22006 states and 67786 transitions. Second operand 15 states. [2019-12-26 22:49:48,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:48,838 INFO L93 Difference]: Finished difference Result 36523 states and 110194 transitions. [2019-12-26 22:49:48,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-26 22:49:48,838 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-26 22:49:48,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:48,888 INFO L225 Difference]: With dead ends: 36523 [2019-12-26 22:49:48,888 INFO L226 Difference]: Without dead ends: 35612 [2019-12-26 22:49:48,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2019-12-26 22:49:49,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35612 states. [2019-12-26 22:49:49,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35612 to 21926. [2019-12-26 22:49:49,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21926 states. [2019-12-26 22:49:49,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21926 states to 21926 states and 67566 transitions. [2019-12-26 22:49:49,358 INFO L78 Accepts]: Start accepts. Automaton has 21926 states and 67566 transitions. Word has length 67 [2019-12-26 22:49:49,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:49:49,358 INFO L462 AbstractCegarLoop]: Abstraction has 21926 states and 67566 transitions. [2019-12-26 22:49:49,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-26 22:49:49,358 INFO L276 IsEmpty]: Start isEmpty. Operand 21926 states and 67566 transitions. [2019-12-26 22:49:49,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:49:49,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:49,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:49:49,382 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-26 22:49:49,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:49,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 3 times [2019-12-26 22:49:49,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:49,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693731451] [2019-12-26 22:49:49,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:49:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:49:49,522 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:49:49,523 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:49:49,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1297~0.base_23|) (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= v_~main$tmp_guard1~0_48 0) (= 0 v_~z$r_buff0_thd3~0_416) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1297~0.base_23|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1297~0.base_23| 4) |v_#length_21|) (= 0 |v_ULTIMATE.start_main_~#t1297~0.offset_17|) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1297~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1297~0.base_23|) |v_ULTIMATE.start_main_~#t1297~0.offset_17| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff1~0_350 0) (= v_~z$w_buff0_used~0_900 0) (= 0 v_~__unbuffered_p0_EAX~0_137) (= v_~z$read_delayed~0_7 0) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1297~0.base_23| 1)) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_~#t1299~0.offset=|v_ULTIMATE.start_main_~#t1299~0.offset_14|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ULTIMATE.start_main_~#t1298~0.base=|v_ULTIMATE.start_main_~#t1298~0.base_19|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ULTIMATE.start_main_~#t1299~0.base=|v_ULTIMATE.start_main_~#t1299~0.base_17|, ~x~0=v_~x~0_129, ULTIMATE.start_main_~#t1297~0.base=|v_ULTIMATE.start_main_~#t1297~0.base_23|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ULTIMATE.start_main_~#t1298~0.offset=|v_ULTIMATE.start_main_~#t1298~0.offset_12|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, ULTIMATE.start_main_~#t1297~0.offset=|v_ULTIMATE.start_main_~#t1297~0.offset_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t1299~0.offset, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1298~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1299~0.base, ~x~0, ULTIMATE.start_main_~#t1297~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1298~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t1297~0.offset, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:49:49,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1298~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1298~0.base_11|) |v_ULTIMATE.start_main_~#t1298~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1298~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1298~0.base_11| 0)) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1298~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1298~0.base_11|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1298~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1298~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1298~0.base=|v_ULTIMATE.start_main_~#t1298~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, ULTIMATE.start_main_~#t1298~0.offset=|v_ULTIMATE.start_main_~#t1298~0.offset_9|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1298~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1298~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 22:49:49,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20 0)) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:49:49,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1135864868 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1135864868 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In1135864868 |P1Thread1of1ForFork2_#t~ite9_Out1135864868|) (not .cse1)) (and (= ~z~0_In1135864868 |P1Thread1of1ForFork2_#t~ite9_Out1135864868|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1135864868, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1135864868, ~z$w_buff1~0=~z$w_buff1~0_In1135864868, ~z~0=~z~0_In1135864868} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1135864868|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1135864868, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1135864868, ~z$w_buff1~0=~z$w_buff1~0_In1135864868, ~z~0=~z~0_In1135864868} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 22:49:49,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-26 22:49:49,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1299~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1299~0.base_13|) |v_ULTIMATE.start_main_~#t1299~0.offset_11| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1299~0.base_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1299~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1299~0.base_13|)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1299~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1299~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1299~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1299~0.offset=|v_ULTIMATE.start_main_~#t1299~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1299~0.base=|v_ULTIMATE.start_main_~#t1299~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1299~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1299~0.base] because there is no mapped edge [2019-12-26 22:49:49,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1405764287 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1405764287 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1405764287|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1405764287 |P1Thread1of1ForFork2_#t~ite11_Out-1405764287|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1405764287, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1405764287} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1405764287, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1405764287|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1405764287} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 22:49:49,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1550411210 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1550411210 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1550411210 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-1550411210 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1550411210| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out-1550411210| ~z$w_buff1_used~0_In-1550411210)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1550411210, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1550411210, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1550411210, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1550411210} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1550411210, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1550411210, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1550411210, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1550411210|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1550411210} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 22:49:49,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2100730564 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-2100730564 256)))) (or (and (= ~z$r_buff0_thd2~0_In-2100730564 |P1Thread1of1ForFork2_#t~ite13_Out-2100730564|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-2100730564|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2100730564, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2100730564} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2100730564, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-2100730564|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2100730564} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 22:49:49,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1426515208 256) 0))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1426515208 256) 0))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-1426515208 256))) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-1426515208 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-1426515208 256)))) .cse1 (= |P2Thread1of1ForFork0_#t~ite27_Out-1426515208| |P2Thread1of1ForFork0_#t~ite26_Out-1426515208|) (= ~z$w_buff0_used~0_In-1426515208 |P2Thread1of1ForFork0_#t~ite26_Out-1426515208|)) (and (= |P2Thread1of1ForFork0_#t~ite27_Out-1426515208| ~z$w_buff0_used~0_In-1426515208) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite26_In-1426515208| |P2Thread1of1ForFork0_#t~ite26_Out-1426515208|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1426515208|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1426515208, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1426515208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1426515208, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1426515208, ~weak$$choice2~0=~weak$$choice2~0_In-1426515208} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1426515208|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1426515208|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1426515208, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1426515208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1426515208, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1426515208, ~weak$$choice2~0=~weak$$choice2~0_In-1426515208} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-26 22:49:49,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 22:49:49,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2106169825 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In2106169825 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out2106169825|) (not .cse1)) (and (= ~z$w_buff0_used~0_In2106169825 |P0Thread1of1ForFork1_#t~ite5_Out2106169825|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2106169825, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2106169825} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out2106169825|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2106169825, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2106169825} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 22:49:49,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 22:49:49,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork0_#t~ite39_Out646744300| |P2Thread1of1ForFork0_#t~ite38_Out646744300|)) (.cse2 (= (mod ~z$w_buff1_used~0_In646744300 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In646744300 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out646744300| ~z$w_buff1~0_In646744300) .cse1 (not .cse2)) (and .cse1 (or .cse2 .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out646744300| ~z~0_In646744300)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In646744300, ~z$w_buff1_used~0=~z$w_buff1_used~0_In646744300, ~z$w_buff1~0=~z$w_buff1~0_In646744300, ~z~0=~z~0_In646744300} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out646744300|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out646744300|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In646744300, ~z$w_buff1_used~0=~z$w_buff1_used~0_In646744300, ~z$w_buff1~0=~z$w_buff1~0_In646744300, ~z~0=~z~0_In646744300} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 22:49:49,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1531533742 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1531533742 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1531533742 |P2Thread1of1ForFork0_#t~ite40_Out1531533742|)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out1531533742| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1531533742, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1531533742} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1531533742, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1531533742|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1531533742} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 22:49:49,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-2134891904 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-2134891904 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-2134891904 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2134891904 256)))) (or (and (= ~z$w_buff1_used~0_In-2134891904 |P2Thread1of1ForFork0_#t~ite41_Out-2134891904|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-2134891904|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2134891904, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2134891904, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2134891904, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2134891904} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2134891904, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2134891904, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2134891904, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2134891904, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-2134891904|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 22:49:49,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In421356740 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In421356740 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out421356740| 0)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out421356740| ~z$r_buff0_thd3~0_In421356740) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In421356740, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In421356740} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In421356740, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In421356740, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out421356740|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 22:49:49,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1487841888 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1487841888 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1487841888 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1487841888 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-1487841888| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite43_Out-1487841888| ~z$r_buff1_thd3~0_In-1487841888) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1487841888, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1487841888, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1487841888, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1487841888} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1487841888|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1487841888, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1487841888, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1487841888, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1487841888} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 22:49:49,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_30|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 22:49:49,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1224493589 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1224493589 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1224493589 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In1224493589 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1224493589 |P0Thread1of1ForFork1_#t~ite6_Out1224493589|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1224493589|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1224493589, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1224493589, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1224493589, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1224493589} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1224493589, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1224493589|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1224493589, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1224493589, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1224493589} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 22:49:49,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1486685777 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1486685777 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out1486685777) (not .cse1)) (and (= ~z$r_buff0_thd1~0_Out1486685777 ~z$r_buff0_thd1~0_In1486685777) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1486685777, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1486685777} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1486685777, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1486685777|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1486685777} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:49:49,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1325484193 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In1325484193 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1325484193 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1325484193 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out1325484193| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out1325484193| ~z$r_buff1_thd1~0_In1325484193)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1325484193, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1325484193, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1325484193, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1325484193} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1325484193|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1325484193, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1325484193, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1325484193, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1325484193} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 22:49:49,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_44|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_43|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 22:49:49,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In817252036 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In817252036 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In817252036 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In817252036 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out817252036| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite14_Out817252036| ~z$r_buff1_thd2~0_In817252036) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In817252036, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In817252036, ~z$w_buff1_used~0=~z$w_buff1_used~0_In817252036, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In817252036} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In817252036, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In817252036, ~z$w_buff1_used~0=~z$w_buff1_used~0_In817252036, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out817252036|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In817252036} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 22:49:49,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_34|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_34|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_33|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 22:49:49,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:49:49,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out-361660620| |ULTIMATE.start_main_#t~ite48_Out-361660620|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-361660620 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-361660620 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out-361660620| ~z~0_In-361660620) (or .cse1 .cse2)) (and .cse0 (not .cse2) (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-361660620| ~z$w_buff1~0_In-361660620)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-361660620, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-361660620, ~z$w_buff1~0=~z$w_buff1~0_In-361660620, ~z~0=~z~0_In-361660620} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-361660620, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-361660620|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-361660620, ~z$w_buff1~0=~z$w_buff1~0_In-361660620, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-361660620|, ~z~0=~z~0_In-361660620} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 22:49:49,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1468621749 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1468621749 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-1468621749|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1468621749 |ULTIMATE.start_main_#t~ite49_Out-1468621749|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1468621749, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1468621749} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1468621749, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1468621749, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1468621749|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 22:49:49,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1714044526 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1714044526 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1714044526 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1714044526 256)))) (or (and (= ~z$w_buff1_used~0_In1714044526 |ULTIMATE.start_main_#t~ite50_Out1714044526|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out1714044526| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1714044526, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1714044526, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1714044526, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1714044526} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1714044526|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1714044526, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1714044526, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1714044526, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1714044526} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 22:49:49,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1105854765 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1105854765 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1105854765| ~z$r_buff0_thd0~0_In-1105854765)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1105854765| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1105854765, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1105854765} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1105854765, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1105854765|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1105854765} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 22:49:49,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-836841246 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-836841246 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-836841246 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-836841246 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-836841246| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out-836841246| ~z$r_buff1_thd0~0_In-836841246) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-836841246, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-836841246, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-836841246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-836841246} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-836841246|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-836841246, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-836841246, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-836841246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-836841246} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 22:49:49,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= v_~main$tmp_guard1~0_20 0) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:49:49,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:49:49 BasicIcfg [2019-12-26 22:49:49,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:49:49,712 INFO L168 Benchmark]: Toolchain (without parser) took 120278.80 ms. Allocated memory was 138.4 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 100.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-26 22:49:49,712 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 22:49:49,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.20 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.1 MB in the beginning and 155.8 MB in the end (delta: -55.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:49:49,714 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.17 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:49:49,715 INFO L168 Benchmark]: Boogie Preprocessor took 40.43 ms. Allocated memory is still 202.4 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:49:49,715 INFO L168 Benchmark]: RCFGBuilder took 828.71 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 100.6 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-26 22:49:49,716 INFO L168 Benchmark]: TraceAbstraction took 118535.34 ms. Allocated memory was 202.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.0 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-26 22:49:49,719 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.24 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 792.20 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.1 MB in the beginning and 155.8 MB in the end (delta: -55.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.17 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.43 ms. Allocated memory is still 202.4 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 828.71 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 100.6 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 118535.34 ms. Allocated memory was 202.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.0 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1297, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1298, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1299, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 118.1s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 38.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6700 SDtfs, 7312 SDslu, 25817 SDs, 0 SdLazy, 21384 SolverSat, 330 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 365 GetRequests, 50 SyntacticMatches, 15 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1453 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158936occurred 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: 44.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 225943 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1255 NumberOfCodeBlocks, 1255 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1163 ConstructedInterpolants, 0 QuantifiedInterpolants, 242085 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...