/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix015_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:34:03,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:34:03,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:34:03,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:34:03,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:34:03,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:34:03,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:34:03,225 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:34:03,227 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:34:03,229 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:34:03,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:34:03,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:34:03,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:34:03,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:34:03,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:34:03,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:34:03,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:34:03,240 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:34:03,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:34:03,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:34:03,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:34:03,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:34:03,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:34:03,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:34:03,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:34:03,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:34:03,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:34:03,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:34:03,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:34:03,268 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:34:03,268 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:34:03,269 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:34:03,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:34:03,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:34:03,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:34:03,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:34:03,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:34:03,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:34:03,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:34:03,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:34:03,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:34:03,277 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:34:03,302 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:34:03,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:34:03,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:34:03,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:34:03,304 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:34:03,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:34:03,304 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:34:03,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:34:03,304 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:34:03,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:34:03,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:34:03,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:34:03,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:34:03,305 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:34:03,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:34:03,306 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:34:03,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:34:03,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:34:03,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:34:03,307 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:34:03,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:34:03,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:34:03,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:34:03,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:34:03,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:34:03,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:34:03,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:34:03,308 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:34:03,308 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:34:03,588 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:34:03,609 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:34:03,612 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:34:03,613 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:34:03,614 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:34:03,614 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_tso.oepc.i [2019-12-27 01:34:03,681 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97d241a66/76e39614b9204420923a7c055fcae1b0/FLAG4487a9f20 [2019-12-27 01:34:04,191 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:34:04,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_tso.oepc.i [2019-12-27 01:34:04,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97d241a66/76e39614b9204420923a7c055fcae1b0/FLAG4487a9f20 [2019-12-27 01:34:04,506 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97d241a66/76e39614b9204420923a7c055fcae1b0 [2019-12-27 01:34:04,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:34:04,516 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:34:04,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:34:04,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:34:04,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:34:04,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:34:04" (1/1) ... [2019-12-27 01:34:04,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:04, skipping insertion in model container [2019-12-27 01:34:04,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:34:04" (1/1) ... [2019-12-27 01:34:04,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:34:04,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:34:05,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:34:05,176 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:34:05,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:34:05,322 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:34:05,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:05 WrapperNode [2019-12-27 01:34:05,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:34:05,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:34:05,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:34:05,324 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:34:05,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:05" (1/1) ... [2019-12-27 01:34:05,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:05" (1/1) ... [2019-12-27 01:34:05,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:34:05,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:34:05,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:34:05,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:34:05,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:05" (1/1) ... [2019-12-27 01:34:05,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:05" (1/1) ... [2019-12-27 01:34:05,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:05" (1/1) ... [2019-12-27 01:34:05,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:05" (1/1) ... [2019-12-27 01:34:05,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:05" (1/1) ... [2019-12-27 01:34:05,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:05" (1/1) ... [2019-12-27 01:34:05,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:05" (1/1) ... [2019-12-27 01:34:05,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:34:05,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:34:05,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:34:05,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:34:05,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:34:05,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:34:05,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:34:05,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:34:05,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:34:05,492 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:34:05,492 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:34:05,492 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:34:05,492 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:34:05,493 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:34:05,493 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:34:05,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:34:05,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:34:05,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:34:05,495 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:34:06,313 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:34:06,313 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:34:06,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:34:06 BoogieIcfgContainer [2019-12-27 01:34:06,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:34:06,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:34:06,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:34:06,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:34:06,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:34:04" (1/3) ... [2019-12-27 01:34:06,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a1ee1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:34:06, skipping insertion in model container [2019-12-27 01:34:06,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:05" (2/3) ... [2019-12-27 01:34:06,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a1ee1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:34:06, skipping insertion in model container [2019-12-27 01:34:06,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:34:06" (3/3) ... [2019-12-27 01:34:06,324 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_tso.oepc.i [2019-12-27 01:34:06,336 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:34:06,336 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:34:06,345 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:34:06,346 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:34:06,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,397 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,397 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,397 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,398 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,398 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,434 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,435 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,451 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,452 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,497 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,498 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,512 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,512 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,512 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,514 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,514 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:06,536 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:34:06,557 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:34:06,557 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:34:06,557 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:34:06,557 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:34:06,557 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:34:06,557 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:34:06,557 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:34:06,558 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:34:06,574 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 01:34:06,576 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 01:34:06,707 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 01:34:06,708 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:34:06,730 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:34:06,758 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 01:34:06,823 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 01:34:06,824 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:34:06,835 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:34:06,856 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 01:34:06,857 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:34:12,051 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 01:34:12,194 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 01:34:12,329 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80759 [2019-12-27 01:34:12,330 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 01:34:12,334 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 102 transitions [2019-12-27 01:34:31,436 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118022 states. [2019-12-27 01:34:31,438 INFO L276 IsEmpty]: Start isEmpty. Operand 118022 states. [2019-12-27 01:34:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:34:31,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:31,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:34:31,445 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:34:31,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:31,450 INFO L82 PathProgramCache]: Analyzing trace with hash 922782, now seen corresponding path program 1 times [2019-12-27 01:34:31,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:31,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613626524] [2019-12-27 01:34:31,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:31,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:31,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613626524] [2019-12-27 01:34:31,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:31,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:34:31,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577117907] [2019-12-27 01:34:31,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:34:31,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:31,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:34:31,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:34:31,687 INFO L87 Difference]: Start difference. First operand 118022 states. Second operand 3 states. [2019-12-27 01:34:32,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:32,996 INFO L93 Difference]: Finished difference Result 116858 states and 495582 transitions. [2019-12-27 01:34:32,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:34:32,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:34:32,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:36,572 INFO L225 Difference]: With dead ends: 116858 [2019-12-27 01:34:36,572 INFO L226 Difference]: Without dead ends: 110138 [2019-12-27 01:34:36,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:34:41,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110138 states. [2019-12-27 01:34:44,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110138 to 110138. [2019-12-27 01:34:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110138 states. [2019-12-27 01:34:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110138 states to 110138 states and 466462 transitions. [2019-12-27 01:34:44,730 INFO L78 Accepts]: Start accepts. Automaton has 110138 states and 466462 transitions. Word has length 3 [2019-12-27 01:34:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:44,730 INFO L462 AbstractCegarLoop]: Abstraction has 110138 states and 466462 transitions. [2019-12-27 01:34:44,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:34:44,731 INFO L276 IsEmpty]: Start isEmpty. Operand 110138 states and 466462 transitions. [2019-12-27 01:34:44,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:34:44,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:44,734 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:44,734 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:34:44,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:44,735 INFO L82 PathProgramCache]: Analyzing trace with hash 228105342, now seen corresponding path program 1 times [2019-12-27 01:34:44,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:44,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717532547] [2019-12-27 01:34:44,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:44,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717532547] [2019-12-27 01:34:44,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:44,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:34:44,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801398826] [2019-12-27 01:34:44,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:34:44,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:44,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:34:44,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:34:44,844 INFO L87 Difference]: Start difference. First operand 110138 states and 466462 transitions. Second operand 4 states. [2019-12-27 01:34:49,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:49,984 INFO L93 Difference]: Finished difference Result 170904 states and 695583 transitions. [2019-12-27 01:34:49,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:34:49,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:34:49,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:50,641 INFO L225 Difference]: With dead ends: 170904 [2019-12-27 01:34:50,641 INFO L226 Difference]: Without dead ends: 170855 [2019-12-27 01:34:50,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:34:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170855 states. [2019-12-27 01:35:02,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170855 to 156295. [2019-12-27 01:35:02,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156295 states. [2019-12-27 01:35:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156295 states to 156295 states and 644009 transitions. [2019-12-27 01:35:03,049 INFO L78 Accepts]: Start accepts. Automaton has 156295 states and 644009 transitions. Word has length 11 [2019-12-27 01:35:03,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:03,050 INFO L462 AbstractCegarLoop]: Abstraction has 156295 states and 644009 transitions. [2019-12-27 01:35:03,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:35:03,050 INFO L276 IsEmpty]: Start isEmpty. Operand 156295 states and 644009 transitions. [2019-12-27 01:35:03,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:35:03,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:03,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:03,059 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:03,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:03,059 INFO L82 PathProgramCache]: Analyzing trace with hash 891607686, now seen corresponding path program 1 times [2019-12-27 01:35:03,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:03,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478166613] [2019-12-27 01:35:03,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:03,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478166613] [2019-12-27 01:35:03,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:03,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:35:03,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081569417] [2019-12-27 01:35:03,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:35:03,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:03,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:35:03,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:35:03,142 INFO L87 Difference]: Start difference. First operand 156295 states and 644009 transitions. Second operand 3 states. [2019-12-27 01:35:03,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:03,287 INFO L93 Difference]: Finished difference Result 33673 states and 108735 transitions. [2019-12-27 01:35:03,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:35:03,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:35:03,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:03,367 INFO L225 Difference]: With dead ends: 33673 [2019-12-27 01:35:03,367 INFO L226 Difference]: Without dead ends: 33673 [2019-12-27 01:35:03,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:35:08,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33673 states. [2019-12-27 01:35:08,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33673 to 33673. [2019-12-27 01:35:08,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33673 states. [2019-12-27 01:35:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33673 states to 33673 states and 108735 transitions. [2019-12-27 01:35:08,885 INFO L78 Accepts]: Start accepts. Automaton has 33673 states and 108735 transitions. Word has length 13 [2019-12-27 01:35:08,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:08,885 INFO L462 AbstractCegarLoop]: Abstraction has 33673 states and 108735 transitions. [2019-12-27 01:35:08,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:35:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 33673 states and 108735 transitions. [2019-12-27 01:35:08,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:35:08,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:08,889 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:08,889 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:08,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:08,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1993825600, now seen corresponding path program 1 times [2019-12-27 01:35:08,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:08,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981931093] [2019-12-27 01:35:08,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:08,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981931093] [2019-12-27 01:35:08,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:08,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:35:08,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939297090] [2019-12-27 01:35:08,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:35:08,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:08,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:35:08,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:35:08,987 INFO L87 Difference]: Start difference. First operand 33673 states and 108735 transitions. Second operand 4 states. [2019-12-27 01:35:09,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:09,350 INFO L93 Difference]: Finished difference Result 42056 states and 135369 transitions. [2019-12-27 01:35:09,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:35:09,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:35:09,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:09,420 INFO L225 Difference]: With dead ends: 42056 [2019-12-27 01:35:09,420 INFO L226 Difference]: Without dead ends: 42056 [2019-12-27 01:35:09,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:35:09,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42056 states. [2019-12-27 01:35:10,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42056 to 37770. [2019-12-27 01:35:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37770 states. [2019-12-27 01:35:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37770 states to 37770 states and 121950 transitions. [2019-12-27 01:35:10,520 INFO L78 Accepts]: Start accepts. Automaton has 37770 states and 121950 transitions. Word has length 16 [2019-12-27 01:35:10,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:10,520 INFO L462 AbstractCegarLoop]: Abstraction has 37770 states and 121950 transitions. [2019-12-27 01:35:10,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:35:10,521 INFO L276 IsEmpty]: Start isEmpty. Operand 37770 states and 121950 transitions. [2019-12-27 01:35:10,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:35:10,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:10,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:10,529 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:10,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:10,529 INFO L82 PathProgramCache]: Analyzing trace with hash 674854723, now seen corresponding path program 1 times [2019-12-27 01:35:10,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:10,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928822343] [2019-12-27 01:35:10,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:10,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928822343] [2019-12-27 01:35:10,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:10,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:35:10,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98262816] [2019-12-27 01:35:10,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:35:10,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:10,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:35:10,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:35:10,662 INFO L87 Difference]: Start difference. First operand 37770 states and 121950 transitions. Second operand 5 states. [2019-12-27 01:35:11,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:11,250 INFO L93 Difference]: Finished difference Result 48537 states and 154193 transitions. [2019-12-27 01:35:11,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:35:11,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:35:11,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:11,330 INFO L225 Difference]: With dead ends: 48537 [2019-12-27 01:35:11,330 INFO L226 Difference]: Without dead ends: 48530 [2019-12-27 01:35:11,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:35:11,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48530 states. [2019-12-27 01:35:11,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48530 to 37459. [2019-12-27 01:35:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37459 states. [2019-12-27 01:35:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37459 states to 37459 states and 120776 transitions. [2019-12-27 01:35:12,035 INFO L78 Accepts]: Start accepts. Automaton has 37459 states and 120776 transitions. Word has length 22 [2019-12-27 01:35:12,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:12,035 INFO L462 AbstractCegarLoop]: Abstraction has 37459 states and 120776 transitions. [2019-12-27 01:35:12,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:35:12,035 INFO L276 IsEmpty]: Start isEmpty. Operand 37459 states and 120776 transitions. [2019-12-27 01:35:12,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:35:12,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:12,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:12,048 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:12,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:12,048 INFO L82 PathProgramCache]: Analyzing trace with hash 332765886, now seen corresponding path program 1 times [2019-12-27 01:35:12,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:12,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755695774] [2019-12-27 01:35:12,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:12,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755695774] [2019-12-27 01:35:12,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:12,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:35:12,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901742809] [2019-12-27 01:35:12,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:35:12,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:12,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:35:12,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:35:12,113 INFO L87 Difference]: Start difference. First operand 37459 states and 120776 transitions. Second operand 4 states. [2019-12-27 01:35:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:12,168 INFO L93 Difference]: Finished difference Result 14576 states and 44297 transitions. [2019-12-27 01:35:12,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:35:12,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:35:12,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:12,195 INFO L225 Difference]: With dead ends: 14576 [2019-12-27 01:35:12,195 INFO L226 Difference]: Without dead ends: 14576 [2019-12-27 01:35:12,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:35:12,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14576 states. [2019-12-27 01:35:12,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14576 to 14332. [2019-12-27 01:35:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14332 states. [2019-12-27 01:35:12,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14332 states to 14332 states and 43601 transitions. [2019-12-27 01:35:12,778 INFO L78 Accepts]: Start accepts. Automaton has 14332 states and 43601 transitions. Word has length 25 [2019-12-27 01:35:12,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:12,778 INFO L462 AbstractCegarLoop]: Abstraction has 14332 states and 43601 transitions. [2019-12-27 01:35:12,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:35:12,779 INFO L276 IsEmpty]: Start isEmpty. Operand 14332 states and 43601 transitions. [2019-12-27 01:35:12,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:35:12,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:12,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:12,791 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:12,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:12,792 INFO L82 PathProgramCache]: Analyzing trace with hash 445555351, now seen corresponding path program 1 times [2019-12-27 01:35:12,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:12,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001709252] [2019-12-27 01:35:12,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:12,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001709252] [2019-12-27 01:35:12,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:12,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:35:12,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765631038] [2019-12-27 01:35:12,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:35:12,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:12,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:35:12,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:35:12,838 INFO L87 Difference]: Start difference. First operand 14332 states and 43601 transitions. Second operand 3 states. [2019-12-27 01:35:12,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:12,964 INFO L93 Difference]: Finished difference Result 22367 states and 67484 transitions. [2019-12-27 01:35:12,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:35:12,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 01:35:12,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:13,007 INFO L225 Difference]: With dead ends: 22367 [2019-12-27 01:35:13,007 INFO L226 Difference]: Without dead ends: 22367 [2019-12-27 01:35:13,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:35:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-27 01:35:13,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-27 01:35:13,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-27 01:35:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 51830 transitions. [2019-12-27 01:35:13,305 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 51830 transitions. Word has length 27 [2019-12-27 01:35:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:13,306 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 51830 transitions. [2019-12-27 01:35:13,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:35:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 51830 transitions. [2019-12-27 01:35:13,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:35:13,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:13,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:13,318 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:13,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:13,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1217095067, now seen corresponding path program 1 times [2019-12-27 01:35:13,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:13,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068671792] [2019-12-27 01:35:13,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:13,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:13,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068671792] [2019-12-27 01:35:13,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:13,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:35:13,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793968312] [2019-12-27 01:35:13,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:35:13,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:13,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:35:13,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:35:13,377 INFO L87 Difference]: Start difference. First operand 16938 states and 51830 transitions. Second operand 3 states. [2019-12-27 01:35:13,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:13,463 INFO L93 Difference]: Finished difference Result 22367 states and 66493 transitions. [2019-12-27 01:35:13,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:35:13,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 01:35:13,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:13,491 INFO L225 Difference]: With dead ends: 22367 [2019-12-27 01:35:13,491 INFO L226 Difference]: Without dead ends: 22367 [2019-12-27 01:35:13,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:35:13,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-27 01:35:13,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-27 01:35:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-27 01:35:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 50839 transitions. [2019-12-27 01:35:13,768 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 50839 transitions. Word has length 27 [2019-12-27 01:35:13,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:13,768 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 50839 transitions. [2019-12-27 01:35:13,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:35:13,769 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 50839 transitions. [2019-12-27 01:35:13,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:35:13,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:13,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:13,781 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:13,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:13,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1361870049, now seen corresponding path program 1 times [2019-12-27 01:35:13,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:13,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321619766] [2019-12-27 01:35:13,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:13,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321619766] [2019-12-27 01:35:13,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:13,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:35:13,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957002843] [2019-12-27 01:35:13,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:35:13,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:13,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:35:13,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:35:13,877 INFO L87 Difference]: Start difference. First operand 16938 states and 50839 transitions. Second operand 6 states. [2019-12-27 01:35:14,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:14,472 INFO L93 Difference]: Finished difference Result 31275 states and 92943 transitions. [2019-12-27 01:35:14,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:35:14,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 01:35:14,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:14,521 INFO L225 Difference]: With dead ends: 31275 [2019-12-27 01:35:14,522 INFO L226 Difference]: Without dead ends: 31275 [2019-12-27 01:35:14,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:35:14,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31275 states. [2019-12-27 01:35:14,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31275 to 19607. [2019-12-27 01:35:14,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19607 states. [2019-12-27 01:35:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19607 states to 19607 states and 58673 transitions. [2019-12-27 01:35:14,893 INFO L78 Accepts]: Start accepts. Automaton has 19607 states and 58673 transitions. Word has length 27 [2019-12-27 01:35:14,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:14,894 INFO L462 AbstractCegarLoop]: Abstraction has 19607 states and 58673 transitions. [2019-12-27 01:35:14,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:35:14,894 INFO L276 IsEmpty]: Start isEmpty. Operand 19607 states and 58673 transitions. [2019-12-27 01:35:14,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:35:14,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:14,908 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:14,909 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:14,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:14,909 INFO L82 PathProgramCache]: Analyzing trace with hash -2015671980, now seen corresponding path program 1 times [2019-12-27 01:35:14,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:14,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082099947] [2019-12-27 01:35:14,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:15,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:15,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082099947] [2019-12-27 01:35:15,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:15,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:35:15,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584617341] [2019-12-27 01:35:15,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:35:15,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:15,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:35:15,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:35:15,298 INFO L87 Difference]: Start difference. First operand 19607 states and 58673 transitions. Second operand 6 states. [2019-12-27 01:35:15,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:15,955 INFO L93 Difference]: Finished difference Result 30618 states and 90299 transitions. [2019-12-27 01:35:15,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:35:15,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 01:35:15,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:15,996 INFO L225 Difference]: With dead ends: 30618 [2019-12-27 01:35:15,996 INFO L226 Difference]: Without dead ends: 30618 [2019-12-27 01:35:15,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:35:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30618 states. [2019-12-27 01:35:16,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30618 to 19271. [2019-12-27 01:35:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19271 states. [2019-12-27 01:35:16,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19271 states to 19271 states and 57577 transitions. [2019-12-27 01:35:16,356 INFO L78 Accepts]: Start accepts. Automaton has 19271 states and 57577 transitions. Word has length 28 [2019-12-27 01:35:16,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:16,357 INFO L462 AbstractCegarLoop]: Abstraction has 19271 states and 57577 transitions. [2019-12-27 01:35:16,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:35:16,357 INFO L276 IsEmpty]: Start isEmpty. Operand 19271 states and 57577 transitions. [2019-12-27 01:35:16,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:35:16,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:16,377 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:16,377 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:16,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:16,378 INFO L82 PathProgramCache]: Analyzing trace with hash 405285854, now seen corresponding path program 1 times [2019-12-27 01:35:16,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:16,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079092907] [2019-12-27 01:35:16,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:16,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079092907] [2019-12-27 01:35:16,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:16,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:35:16,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137836222] [2019-12-27 01:35:16,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:35:16,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:16,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:35:16,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:35:16,451 INFO L87 Difference]: Start difference. First operand 19271 states and 57577 transitions. Second operand 5 states. [2019-12-27 01:35:16,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:16,805 INFO L93 Difference]: Finished difference Result 23829 states and 70169 transitions. [2019-12-27 01:35:16,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:35:16,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 01:35:16,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:16,837 INFO L225 Difference]: With dead ends: 23829 [2019-12-27 01:35:16,837 INFO L226 Difference]: Without dead ends: 23829 [2019-12-27 01:35:16,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:35:16,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23829 states. [2019-12-27 01:35:17,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23829 to 20047. [2019-12-27 01:35:17,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20047 states. [2019-12-27 01:35:17,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20047 states to 20047 states and 59899 transitions. [2019-12-27 01:35:17,165 INFO L78 Accepts]: Start accepts. Automaton has 20047 states and 59899 transitions. Word has length 33 [2019-12-27 01:35:17,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:17,165 INFO L462 AbstractCegarLoop]: Abstraction has 20047 states and 59899 transitions. [2019-12-27 01:35:17,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:35:17,166 INFO L276 IsEmpty]: Start isEmpty. Operand 20047 states and 59899 transitions. [2019-12-27 01:35:17,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:35:17,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:17,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:17,187 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:17,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:17,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1258895234, now seen corresponding path program 2 times [2019-12-27 01:35:17,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:17,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940695836] [2019-12-27 01:35:17,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:17,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940695836] [2019-12-27 01:35:17,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:17,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:35:17,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279039352] [2019-12-27 01:35:17,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:35:17,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:17,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:35:17,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:35:17,292 INFO L87 Difference]: Start difference. First operand 20047 states and 59899 transitions. Second operand 7 states. [2019-12-27 01:35:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:18,591 INFO L93 Difference]: Finished difference Result 39715 states and 116920 transitions. [2019-12-27 01:35:18,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:35:18,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 01:35:18,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:18,645 INFO L225 Difference]: With dead ends: 39715 [2019-12-27 01:35:18,645 INFO L226 Difference]: Without dead ends: 39715 [2019-12-27 01:35:18,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:35:19,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39715 states. [2019-12-27 01:35:19,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39715 to 21295. [2019-12-27 01:35:19,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21295 states. [2019-12-27 01:35:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21295 states to 21295 states and 63643 transitions. [2019-12-27 01:35:19,336 INFO L78 Accepts]: Start accepts. Automaton has 21295 states and 63643 transitions. Word has length 33 [2019-12-27 01:35:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:19,336 INFO L462 AbstractCegarLoop]: Abstraction has 21295 states and 63643 transitions. [2019-12-27 01:35:19,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:35:19,337 INFO L276 IsEmpty]: Start isEmpty. Operand 21295 states and 63643 transitions. [2019-12-27 01:35:19,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:35:19,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:19,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:19,353 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:19,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:19,353 INFO L82 PathProgramCache]: Analyzing trace with hash -454706214, now seen corresponding path program 3 times [2019-12-27 01:35:19,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:19,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881530273] [2019-12-27 01:35:19,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:19,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:19,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881530273] [2019-12-27 01:35:19,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:19,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:35:19,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918249036] [2019-12-27 01:35:19,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:35:19,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:19,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:35:19,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:35:19,472 INFO L87 Difference]: Start difference. First operand 21295 states and 63643 transitions. Second operand 8 states. [2019-12-27 01:35:21,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:21,224 INFO L93 Difference]: Finished difference Result 46968 states and 136953 transitions. [2019-12-27 01:35:21,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 01:35:21,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 01:35:21,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:21,291 INFO L225 Difference]: With dead ends: 46968 [2019-12-27 01:35:21,292 INFO L226 Difference]: Without dead ends: 46968 [2019-12-27 01:35:21,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:35:21,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46968 states. [2019-12-27 01:35:21,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46968 to 20735. [2019-12-27 01:35:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20735 states. [2019-12-27 01:35:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20735 states to 20735 states and 61975 transitions. [2019-12-27 01:35:21,758 INFO L78 Accepts]: Start accepts. Automaton has 20735 states and 61975 transitions. Word has length 33 [2019-12-27 01:35:21,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:21,759 INFO L462 AbstractCegarLoop]: Abstraction has 20735 states and 61975 transitions. [2019-12-27 01:35:21,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:35:21,759 INFO L276 IsEmpty]: Start isEmpty. Operand 20735 states and 61975 transitions. [2019-12-27 01:35:21,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:35:21,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:21,775 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:21,775 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:21,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:21,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1655017129, now seen corresponding path program 1 times [2019-12-27 01:35:21,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:21,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401644851] [2019-12-27 01:35:21,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:21,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401644851] [2019-12-27 01:35:21,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:21,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:35:21,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342186634] [2019-12-27 01:35:21,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:35:21,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:21,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:35:21,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:35:21,895 INFO L87 Difference]: Start difference. First operand 20735 states and 61975 transitions. Second operand 7 states. [2019-12-27 01:35:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:23,409 INFO L93 Difference]: Finished difference Result 36504 states and 106979 transitions. [2019-12-27 01:35:23,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:35:23,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 01:35:23,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:23,458 INFO L225 Difference]: With dead ends: 36504 [2019-12-27 01:35:23,458 INFO L226 Difference]: Without dead ends: 36504 [2019-12-27 01:35:23,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:35:23,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36504 states. [2019-12-27 01:35:23,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36504 to 19450. [2019-12-27 01:35:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19450 states. [2019-12-27 01:35:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19450 states to 19450 states and 58223 transitions. [2019-12-27 01:35:23,842 INFO L78 Accepts]: Start accepts. Automaton has 19450 states and 58223 transitions. Word has length 34 [2019-12-27 01:35:23,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:23,843 INFO L462 AbstractCegarLoop]: Abstraction has 19450 states and 58223 transitions. [2019-12-27 01:35:23,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:35:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 19450 states and 58223 transitions. [2019-12-27 01:35:23,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:35:23,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:23,860 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:23,861 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:23,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:23,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2107636055, now seen corresponding path program 2 times [2019-12-27 01:35:23,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:23,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765552592] [2019-12-27 01:35:23,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:23,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:23,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765552592] [2019-12-27 01:35:23,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:23,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:35:23,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354601657] [2019-12-27 01:35:23,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:35:23,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:23,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:35:23,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:35:23,982 INFO L87 Difference]: Start difference. First operand 19450 states and 58223 transitions. Second operand 8 states. [2019-12-27 01:35:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:25,605 INFO L93 Difference]: Finished difference Result 41529 states and 120361 transitions. [2019-12-27 01:35:25,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 01:35:25,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 01:35:25,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:25,693 INFO L225 Difference]: With dead ends: 41529 [2019-12-27 01:35:25,693 INFO L226 Difference]: Without dead ends: 41529 [2019-12-27 01:35:25,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:35:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41529 states. [2019-12-27 01:35:26,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41529 to 17750. [2019-12-27 01:35:26,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17750 states. [2019-12-27 01:35:26,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17750 states to 17750 states and 53183 transitions. [2019-12-27 01:35:26,159 INFO L78 Accepts]: Start accepts. Automaton has 17750 states and 53183 transitions. Word has length 34 [2019-12-27 01:35:26,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:26,159 INFO L462 AbstractCegarLoop]: Abstraction has 17750 states and 53183 transitions. [2019-12-27 01:35:26,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:35:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 17750 states and 53183 transitions. [2019-12-27 01:35:26,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:35:26,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:26,181 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:26,181 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:26,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:26,181 INFO L82 PathProgramCache]: Analyzing trace with hash -887512480, now seen corresponding path program 1 times [2019-12-27 01:35:26,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:26,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231513942] [2019-12-27 01:35:26,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:26,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231513942] [2019-12-27 01:35:26,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:26,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:35:26,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914334008] [2019-12-27 01:35:26,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:35:26,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:26,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:35:26,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:35:26,246 INFO L87 Difference]: Start difference. First operand 17750 states and 53183 transitions. Second operand 4 states. [2019-12-27 01:35:26,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:26,366 INFO L93 Difference]: Finished difference Result 30219 states and 90879 transitions. [2019-12-27 01:35:26,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:35:26,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 01:35:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:26,390 INFO L225 Difference]: With dead ends: 30219 [2019-12-27 01:35:26,390 INFO L226 Difference]: Without dead ends: 15274 [2019-12-27 01:35:26,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:35:26,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15274 states. [2019-12-27 01:35:26,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15274 to 15208. [2019-12-27 01:35:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15208 states. [2019-12-27 01:35:26,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15208 states to 15208 states and 44774 transitions. [2019-12-27 01:35:26,876 INFO L78 Accepts]: Start accepts. Automaton has 15208 states and 44774 transitions. Word has length 39 [2019-12-27 01:35:26,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:26,876 INFO L462 AbstractCegarLoop]: Abstraction has 15208 states and 44774 transitions. [2019-12-27 01:35:26,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:35:26,876 INFO L276 IsEmpty]: Start isEmpty. Operand 15208 states and 44774 transitions. [2019-12-27 01:35:26,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:35:26,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:26,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:26,892 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:26,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:26,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1585510358, now seen corresponding path program 2 times [2019-12-27 01:35:26,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:26,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237183766] [2019-12-27 01:35:26,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:26,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:26,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237183766] [2019-12-27 01:35:26,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:26,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:35:26,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092166411] [2019-12-27 01:35:26,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:35:26,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:26,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:35:26,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:35:26,954 INFO L87 Difference]: Start difference. First operand 15208 states and 44774 transitions. Second operand 3 states. [2019-12-27 01:35:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:27,014 INFO L93 Difference]: Finished difference Result 15207 states and 44772 transitions. [2019-12-27 01:35:27,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:35:27,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:35:27,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:27,036 INFO L225 Difference]: With dead ends: 15207 [2019-12-27 01:35:27,036 INFO L226 Difference]: Without dead ends: 15207 [2019-12-27 01:35:27,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:35:27,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15207 states. [2019-12-27 01:35:27,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15207 to 15207. [2019-12-27 01:35:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15207 states. [2019-12-27 01:35:27,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15207 states to 15207 states and 44772 transitions. [2019-12-27 01:35:27,259 INFO L78 Accepts]: Start accepts. Automaton has 15207 states and 44772 transitions. Word has length 39 [2019-12-27 01:35:27,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:27,259 INFO L462 AbstractCegarLoop]: Abstraction has 15207 states and 44772 transitions. [2019-12-27 01:35:27,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:35:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 15207 states and 44772 transitions. [2019-12-27 01:35:27,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:35:27,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:27,273 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:27,273 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:27,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:27,274 INFO L82 PathProgramCache]: Analyzing trace with hash -408863373, now seen corresponding path program 1 times [2019-12-27 01:35:27,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:27,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740643570] [2019-12-27 01:35:27,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:27,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:27,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740643570] [2019-12-27 01:35:27,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:27,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:35:27,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962273212] [2019-12-27 01:35:27,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:35:27,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:27,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:35:27,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:35:27,329 INFO L87 Difference]: Start difference. First operand 15207 states and 44772 transitions. Second operand 4 states. [2019-12-27 01:35:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:27,437 INFO L93 Difference]: Finished difference Result 24324 states and 71986 transitions. [2019-12-27 01:35:27,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:35:27,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 01:35:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:27,458 INFO L225 Difference]: With dead ends: 24324 [2019-12-27 01:35:27,458 INFO L226 Difference]: Without dead ends: 11139 [2019-12-27 01:35:27,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:35:27,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11139 states. [2019-12-27 01:35:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11139 to 11082. [2019-12-27 01:35:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11082 states. [2019-12-27 01:35:27,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11082 states to 11082 states and 31786 transitions. [2019-12-27 01:35:27,696 INFO L78 Accepts]: Start accepts. Automaton has 11082 states and 31786 transitions. Word has length 40 [2019-12-27 01:35:27,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:27,697 INFO L462 AbstractCegarLoop]: Abstraction has 11082 states and 31786 transitions. [2019-12-27 01:35:27,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:35:27,697 INFO L276 IsEmpty]: Start isEmpty. Operand 11082 states and 31786 transitions. [2019-12-27 01:35:27,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:35:27,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:27,709 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:27,709 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:27,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:27,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1542545665, now seen corresponding path program 2 times [2019-12-27 01:35:27,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:27,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701446049] [2019-12-27 01:35:27,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:27,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:27,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701446049] [2019-12-27 01:35:27,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:27,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:35:27,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953387650] [2019-12-27 01:35:27,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:35:27,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:27,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:35:27,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:35:27,763 INFO L87 Difference]: Start difference. First operand 11082 states and 31786 transitions. Second operand 5 states. [2019-12-27 01:35:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:27,822 INFO L93 Difference]: Finished difference Result 10120 states and 29645 transitions. [2019-12-27 01:35:27,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:35:27,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:35:27,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:27,837 INFO L225 Difference]: With dead ends: 10120 [2019-12-27 01:35:27,837 INFO L226 Difference]: Without dead ends: 7230 [2019-12-27 01:35:27,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:35:27,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7230 states. [2019-12-27 01:35:27,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7230 to 7230. [2019-12-27 01:35:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7230 states. [2019-12-27 01:35:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7230 states to 7230 states and 23189 transitions. [2019-12-27 01:35:27,979 INFO L78 Accepts]: Start accepts. Automaton has 7230 states and 23189 transitions. Word has length 40 [2019-12-27 01:35:27,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:27,979 INFO L462 AbstractCegarLoop]: Abstraction has 7230 states and 23189 transitions. [2019-12-27 01:35:27,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:35:27,980 INFO L276 IsEmpty]: Start isEmpty. Operand 7230 states and 23189 transitions. [2019-12-27 01:35:27,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:35:27,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:27,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:27,987 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:27,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:27,988 INFO L82 PathProgramCache]: Analyzing trace with hash -101932291, now seen corresponding path program 1 times [2019-12-27 01:35:27,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:27,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826371967] [2019-12-27 01:35:27,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:28,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826371967] [2019-12-27 01:35:28,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:28,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:35:28,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280070913] [2019-12-27 01:35:28,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:35:28,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:28,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:35:28,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:35:28,080 INFO L87 Difference]: Start difference. First operand 7230 states and 23189 transitions. Second operand 7 states. [2019-12-27 01:35:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:28,354 INFO L93 Difference]: Finished difference Result 14425 states and 45327 transitions. [2019-12-27 01:35:28,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:35:28,355 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:35:28,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:28,372 INFO L225 Difference]: With dead ends: 14425 [2019-12-27 01:35:28,372 INFO L226 Difference]: Without dead ends: 10624 [2019-12-27 01:35:28,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:35:28,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10624 states. [2019-12-27 01:35:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10624 to 8673. [2019-12-27 01:35:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8673 states. [2019-12-27 01:35:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8673 states to 8673 states and 27719 transitions. [2019-12-27 01:35:28,522 INFO L78 Accepts]: Start accepts. Automaton has 8673 states and 27719 transitions. Word has length 64 [2019-12-27 01:35:28,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:28,522 INFO L462 AbstractCegarLoop]: Abstraction has 8673 states and 27719 transitions. [2019-12-27 01:35:28,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:35:28,524 INFO L276 IsEmpty]: Start isEmpty. Operand 8673 states and 27719 transitions. [2019-12-27 01:35:28,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:35:28,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:28,533 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:28,533 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:28,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:28,533 INFO L82 PathProgramCache]: Analyzing trace with hash -244237027, now seen corresponding path program 2 times [2019-12-27 01:35:28,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:28,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146501613] [2019-12-27 01:35:28,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:28,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:28,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146501613] [2019-12-27 01:35:28,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:28,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:35:28,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026803958] [2019-12-27 01:35:28,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:35:28,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:28,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:35:28,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:35:28,617 INFO L87 Difference]: Start difference. First operand 8673 states and 27719 transitions. Second operand 7 states. [2019-12-27 01:35:28,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:28,870 INFO L93 Difference]: Finished difference Result 16977 states and 52978 transitions. [2019-12-27 01:35:28,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:35:28,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:35:28,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:28,890 INFO L225 Difference]: With dead ends: 16977 [2019-12-27 01:35:28,890 INFO L226 Difference]: Without dead ends: 12608 [2019-12-27 01:35:28,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:35:28,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12608 states. [2019-12-27 01:35:29,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12608 to 10249. [2019-12-27 01:35:29,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10249 states. [2019-12-27 01:35:29,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 32525 transitions. [2019-12-27 01:35:29,066 INFO L78 Accepts]: Start accepts. Automaton has 10249 states and 32525 transitions. Word has length 64 [2019-12-27 01:35:29,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:29,066 INFO L462 AbstractCegarLoop]: Abstraction has 10249 states and 32525 transitions. [2019-12-27 01:35:29,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:35:29,067 INFO L276 IsEmpty]: Start isEmpty. Operand 10249 states and 32525 transitions. [2019-12-27 01:35:29,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:35:29,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:29,078 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:29,078 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:29,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:29,078 INFO L82 PathProgramCache]: Analyzing trace with hash 407961531, now seen corresponding path program 3 times [2019-12-27 01:35:29,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:29,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341632755] [2019-12-27 01:35:29,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:29,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341632755] [2019-12-27 01:35:29,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:29,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:35:29,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963735282] [2019-12-27 01:35:29,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:35:29,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:29,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:35:29,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:35:29,192 INFO L87 Difference]: Start difference. First operand 10249 states and 32525 transitions. Second operand 9 states. [2019-12-27 01:35:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:30,309 INFO L93 Difference]: Finished difference Result 29742 states and 92736 transitions. [2019-12-27 01:35:30,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:35:30,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:35:30,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:30,347 INFO L225 Difference]: With dead ends: 29742 [2019-12-27 01:35:30,347 INFO L226 Difference]: Without dead ends: 27534 [2019-12-27 01:35:30,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:35:30,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27534 states. [2019-12-27 01:35:30,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27534 to 10384. [2019-12-27 01:35:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10384 states. [2019-12-27 01:35:30,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10384 states to 10384 states and 33017 transitions. [2019-12-27 01:35:30,612 INFO L78 Accepts]: Start accepts. Automaton has 10384 states and 33017 transitions. Word has length 64 [2019-12-27 01:35:30,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:30,612 INFO L462 AbstractCegarLoop]: Abstraction has 10384 states and 33017 transitions. [2019-12-27 01:35:30,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:35:30,613 INFO L276 IsEmpty]: Start isEmpty. Operand 10384 states and 33017 transitions. [2019-12-27 01:35:30,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:35:30,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:30,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:30,626 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:30,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:30,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1263766943, now seen corresponding path program 4 times [2019-12-27 01:35:30,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:30,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895045548] [2019-12-27 01:35:30,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:30,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895045548] [2019-12-27 01:35:30,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:30,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:35:30,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646331154] [2019-12-27 01:35:30,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:35:30,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:30,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:35:30,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:35:30,769 INFO L87 Difference]: Start difference. First operand 10384 states and 33017 transitions. Second operand 9 states. [2019-12-27 01:35:31,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:31,725 INFO L93 Difference]: Finished difference Result 23762 states and 74154 transitions. [2019-12-27 01:35:31,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 01:35:31,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:35:31,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:31,756 INFO L225 Difference]: With dead ends: 23762 [2019-12-27 01:35:31,756 INFO L226 Difference]: Without dead ends: 22008 [2019-12-27 01:35:31,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-27 01:35:31,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22008 states. [2019-12-27 01:35:31,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22008 to 10264. [2019-12-27 01:35:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10264 states. [2019-12-27 01:35:32,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10264 states to 10264 states and 32661 transitions. [2019-12-27 01:35:32,000 INFO L78 Accepts]: Start accepts. Automaton has 10264 states and 32661 transitions. Word has length 64 [2019-12-27 01:35:32,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:32,001 INFO L462 AbstractCegarLoop]: Abstraction has 10264 states and 32661 transitions. [2019-12-27 01:35:32,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:35:32,001 INFO L276 IsEmpty]: Start isEmpty. Operand 10264 states and 32661 transitions. [2019-12-27 01:35:32,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:35:32,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:32,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:32,013 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:32,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:32,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1739892295, now seen corresponding path program 5 times [2019-12-27 01:35:32,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:32,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718151462] [2019-12-27 01:35:32,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:32,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718151462] [2019-12-27 01:35:32,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:32,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:35:32,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161639840] [2019-12-27 01:35:32,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:35:32,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:32,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:35:32,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:35:32,063 INFO L87 Difference]: Start difference. First operand 10264 states and 32661 transitions. Second operand 3 states. [2019-12-27 01:35:32,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:32,142 INFO L93 Difference]: Finished difference Result 11837 states and 37523 transitions. [2019-12-27 01:35:32,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:35:32,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:35:32,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:32,164 INFO L225 Difference]: With dead ends: 11837 [2019-12-27 01:35:32,164 INFO L226 Difference]: Without dead ends: 11837 [2019-12-27 01:35:32,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:35:32,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11837 states. [2019-12-27 01:35:32,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11837 to 10693. [2019-12-27 01:35:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10693 states. [2019-12-27 01:35:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10693 states to 10693 states and 34091 transitions. [2019-12-27 01:35:32,405 INFO L78 Accepts]: Start accepts. Automaton has 10693 states and 34091 transitions. Word has length 64 [2019-12-27 01:35:32,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:32,405 INFO L462 AbstractCegarLoop]: Abstraction has 10693 states and 34091 transitions. [2019-12-27 01:35:32,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:35:32,406 INFO L276 IsEmpty]: Start isEmpty. Operand 10693 states and 34091 transitions. [2019-12-27 01:35:32,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:35:32,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:32,417 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:32,417 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:32,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:32,418 INFO L82 PathProgramCache]: Analyzing trace with hash -671653730, now seen corresponding path program 1 times [2019-12-27 01:35:32,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:32,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573764478] [2019-12-27 01:35:32,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:32,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573764478] [2019-12-27 01:35:32,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:32,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:35:32,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717227259] [2019-12-27 01:35:32,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:35:32,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:32,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:35:32,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:35:32,518 INFO L87 Difference]: Start difference. First operand 10693 states and 34091 transitions. Second operand 9 states. [2019-12-27 01:35:33,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:33,552 INFO L93 Difference]: Finished difference Result 25976 states and 80362 transitions. [2019-12-27 01:35:33,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 01:35:33,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 01:35:33,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:33,583 INFO L225 Difference]: With dead ends: 25976 [2019-12-27 01:35:33,583 INFO L226 Difference]: Without dead ends: 21905 [2019-12-27 01:35:33,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-27 01:35:33,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21905 states. [2019-12-27 01:35:33,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21905 to 10558. [2019-12-27 01:35:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10558 states. [2019-12-27 01:35:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10558 states to 10558 states and 33265 transitions. [2019-12-27 01:35:34,069 INFO L78 Accepts]: Start accepts. Automaton has 10558 states and 33265 transitions. Word has length 65 [2019-12-27 01:35:34,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:34,070 INFO L462 AbstractCegarLoop]: Abstraction has 10558 states and 33265 transitions. [2019-12-27 01:35:34,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:35:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 10558 states and 33265 transitions. [2019-12-27 01:35:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:35:34,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:34,080 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:34,080 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:34,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:34,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1962638562, now seen corresponding path program 2 times [2019-12-27 01:35:34,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:34,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426040024] [2019-12-27 01:35:34,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:34,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426040024] [2019-12-27 01:35:34,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:34,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:35:34,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544421733] [2019-12-27 01:35:34,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:35:34,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:34,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:35:34,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:35:34,189 INFO L87 Difference]: Start difference. First operand 10558 states and 33265 transitions. Second operand 9 states. [2019-12-27 01:35:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:34,980 INFO L93 Difference]: Finished difference Result 21151 states and 64928 transitions. [2019-12-27 01:35:34,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:35:34,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 01:35:34,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:35,006 INFO L225 Difference]: With dead ends: 21151 [2019-12-27 01:35:35,006 INFO L226 Difference]: Without dead ends: 19285 [2019-12-27 01:35:35,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-27 01:35:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19285 states. [2019-12-27 01:35:35,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19285 to 10198. [2019-12-27 01:35:35,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10198 states. [2019-12-27 01:35:35,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10198 states to 10198 states and 32203 transitions. [2019-12-27 01:35:35,213 INFO L78 Accepts]: Start accepts. Automaton has 10198 states and 32203 transitions. Word has length 65 [2019-12-27 01:35:35,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:35,213 INFO L462 AbstractCegarLoop]: Abstraction has 10198 states and 32203 transitions. [2019-12-27 01:35:35,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:35:35,214 INFO L276 IsEmpty]: Start isEmpty. Operand 10198 states and 32203 transitions. [2019-12-27 01:35:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:35:35,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:35,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:35,224 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:35,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:35,225 INFO L82 PathProgramCache]: Analyzing trace with hash -151344766, now seen corresponding path program 3 times [2019-12-27 01:35:35,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:35,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079455769] [2019-12-27 01:35:35,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:35,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-27 01:35:35,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079455769] [2019-12-27 01:35:35,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:35,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:35:35,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571576353] [2019-12-27 01:35:35,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:35:35,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:35,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:35:35,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:35:35,284 INFO L87 Difference]: Start difference. First operand 10198 states and 32203 transitions. Second operand 4 states. [2019-12-27 01:35:35,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:35,368 INFO L93 Difference]: Finished difference Result 10055 states and 31631 transitions. [2019-12-27 01:35:35,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:35:35,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 01:35:35,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:35,386 INFO L225 Difference]: With dead ends: 10055 [2019-12-27 01:35:35,386 INFO L226 Difference]: Without dead ends: 10055 [2019-12-27 01:35:35,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:35:35,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10055 states. [2019-12-27 01:35:35,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10055 to 9626. [2019-12-27 01:35:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9626 states. [2019-12-27 01:35:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9626 states to 9626 states and 30201 transitions. [2019-12-27 01:35:35,543 INFO L78 Accepts]: Start accepts. Automaton has 9626 states and 30201 transitions. Word has length 65 [2019-12-27 01:35:35,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:35,543 INFO L462 AbstractCegarLoop]: Abstraction has 9626 states and 30201 transitions. [2019-12-27 01:35:35,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:35:35,543 INFO L276 IsEmpty]: Start isEmpty. Operand 9626 states and 30201 transitions. [2019-12-27 01:35:35,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:35:35,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:35,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:35,553 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:35,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:35,554 INFO L82 PathProgramCache]: Analyzing trace with hash -547409899, now seen corresponding path program 1 times [2019-12-27 01:35:35,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:35,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702016589] [2019-12-27 01:35:35,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:35,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702016589] [2019-12-27 01:35:35,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:35,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:35:35,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172722794] [2019-12-27 01:35:35,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:35:35,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:35,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:35:35,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:35:35,609 INFO L87 Difference]: Start difference. First operand 9626 states and 30201 transitions. Second operand 3 states. [2019-12-27 01:35:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:35,652 INFO L93 Difference]: Finished difference Result 9625 states and 30199 transitions. [2019-12-27 01:35:35,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:35:35,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 01:35:35,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:35,669 INFO L225 Difference]: With dead ends: 9625 [2019-12-27 01:35:35,669 INFO L226 Difference]: Without dead ends: 9625 [2019-12-27 01:35:35,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:35:35,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9625 states. [2019-12-27 01:35:35,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9625 to 9625. [2019-12-27 01:35:35,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9625 states. [2019-12-27 01:35:35,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9625 states to 9625 states and 30199 transitions. [2019-12-27 01:35:35,899 INFO L78 Accepts]: Start accepts. Automaton has 9625 states and 30199 transitions. Word has length 65 [2019-12-27 01:35:35,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:35,900 INFO L462 AbstractCegarLoop]: Abstraction has 9625 states and 30199 transitions. [2019-12-27 01:35:35,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:35:35,900 INFO L276 IsEmpty]: Start isEmpty. Operand 9625 states and 30199 transitions. [2019-12-27 01:35:35,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:35:35,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:35,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:35,914 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:35,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:35,915 INFO L82 PathProgramCache]: Analyzing trace with hash 889984155, now seen corresponding path program 1 times [2019-12-27 01:35:35,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:35,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187025079] [2019-12-27 01:35:35,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:35,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187025079] [2019-12-27 01:35:35,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:35,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:35:35,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319511613] [2019-12-27 01:35:35,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:35:35,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:35,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:35:35,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:35:35,993 INFO L87 Difference]: Start difference. First operand 9625 states and 30199 transitions. Second operand 3 states. [2019-12-27 01:35:36,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:36,035 INFO L93 Difference]: Finished difference Result 8092 states and 24802 transitions. [2019-12-27 01:35:36,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:35:36,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 01:35:36,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:36,048 INFO L225 Difference]: With dead ends: 8092 [2019-12-27 01:35:36,049 INFO L226 Difference]: Without dead ends: 8092 [2019-12-27 01:35:36,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:35:36,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8092 states. [2019-12-27 01:35:36,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8092 to 8092. [2019-12-27 01:35:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8092 states. [2019-12-27 01:35:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8092 states to 8092 states and 24802 transitions. [2019-12-27 01:35:36,186 INFO L78 Accepts]: Start accepts. Automaton has 8092 states and 24802 transitions. Word has length 66 [2019-12-27 01:35:36,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:36,186 INFO L462 AbstractCegarLoop]: Abstraction has 8092 states and 24802 transitions. [2019-12-27 01:35:36,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:35:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 8092 states and 24802 transitions. [2019-12-27 01:35:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:35:36,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:36,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:36,194 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:36,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:36,194 INFO L82 PathProgramCache]: Analyzing trace with hash 2078724657, now seen corresponding path program 1 times [2019-12-27 01:35:36,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:36,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494966759] [2019-12-27 01:35:36,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:36,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494966759] [2019-12-27 01:35:36,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:36,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:35:36,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195106540] [2019-12-27 01:35:36,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:35:36,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:36,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:35:36,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:35:36,313 INFO L87 Difference]: Start difference. First operand 8092 states and 24802 transitions. Second operand 9 states. [2019-12-27 01:35:37,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:37,474 INFO L93 Difference]: Finished difference Result 16004 states and 48332 transitions. [2019-12-27 01:35:37,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 01:35:37,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 01:35:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:37,489 INFO L225 Difference]: With dead ends: 16004 [2019-12-27 01:35:37,490 INFO L226 Difference]: Without dead ends: 11673 [2019-12-27 01:35:37,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-27 01:35:37,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11673 states. [2019-12-27 01:35:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11673 to 8750. [2019-12-27 01:35:37,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8750 states. [2019-12-27 01:35:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8750 states to 8750 states and 26571 transitions. [2019-12-27 01:35:37,641 INFO L78 Accepts]: Start accepts. Automaton has 8750 states and 26571 transitions. Word has length 67 [2019-12-27 01:35:37,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:37,641 INFO L462 AbstractCegarLoop]: Abstraction has 8750 states and 26571 transitions. [2019-12-27 01:35:37,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:35:37,641 INFO L276 IsEmpty]: Start isEmpty. Operand 8750 states and 26571 transitions. [2019-12-27 01:35:37,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:35:37,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:37,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:37,650 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:37,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:37,650 INFO L82 PathProgramCache]: Analyzing trace with hash 721495091, now seen corresponding path program 2 times [2019-12-27 01:35:37,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:37,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856630686] [2019-12-27 01:35:37,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:37,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:37,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856630686] [2019-12-27 01:35:37,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:37,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:35:37,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202723531] [2019-12-27 01:35:37,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:35:37,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:37,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:35:37,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:35:37,831 INFO L87 Difference]: Start difference. First operand 8750 states and 26571 transitions. Second operand 10 states. [2019-12-27 01:35:38,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:38,806 INFO L93 Difference]: Finished difference Result 13795 states and 41347 transitions. [2019-12-27 01:35:38,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 01:35:38,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 01:35:38,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:38,828 INFO L225 Difference]: With dead ends: 13795 [2019-12-27 01:35:38,829 INFO L226 Difference]: Without dead ends: 12776 [2019-12-27 01:35:38,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-12-27 01:35:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12776 states. [2019-12-27 01:35:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12776 to 10358. [2019-12-27 01:35:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10358 states. [2019-12-27 01:35:39,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10358 states to 10358 states and 31317 transitions. [2019-12-27 01:35:39,043 INFO L78 Accepts]: Start accepts. Automaton has 10358 states and 31317 transitions. Word has length 67 [2019-12-27 01:35:39,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:39,044 INFO L462 AbstractCegarLoop]: Abstraction has 10358 states and 31317 transitions. [2019-12-27 01:35:39,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:35:39,044 INFO L276 IsEmpty]: Start isEmpty. Operand 10358 states and 31317 transitions. [2019-12-27 01:35:39,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:35:39,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:39,054 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:39,054 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:39,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:39,054 INFO L82 PathProgramCache]: Analyzing trace with hash 957967249, now seen corresponding path program 3 times [2019-12-27 01:35:39,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:39,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551582720] [2019-12-27 01:35:39,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:39,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:39,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551582720] [2019-12-27 01:35:39,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:39,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:35:39,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785603511] [2019-12-27 01:35:39,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:35:39,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:39,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:35:39,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:35:39,210 INFO L87 Difference]: Start difference. First operand 10358 states and 31317 transitions. Second operand 10 states. [2019-12-27 01:35:39,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:39,900 INFO L93 Difference]: Finished difference Result 13246 states and 39330 transitions. [2019-12-27 01:35:39,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:35:39,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 01:35:39,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:39,916 INFO L225 Difference]: With dead ends: 13246 [2019-12-27 01:35:39,916 INFO L226 Difference]: Without dead ends: 11079 [2019-12-27 01:35:39,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 01:35:39,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11079 states. [2019-12-27 01:35:40,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11079 to 8420. [2019-12-27 01:35:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8420 states. [2019-12-27 01:35:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8420 states to 8420 states and 25529 transitions. [2019-12-27 01:35:40,066 INFO L78 Accepts]: Start accepts. Automaton has 8420 states and 25529 transitions. Word has length 67 [2019-12-27 01:35:40,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:40,066 INFO L462 AbstractCegarLoop]: Abstraction has 8420 states and 25529 transitions. [2019-12-27 01:35:40,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:35:40,067 INFO L276 IsEmpty]: Start isEmpty. Operand 8420 states and 25529 transitions. [2019-12-27 01:35:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:35:40,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:40,079 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:40,079 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:40,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:40,079 INFO L82 PathProgramCache]: Analyzing trace with hash 88464887, now seen corresponding path program 4 times [2019-12-27 01:35:40,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:40,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304422150] [2019-12-27 01:35:40,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:40,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304422150] [2019-12-27 01:35:40,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:40,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 01:35:40,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512573497] [2019-12-27 01:35:40,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 01:35:40,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:40,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 01:35:40,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:35:40,491 INFO L87 Difference]: Start difference. First operand 8420 states and 25529 transitions. Second operand 15 states. [2019-12-27 01:35:43,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:43,072 INFO L93 Difference]: Finished difference Result 14776 states and 44601 transitions. [2019-12-27 01:35:43,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 01:35:43,078 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 01:35:43,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:43,096 INFO L225 Difference]: With dead ends: 14776 [2019-12-27 01:35:43,096 INFO L226 Difference]: Without dead ends: 13757 [2019-12-27 01:35:43,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=417, Invalid=2033, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 01:35:43,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13757 states. [2019-12-27 01:35:43,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13757 to 10756. [2019-12-27 01:35:43,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10756 states. [2019-12-27 01:35:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10756 states to 10756 states and 32813 transitions. [2019-12-27 01:35:43,283 INFO L78 Accepts]: Start accepts. Automaton has 10756 states and 32813 transitions. Word has length 67 [2019-12-27 01:35:43,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:43,283 INFO L462 AbstractCegarLoop]: Abstraction has 10756 states and 32813 transitions. [2019-12-27 01:35:43,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 01:35:43,283 INFO L276 IsEmpty]: Start isEmpty. Operand 10756 states and 32813 transitions. [2019-12-27 01:35:43,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:35:43,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:43,293 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:43,294 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:43,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:43,294 INFO L82 PathProgramCache]: Analyzing trace with hash 324937045, now seen corresponding path program 5 times [2019-12-27 01:35:43,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:43,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305637175] [2019-12-27 01:35:43,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:43,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:43,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305637175] [2019-12-27 01:35:43,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:43,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:35:43,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380457281] [2019-12-27 01:35:43,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:35:43,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:43,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:35:43,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:35:43,458 INFO L87 Difference]: Start difference. First operand 10756 states and 32813 transitions. Second operand 11 states. [2019-12-27 01:35:44,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:44,126 INFO L93 Difference]: Finished difference Result 13132 states and 39182 transitions. [2019-12-27 01:35:44,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 01:35:44,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 01:35:44,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:44,141 INFO L225 Difference]: With dead ends: 13132 [2019-12-27 01:35:44,141 INFO L226 Difference]: Without dead ends: 10305 [2019-12-27 01:35:44,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-27 01:35:44,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10305 states. [2019-12-27 01:35:44,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10305 to 8276. [2019-12-27 01:35:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8276 states. [2019-12-27 01:35:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8276 states to 8276 states and 24995 transitions. [2019-12-27 01:35:44,485 INFO L78 Accepts]: Start accepts. Automaton has 8276 states and 24995 transitions. Word has length 67 [2019-12-27 01:35:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:44,485 INFO L462 AbstractCegarLoop]: Abstraction has 8276 states and 24995 transitions. [2019-12-27 01:35:44,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:35:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 8276 states and 24995 transitions. [2019-12-27 01:35:44,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:35:44,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:44,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:44,495 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:44,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:44,495 INFO L82 PathProgramCache]: Analyzing trace with hash 975038819, now seen corresponding path program 6 times [2019-12-27 01:35:44,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:44,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378606247] [2019-12-27 01:35:44,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:44,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:44,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378606247] [2019-12-27 01:35:44,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:44,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:35:44,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325472437] [2019-12-27 01:35:44,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:35:44,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:44,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:35:44,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:35:44,643 INFO L87 Difference]: Start difference. First operand 8276 states and 24995 transitions. Second operand 10 states. [2019-12-27 01:35:45,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:45,806 INFO L93 Difference]: Finished difference Result 10920 states and 32039 transitions. [2019-12-27 01:35:45,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 01:35:45,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 01:35:45,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:45,821 INFO L225 Difference]: With dead ends: 10920 [2019-12-27 01:35:45,821 INFO L226 Difference]: Without dead ends: 10445 [2019-12-27 01:35:45,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:35:45,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10445 states. [2019-12-27 01:35:45,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10445 to 8116. [2019-12-27 01:35:45,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8116 states. [2019-12-27 01:35:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8116 states to 8116 states and 24515 transitions. [2019-12-27 01:35:45,960 INFO L78 Accepts]: Start accepts. Automaton has 8116 states and 24515 transitions. Word has length 67 [2019-12-27 01:35:45,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:45,960 INFO L462 AbstractCegarLoop]: Abstraction has 8116 states and 24515 transitions. [2019-12-27 01:35:45,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:35:45,960 INFO L276 IsEmpty]: Start isEmpty. Operand 8116 states and 24515 transitions. [2019-12-27 01:35:45,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:35:45,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:45,968 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:45,968 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:45,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:45,969 INFO L82 PathProgramCache]: Analyzing trace with hash -478785703, now seen corresponding path program 7 times [2019-12-27 01:35:45,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:45,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551714824] [2019-12-27 01:35:45,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:46,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:46,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551714824] [2019-12-27 01:35:46,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:46,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:35:46,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351931011] [2019-12-27 01:35:46,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:35:46,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:46,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:35:46,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:35:46,090 INFO L87 Difference]: Start difference. First operand 8116 states and 24515 transitions. Second operand 10 states. [2019-12-27 01:35:47,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:47,223 INFO L93 Difference]: Finished difference Result 10960 states and 32212 transitions. [2019-12-27 01:35:47,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:35:47,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 01:35:47,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:47,239 INFO L225 Difference]: With dead ends: 10960 [2019-12-27 01:35:47,239 INFO L226 Difference]: Without dead ends: 10717 [2019-12-27 01:35:47,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-27 01:35:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10717 states. [2019-12-27 01:35:47,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10717 to 8132. [2019-12-27 01:35:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8132 states. [2019-12-27 01:35:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8132 states to 8132 states and 24559 transitions. [2019-12-27 01:35:47,382 INFO L78 Accepts]: Start accepts. Automaton has 8132 states and 24559 transitions. Word has length 67 [2019-12-27 01:35:47,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:47,382 INFO L462 AbstractCegarLoop]: Abstraction has 8132 states and 24559 transitions. [2019-12-27 01:35:47,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:35:47,382 INFO L276 IsEmpty]: Start isEmpty. Operand 8132 states and 24559 transitions. [2019-12-27 01:35:47,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:35:47,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:47,390 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:47,390 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:47,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:47,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1516551711, now seen corresponding path program 8 times [2019-12-27 01:35:47,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:47,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827799060] [2019-12-27 01:35:47,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:47,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827799060] [2019-12-27 01:35:47,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:47,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:35:47,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575409630] [2019-12-27 01:35:47,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:35:47,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:47,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:35:47,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:35:47,581 INFO L87 Difference]: Start difference. First operand 8132 states and 24559 transitions. Second operand 12 states. [2019-12-27 01:35:48,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:48,251 INFO L93 Difference]: Finished difference Result 10328 states and 30527 transitions. [2019-12-27 01:35:48,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:35:48,251 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 01:35:48,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:48,265 INFO L225 Difference]: With dead ends: 10328 [2019-12-27 01:35:48,266 INFO L226 Difference]: Without dead ends: 10113 [2019-12-27 01:35:48,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 01:35:48,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10113 states. [2019-12-27 01:35:48,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10113 to 7956. [2019-12-27 01:35:48,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7956 states. [2019-12-27 01:35:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7956 states to 7956 states and 24075 transitions. [2019-12-27 01:35:48,415 INFO L78 Accepts]: Start accepts. Automaton has 7956 states and 24075 transitions. Word has length 67 [2019-12-27 01:35:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:48,415 INFO L462 AbstractCegarLoop]: Abstraction has 7956 states and 24075 transitions. [2019-12-27 01:35:48,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:35:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 7956 states and 24075 transitions. [2019-12-27 01:35:48,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:35:48,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:48,423 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:48,423 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:48,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:48,424 INFO L82 PathProgramCache]: Analyzing trace with hash -494782975, now seen corresponding path program 9 times [2019-12-27 01:35:48,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:48,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317957429] [2019-12-27 01:35:48,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:35:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:35:48,543 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:35:48,543 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:35:48,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~a$r_buff1_thd0~0_132 0) (= 0 v_~a$w_buff0_used~0_689) (= 0 v_~a$w_buff1_used~0_376) (= v_~a$r_buff0_thd3~0_328 0) (= |v_ULTIMATE.start_main_~#t403~0.offset_22| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t403~0.base_29| 4)) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t403~0.base_29|) (= v_~y~0_79 0) (= 0 v_~a$r_buff1_thd1~0_125) (= 0 v_~__unbuffered_p0_EAX~0_92) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~x~0_69 0) (= 0 v_~a$r_buff1_thd2~0_129) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t403~0.base_29| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t403~0.base_29|) |v_ULTIMATE.start_main_~#t403~0.offset_22| 0)) |v_#memory_int_21|) (< 0 |v_#StackHeapBarrier_17|) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~a$flush_delayed~0_23 0) (= v_~a$r_buff1_thd3~0_224 0) (= v_~__unbuffered_p2_EBX~0_38 0) (= 0 v_~__unbuffered_cnt~0_98) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~a$r_buff0_thd2~0_124) (= v_~a~0_181 0) (= 0 |v_#NULL.base_6|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t403~0.base_29|)) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~a$r_buff0_thd1~0_195) (= v_~a$mem_tmp~0_12 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~a$w_buff1~0_172) (= v_~a$r_buff0_thd0~0_144 0) (= v_~a$w_buff0~0_228 0) (= v_~weak$$choice2~0_107 0) (= v_~z~0_20 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t403~0.base_29| 1)) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t405~0.offset=|v_ULTIMATE.start_main_~#t405~0.offset_15|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_129, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_51|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_281|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_144, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ~a~0=v_~a~0_181, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_67|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t405~0.base=|v_ULTIMATE.start_main_~#t405~0.base_17|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_~#t404~0.base=|v_ULTIMATE.start_main_~#t404~0.base_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_224, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_689, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_195, ULTIMATE.start_main_~#t403~0.base=|v_ULTIMATE.start_main_~#t403~0.base_29|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_228, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_69, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_124, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_55|, ~a$mem_tmp~0=v_~a$mem_tmp~0_12, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_172, ~y~0=v_~y~0_79, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_125, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_328, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t404~0.offset=|v_ULTIMATE.start_main_~#t404~0.offset_22|, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t403~0.offset=|v_ULTIMATE.start_main_~#t403~0.offset_22|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_376, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t405~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t405~0.base, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t404~0.base, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t403~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t404~0.offset, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t403~0.offset, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 01:35:48,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L837-1-->L839: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t404~0.base_12| 4)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t404~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t404~0.base_12|) |v_ULTIMATE.start_main_~#t404~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t404~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t404~0.offset_10| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t404~0.base_12|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t404~0.base_12| 1) |v_#valid_34|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t404~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t404~0.offset=|v_ULTIMATE.start_main_~#t404~0.offset_10|, ULTIMATE.start_main_~#t404~0.base=|v_ULTIMATE.start_main_~#t404~0.base_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t404~0.offset, ULTIMATE.start_main_~#t404~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 01:35:48,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L839-1-->L841: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t405~0.base_13| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t405~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t405~0.base_13|)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t405~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t405~0.offset_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t405~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t405~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t405~0.base_13|) |v_ULTIMATE.start_main_~#t405~0.offset_11| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t405~0.offset=|v_ULTIMATE.start_main_~#t405~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t405~0.base=|v_ULTIMATE.start_main_~#t405~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t405~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t405~0.base] because there is no mapped edge [2019-12-27 01:35:48,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L758: Formula: (and (= ~a$r_buff0_thd2~0_In931185745 ~a$r_buff1_thd2~0_Out931185745) (= 1 ~a$r_buff0_thd1~0_Out931185745) (= ~a$r_buff0_thd1~0_In931185745 ~a$r_buff1_thd1~0_Out931185745) (= ~a$r_buff1_thd3~0_Out931185745 ~a$r_buff0_thd3~0_In931185745) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In931185745)) (= ~__unbuffered_p0_EAX~0_Out931185745 ~x~0_Out931185745) (= ~x~0_Out931185745 1) (= ~y~0_In931185745 ~__unbuffered_p0_EBX~0_Out931185745) (= ~a$r_buff1_thd0~0_Out931185745 ~a$r_buff0_thd0~0_In931185745)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In931185745, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In931185745, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In931185745, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In931185745, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In931185745, ~y~0=~y~0_In931185745} OutVars{~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out931185745, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out931185745, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out931185745, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out931185745, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In931185745, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In931185745, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out931185745, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In931185745, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out931185745, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out931185745, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In931185745, ~y~0=~y~0_In931185745, ~x~0=~x~0_Out931185745} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 01:35:48,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L759-->L759-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In1510058388 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1510058388 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1510058388 |P0Thread1of1ForFork1_#t~ite5_Out1510058388|)) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out1510058388| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1510058388, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1510058388} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1510058388|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1510058388, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1510058388} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 01:35:48,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L760-->L760-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In1838480668 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In1838480668 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1838480668 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1838480668 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1838480668|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~a$w_buff1_used~0_In1838480668 |P0Thread1of1ForFork1_#t~ite6_Out1838480668|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1838480668, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1838480668, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1838480668, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1838480668} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1838480668|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1838480668, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1838480668, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1838480668, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1838480668} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:35:48,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L778-2-->L778-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In-1503297154 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1503297154 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1503297154| ~a~0_In-1503297154) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-1503297154| ~a$w_buff1~0_In-1503297154)))) InVars {~a~0=~a~0_In-1503297154, ~a$w_buff1~0=~a$w_buff1~0_In-1503297154, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1503297154, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1503297154} OutVars{~a~0=~a~0_In-1503297154, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1503297154|, ~a$w_buff1~0=~a$w_buff1~0_In-1503297154, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1503297154, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1503297154} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 01:35:48,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_12| v_~a~0_28) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_12|} OutVars{~a~0=v_~a~0_28, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_11|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_15|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 01:35:48,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L761-->L762: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-1544631920 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1544631920 256)))) (or (and (not .cse0) (= ~a$r_buff0_thd1~0_Out-1544631920 0) (not .cse1)) (and (= ~a$r_buff0_thd1~0_Out-1544631920 ~a$r_buff0_thd1~0_In-1544631920) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1544631920, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1544631920} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1544631920|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1544631920, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1544631920} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:35:48,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L762-->L762-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd1~0_In1759554975 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In1759554975 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1759554975 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1759554975 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1759554975|)) (and (= ~a$r_buff1_thd1~0_In1759554975 |P0Thread1of1ForFork1_#t~ite8_Out1759554975|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1759554975, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1759554975, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1759554975, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1759554975} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1759554975|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1759554975, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1759554975, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1759554975, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1759554975} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 01:35:48,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L762-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:35:48,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1997272490 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1997272490 256)))) (or (and (= ~a$w_buff0_used~0_In-1997272490 |P1Thread1of1ForFork2_#t~ite11_Out-1997272490|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1997272490|) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1997272490, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1997272490} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1997272490, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1997272490, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1997272490|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 01:35:48,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1799935397 256) 0))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In1799935397 256) 0))) (or (and (= 0 (mod ~a$w_buff1_used~0_In1799935397 256)) .cse0) (= 0 (mod ~a$w_buff0_used~0_In1799935397 256)) (and (= (mod ~a$r_buff1_thd3~0_In1799935397 256) 0) .cse0))) (= |P2Thread1of1ForFork0_#t~ite21_Out1799935397| |P2Thread1of1ForFork0_#t~ite20_Out1799935397|) .cse1 (= ~a$w_buff0~0_In1799935397 |P2Thread1of1ForFork0_#t~ite20_Out1799935397|)) (and (= |P2Thread1of1ForFork0_#t~ite21_Out1799935397| ~a$w_buff0~0_In1799935397) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite20_In1799935397| |P2Thread1of1ForFork0_#t~ite20_Out1799935397|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1799935397, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1799935397, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1799935397, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1799935397, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1799935397, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1799935397|, ~weak$$choice2~0=~weak$$choice2~0_In1799935397} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1799935397|, ~a$w_buff0~0=~a$w_buff0~0_In1799935397, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1799935397, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1799935397, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1799935397, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1799935397|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1799935397, ~weak$$choice2~0=~weak$$choice2~0_In1799935397} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 01:35:48,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L804-->L804-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In192569378 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_In192569378| |P2Thread1of1ForFork0_#t~ite23_Out192569378|) (= ~a$w_buff1~0_In192569378 |P2Thread1of1ForFork0_#t~ite24_Out192569378|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In192569378 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In192569378 256)) (and (= 0 (mod ~a$r_buff1_thd3~0_In192569378 256)) .cse1) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In192569378 256))))) (= ~a$w_buff1~0_In192569378 |P2Thread1of1ForFork0_#t~ite23_Out192569378|) .cse0 (= |P2Thread1of1ForFork0_#t~ite24_Out192569378| |P2Thread1of1ForFork0_#t~ite23_Out192569378|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In192569378, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In192569378|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In192569378, ~a$w_buff0_used~0=~a$w_buff0_used~0_In192569378, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In192569378, ~a$w_buff1_used~0=~a$w_buff1_used~0_In192569378, ~weak$$choice2~0=~weak$$choice2~0_In192569378} OutVars{~a$w_buff1~0=~a$w_buff1~0_In192569378, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out192569378|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out192569378|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In192569378, ~a$w_buff0_used~0=~a$w_buff0_used~0_In192569378, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In192569378, ~a$w_buff1_used~0=~a$w_buff1_used~0_In192569378, ~weak$$choice2~0=~weak$$choice2~0_In192569378} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 01:35:48,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L805-->L805-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1076330230 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_Out1076330230| |P2Thread1of1ForFork0_#t~ite27_Out1076330230|) (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1076330230 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In1076330230 256)) (and .cse0 (= 0 (mod ~a$w_buff1_used~0_In1076330230 256))) (and .cse0 (= (mod ~a$r_buff1_thd3~0_In1076330230 256) 0)))) .cse1 (= |P2Thread1of1ForFork0_#t~ite26_Out1076330230| ~a$w_buff0_used~0_In1076330230)) (and (= |P2Thread1of1ForFork0_#t~ite26_In1076330230| |P2Thread1of1ForFork0_#t~ite26_Out1076330230|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite27_Out1076330230| ~a$w_buff0_used~0_In1076330230)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1076330230|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1076330230, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1076330230, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1076330230, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1076330230, ~weak$$choice2~0=~weak$$choice2~0_In1076330230} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1076330230|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1076330230|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1076330230, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1076330230, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1076330230, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1076330230, ~weak$$choice2~0=~weak$$choice2~0_In1076330230} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 01:35:48,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_53 v_~a$r_buff0_thd3~0_52) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_52, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 01:35:48,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_16 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_16, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 01:35:48,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L814-2-->L814-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In1121759917 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd3~0_In1121759917 256) 0))) (or (and (= ~a$w_buff1~0_In1121759917 |P2Thread1of1ForFork0_#t~ite38_Out1121759917|) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out1121759917| ~a~0_In1121759917) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In1121759917, ~a$w_buff1~0=~a$w_buff1~0_In1121759917, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1121759917, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1121759917} OutVars{~a~0=~a~0_In1121759917, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1121759917|, ~a$w_buff1~0=~a$w_buff1~0_In1121759917, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1121759917, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1121759917} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:35:48,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L814-4-->L815: Formula: (= v_~a~0_36 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_36, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:35:48,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In2044008184 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In2044008184 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out2044008184| 0) (not .cse0) (not .cse1)) (and (= ~a$w_buff0_used~0_In2044008184 |P2Thread1of1ForFork0_#t~ite40_Out2044008184|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2044008184, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2044008184} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out2044008184|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2044008184, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2044008184} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 01:35:48,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd3~0_In-240449765 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-240449765 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-240449765 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-240449765 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-240449765| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite41_Out-240449765| ~a$w_buff1_used~0_In-240449765)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-240449765, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-240449765, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-240449765, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-240449765} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-240449765, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-240449765, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-240449765, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-240449765, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-240449765|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 01:35:48,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In2132262809 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In2132262809 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out2132262809|) (not .cse1)) (and (= ~a$r_buff0_thd3~0_In2132262809 |P2Thread1of1ForFork0_#t~ite42_Out2132262809|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2132262809, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2132262809} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In2132262809, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2132262809, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out2132262809|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:35:48,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1480443862 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1480443862 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1480443862 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In-1480443862 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1480443862|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~a$r_buff1_thd3~0_In-1480443862 |P2Thread1of1ForFork0_#t~ite43_Out-1480443862|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1480443862, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1480443862, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1480443862, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1480443862} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1480443862|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1480443862, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1480443862, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1480443862, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1480443862} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 01:35:48,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L780-->L780-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In1169208659 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In1169208659 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In1169208659 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In1169208659 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1169208659|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In1169208659 |P1Thread1of1ForFork2_#t~ite12_Out1169208659|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1169208659, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1169208659, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1169208659, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1169208659} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1169208659, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1169208659, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1169208659, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1169208659|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1169208659} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 01:35:48,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-1393108015 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1393108015 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-1393108015| ~a$r_buff0_thd2~0_In-1393108015)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-1393108015| 0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1393108015, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1393108015} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1393108015, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1393108015, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1393108015|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 01:35:48,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L782-->L782-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-402431534 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-402431534 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-402431534 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-402431534 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-402431534|)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-402431534| ~a$r_buff1_thd2~0_In-402431534) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-402431534, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-402431534, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-402431534, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-402431534} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-402431534, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-402431534, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-402431534, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-402431534, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-402431534|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:35:48,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= v_~a$r_buff1_thd3~0_123 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_123, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 01:35:48,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L782-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_44| v_~a$r_buff1_thd2~0_99) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_44|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_99, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_43|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 01:35:48,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L841-1-->L847: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:35:48,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L847-2-->L847-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-363058734 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-363058734 256)))) (or (and (= ~a$w_buff1~0_In-363058734 |ULTIMATE.start_main_#t~ite47_Out-363058734|) (not .cse0) (not .cse1)) (and (= ~a~0_In-363058734 |ULTIMATE.start_main_#t~ite47_Out-363058734|) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-363058734, ~a$w_buff1~0=~a$w_buff1~0_In-363058734, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-363058734, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-363058734} OutVars{~a~0=~a~0_In-363058734, ~a$w_buff1~0=~a$w_buff1~0_In-363058734, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-363058734|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-363058734, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-363058734} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 01:35:48,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L847-4-->L848: Formula: (= v_~a~0_44 |v_ULTIMATE.start_main_#t~ite47_19|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_19|} OutVars{~a~0=v_~a~0_44, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_18|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 01:35:48,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In800831541 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In800831541 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out800831541| 0)) (and (= |ULTIMATE.start_main_#t~ite49_Out800831541| ~a$w_buff0_used~0_In800831541) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In800831541, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In800831541} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In800831541, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out800831541|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In800831541} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 01:35:48,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-734589384 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-734589384 256))) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-734589384 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-734589384 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-734589384| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-734589384 |ULTIMATE.start_main_#t~ite50_Out-734589384|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-734589384, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-734589384, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-734589384, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-734589384} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-734589384|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-734589384, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-734589384, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-734589384, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-734589384} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 01:35:48,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L850-->L850-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-188480637 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-188480637 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-188480637| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out-188480637| ~a$r_buff0_thd0~0_In-188480637) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-188480637, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-188480637} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-188480637|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-188480637, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-188480637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 01:35:48,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-84606778 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-84606778 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In-84606778 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-84606778 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-84606778| ~a$r_buff1_thd0~0_In-84606778)) (and (= |ULTIMATE.start_main_#t~ite52_Out-84606778| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-84606778, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-84606778, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-84606778, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-84606778} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-84606778|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-84606778, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-84606778, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-84606778, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-84606778} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 01:35:48,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~a$r_buff1_thd0~0_125 |v_ULTIMATE.start_main_#t~ite52_55|) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~__unbuffered_p2_EBX~0_29 0) (= 0 v_~__unbuffered_p1_EAX~0_28) (= 1 v_~__unbuffered_p2_EAX~0_26) (= v_~__unbuffered_p0_EBX~0_85 0) (= v_~main$tmp_guard1~0_29 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= 1 v_~__unbuffered_p0_EAX~0_85)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_55|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_125, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:35:48,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:35:48 BasicIcfg [2019-12-27 01:35:48,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:35:48,676 INFO L168 Benchmark]: Toolchain (without parser) took 104159.79 ms. Allocated memory was 146.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.0 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 01:35:48,676 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 01:35:48,677 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.01 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 100.6 MB in the beginning and 156.1 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:35:48,677 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.96 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:35:48,680 INFO L168 Benchmark]: Boogie Preprocessor took 38.38 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:35:48,681 INFO L168 Benchmark]: RCFGBuilder took 893.94 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 100.0 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2019-12-27 01:35:48,681 INFO L168 Benchmark]: TraceAbstraction took 102357.81 ms. Allocated memory was 202.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 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 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 01:35:48,686 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.46 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 806.01 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 100.6 MB in the beginning and 156.1 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.96 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.38 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 893.94 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 100.0 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 102357.81 ms. Allocated memory was 202.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 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 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 179 ProgramPointsBefore, 94 ProgramPointsAfterwards, 216 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 33 ChoiceCompositions, 7151 VarBasedMoverChecksPositive, 221 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 258 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 80759 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$w_buff1 = a$w_buff0 [L738] 1 a$w_buff0 = 1 [L739] 1 a$w_buff1_used = a$w_buff0_used [L740] 1 a$w_buff0_used = (_Bool)1 [L758] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L772] 2 y = 1 [L775] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L758] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L759] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L760] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 101.9s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 35.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8390 SDtfs, 13358 SDslu, 28439 SDs, 0 SdLazy, 14577 SolverSat, 626 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 524 GetRequests, 68 SyntacticMatches, 18 SemanticMatches, 438 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2142 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156295occurred 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: 36.9s AutomataMinimizationTime, 37 MinimizatonAttempts, 228737 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1773 NumberOfCodeBlocks, 1773 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1669 ConstructedInterpolants, 0 QuantifiedInterpolants, 334302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...