/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:10:11,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:10:11,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:10:11,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:10:11,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:10:11,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:10:11,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:10:11,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:10:11,228 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:10:11,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:10:11,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:10:11,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:10:11,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:10:11,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:10:11,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:10:11,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:10:11,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:10:11,242 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:10:11,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:10:11,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:10:11,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:10:11,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:10:11,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:10:11,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:10:11,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:10:11,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:10:11,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:10:11,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:10:11,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:10:11,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:10:11,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:10:11,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:10:11,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:10:11,267 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:10:11,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:10:11,268 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:10:11,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:10:11,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:10:11,269 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:10:11,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:10:11,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:10:11,272 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-VariableLbe-MCR.epf [2019-12-27 22:10:11,304 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:10:11,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:10:11,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:10:11,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:10:11,307 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:10:11,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:10:11,308 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:10:11,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:10:11,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:10:11,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:10:11,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:10:11,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:10:11,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:10:11,314 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:10:11,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:10:11,314 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:10:11,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:10:11,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:10:11,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:10:11,315 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:10:11,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:10:11,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:10:11,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:10:11,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:10:11,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:10:11,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:10:11,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:10:11,316 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:10:11,316 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:10:11,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:10:11,316 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:10:11,316 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:10:11,621 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:10:11,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:10:11,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:10:11,649 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:10:11,649 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:10:11,650 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.opt.i [2019-12-27 22:10:11,721 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159ce533f/3186340d27af4809aac3f7cffd83cb1f/FLAG3b8aded30 [2019-12-27 22:10:12,297 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:10:12,301 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_rmo.opt.i [2019-12-27 22:10:12,325 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159ce533f/3186340d27af4809aac3f7cffd83cb1f/FLAG3b8aded30 [2019-12-27 22:10:12,534 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159ce533f/3186340d27af4809aac3f7cffd83cb1f [2019-12-27 22:10:12,544 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:10:12,546 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:10:12,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:10:12,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:10:12,551 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:10:12,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:10:12" (1/1) ... [2019-12-27 22:10:12,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1785c967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:10:12, skipping insertion in model container [2019-12-27 22:10:12,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:10:12" (1/1) ... [2019-12-27 22:10:12,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:10:12,609 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:10:13,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:10:13,152 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:10:13,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:10:13,297 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:10:13,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:10:13 WrapperNode [2019-12-27 22:10:13,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:10:13,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:10:13,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:10:13,299 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:10:13,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:10:13" (1/1) ... [2019-12-27 22:10:13,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:10:13" (1/1) ... [2019-12-27 22:10:13,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:10:13,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:10:13,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:10:13,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:10:13,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:10:13" (1/1) ... [2019-12-27 22:10:13,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:10:13" (1/1) ... [2019-12-27 22:10:13,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:10:13" (1/1) ... [2019-12-27 22:10:13,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:10:13" (1/1) ... [2019-12-27 22:10:13,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:10:13" (1/1) ... [2019-12-27 22:10:13,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:10:13" (1/1) ... [2019-12-27 22:10:13,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:10:13" (1/1) ... [2019-12-27 22:10:13,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:10:13,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:10:13,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:10:13,406 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:10:13,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:10:13" (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 22:10:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:10:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:10:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:10:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:10:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:10:13,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:10:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:10:13,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:10:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:10:13,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:10:13,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:10:13,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:10:13,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:10:13,470 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 22:10:14,184 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:10:14,185 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:10:14,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:10:14 BoogieIcfgContainer [2019-12-27 22:10:14,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:10:14,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:10:14,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:10:14,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:10:14,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:10:12" (1/3) ... [2019-12-27 22:10:14,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707107e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:10:14, skipping insertion in model container [2019-12-27 22:10:14,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:10:13" (2/3) ... [2019-12-27 22:10:14,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707107e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:10:14, skipping insertion in model container [2019-12-27 22:10:14,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:10:14" (3/3) ... [2019-12-27 22:10:14,195 INFO L109 eAbstractionObserver]: Analyzing ICFG safe002_rmo.opt.i [2019-12-27 22:10:14,206 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:10:14,206 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:10:14,214 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:10:14,215 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:10:14,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,257 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,257 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,282 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,282 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,307 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,307 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,315 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,316 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,316 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,321 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,322 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,325 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,325 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:10:14,345 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:10:14,367 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:10:14,367 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:10:14,367 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:10:14,367 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:10:14,368 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:10:14,368 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:10:14,368 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:10:14,368 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:10:14,384 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 22:10:14,386 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 22:10:14,480 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 22:10:14,480 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:10:14,501 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:10:14,526 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 22:10:14,576 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 22:10:14,576 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:10:14,584 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:10:14,604 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 22:10:14,605 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:10:18,450 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 22:10:18,574 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75395 [2019-12-27 22:10:18,574 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 22:10:18,577 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 93 transitions [2019-12-27 22:10:31,306 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89162 states. [2019-12-27 22:10:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 89162 states. [2019-12-27 22:10:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 22:10:31,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:31,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 22:10:31,316 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:10:31,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:31,323 INFO L82 PathProgramCache]: Analyzing trace with hash 795562218, now seen corresponding path program 1 times [2019-12-27 22:10:31,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:31,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257877811] [2019-12-27 22:10:31,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:31,540 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 22:10:31,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257877811] [2019-12-27 22:10:31,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:31,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:10:31,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1492312124] [2019-12-27 22:10:31,546 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:31,552 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:31,567 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 22:10:31,568 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:31,572 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:10:31,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:10:31,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:31,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:10:31,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:10:31,589 INFO L87 Difference]: Start difference. First operand 89162 states. Second operand 3 states. [2019-12-27 22:10:32,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:32,501 INFO L93 Difference]: Finished difference Result 87552 states and 377777 transitions. [2019-12-27 22:10:32,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:10:32,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 22:10:32,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:35,317 INFO L225 Difference]: With dead ends: 87552 [2019-12-27 22:10:35,317 INFO L226 Difference]: Without dead ends: 82092 [2019-12-27 22:10:35,318 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 22:10:38,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82092 states. [2019-12-27 22:10:40,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82092 to 82092. [2019-12-27 22:10:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82092 states. [2019-12-27 22:10:40,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82092 states to 82092 states and 353697 transitions. [2019-12-27 22:10:40,781 INFO L78 Accepts]: Start accepts. Automaton has 82092 states and 353697 transitions. Word has length 5 [2019-12-27 22:10:40,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:40,781 INFO L462 AbstractCegarLoop]: Abstraction has 82092 states and 353697 transitions. [2019-12-27 22:10:40,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:10:40,781 INFO L276 IsEmpty]: Start isEmpty. Operand 82092 states and 353697 transitions. [2019-12-27 22:10:40,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:10:40,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:40,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:10:40,790 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:10:40,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:40,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1486977711, now seen corresponding path program 1 times [2019-12-27 22:10:40,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:40,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128850182] [2019-12-27 22:10:40,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:40,872 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 22:10:40,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128850182] [2019-12-27 22:10:40,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:40,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:10:40,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [714965620] [2019-12-27 22:10:40,873 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:40,874 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:40,879 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:10:40,879 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:40,879 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:10:40,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:10:40,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:40,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:10:40,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:10:40,882 INFO L87 Difference]: Start difference. First operand 82092 states and 353697 transitions. Second operand 3 states. [2019-12-27 22:10:41,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:41,199 INFO L93 Difference]: Finished difference Result 21487 states and 74397 transitions. [2019-12-27 22:10:41,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:10:41,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:10:41,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:41,271 INFO L225 Difference]: With dead ends: 21487 [2019-12-27 22:10:41,272 INFO L226 Difference]: Without dead ends: 21487 [2019-12-27 22:10:41,272 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 22:10:41,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21487 states. [2019-12-27 22:10:44,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21487 to 21487. [2019-12-27 22:10:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21487 states. [2019-12-27 22:10:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21487 states to 21487 states and 74397 transitions. [2019-12-27 22:10:44,676 INFO L78 Accepts]: Start accepts. Automaton has 21487 states and 74397 transitions. Word has length 13 [2019-12-27 22:10:44,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:44,677 INFO L462 AbstractCegarLoop]: Abstraction has 21487 states and 74397 transitions. [2019-12-27 22:10:44,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:10:44,677 INFO L276 IsEmpty]: Start isEmpty. Operand 21487 states and 74397 transitions. [2019-12-27 22:10:44,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:10:44,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:44,680 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:10:44,680 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:10:44,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:44,681 INFO L82 PathProgramCache]: Analyzing trace with hash -726251993, now seen corresponding path program 1 times [2019-12-27 22:10:44,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:44,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386157221] [2019-12-27 22:10:44,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:44,826 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 22:10:44,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386157221] [2019-12-27 22:10:44,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:44,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:10:44,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1878583872] [2019-12-27 22:10:44,828 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:44,830 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:44,831 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:10:44,831 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:44,832 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:10:44,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:10:44,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:44,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:10:44,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:10:44,833 INFO L87 Difference]: Start difference. First operand 21487 states and 74397 transitions. Second operand 4 states. [2019-12-27 22:10:45,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:45,239 INFO L93 Difference]: Finished difference Result 31642 states and 105483 transitions. [2019-12-27 22:10:45,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:10:45,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:10:45,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:45,321 INFO L225 Difference]: With dead ends: 31642 [2019-12-27 22:10:45,321 INFO L226 Difference]: Without dead ends: 31628 [2019-12-27 22:10:45,322 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 22:10:45,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31628 states. [2019-12-27 22:10:46,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31628 to 28614. [2019-12-27 22:10:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28614 states. [2019-12-27 22:10:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28614 states to 28614 states and 96383 transitions. [2019-12-27 22:10:46,503 INFO L78 Accepts]: Start accepts. Automaton has 28614 states and 96383 transitions. Word has length 13 [2019-12-27 22:10:46,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:46,503 INFO L462 AbstractCegarLoop]: Abstraction has 28614 states and 96383 transitions. [2019-12-27 22:10:46,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:10:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand 28614 states and 96383 transitions. [2019-12-27 22:10:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:10:46,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:46,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:10:46,506 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:10:46,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:46,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1448024626, now seen corresponding path program 1 times [2019-12-27 22:10:46,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:46,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973154757] [2019-12-27 22:10:46,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:46,644 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 22:10:46,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973154757] [2019-12-27 22:10:46,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:46,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:10:46,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2104884424] [2019-12-27 22:10:46,645 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:46,647 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:46,652 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:10:46,652 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:46,736 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:10:46,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:10:46,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:46,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:10:46,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:10:46,738 INFO L87 Difference]: Start difference. First operand 28614 states and 96383 transitions. Second operand 7 states. [2019-12-27 22:10:47,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:47,441 INFO L93 Difference]: Finished difference Result 41448 states and 137006 transitions. [2019-12-27 22:10:47,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:10:47,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-27 22:10:47,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:47,513 INFO L225 Difference]: With dead ends: 41448 [2019-12-27 22:10:47,513 INFO L226 Difference]: Without dead ends: 41430 [2019-12-27 22:10:47,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:10:47,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41430 states. [2019-12-27 22:10:48,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41430 to 32619. [2019-12-27 22:10:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32619 states. [2019-12-27 22:10:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32619 states to 32619 states and 109205 transitions. [2019-12-27 22:10:48,442 INFO L78 Accepts]: Start accepts. Automaton has 32619 states and 109205 transitions. Word has length 14 [2019-12-27 22:10:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:48,443 INFO L462 AbstractCegarLoop]: Abstraction has 32619 states and 109205 transitions. [2019-12-27 22:10:48,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:10:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 32619 states and 109205 transitions. [2019-12-27 22:10:48,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:10:48,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:48,453 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 22:10:48,454 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:10:48,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:48,454 INFO L82 PathProgramCache]: Analyzing trace with hash -84735485, now seen corresponding path program 1 times [2019-12-27 22:10:48,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:48,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195977542] [2019-12-27 22:10:48,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:48,553 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 22:10:48,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195977542] [2019-12-27 22:10:48,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:48,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:10:48,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [524082962] [2019-12-27 22:10:48,554 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:48,558 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:48,571 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 92 transitions. [2019-12-27 22:10:48,571 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:48,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:10:48,737 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:10:48,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:10:48,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:48,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:10:48,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:10:48,738 INFO L87 Difference]: Start difference. First operand 32619 states and 109205 transitions. Second operand 9 states. [2019-12-27 22:10:51,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:51,231 INFO L93 Difference]: Finished difference Result 95957 states and 313890 transitions. [2019-12-27 22:10:51,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 22:10:51,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 22:10:51,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:51,422 INFO L225 Difference]: With dead ends: 95957 [2019-12-27 22:10:51,423 INFO L226 Difference]: Without dead ends: 95920 [2019-12-27 22:10:51,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:10:51,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95920 states. [2019-12-27 22:10:53,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95920 to 45667. [2019-12-27 22:10:53,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45667 states. [2019-12-27 22:10:53,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45667 states to 45667 states and 152523 transitions. [2019-12-27 22:10:53,128 INFO L78 Accepts]: Start accepts. Automaton has 45667 states and 152523 transitions. Word has length 22 [2019-12-27 22:10:53,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:53,128 INFO L462 AbstractCegarLoop]: Abstraction has 45667 states and 152523 transitions. [2019-12-27 22:10:53,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:10:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand 45667 states and 152523 transitions. [2019-12-27 22:10:53,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:10:53,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:53,143 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 22:10:53,143 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:10:53,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:53,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1284284063, now seen corresponding path program 2 times [2019-12-27 22:10:53,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:53,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690226930] [2019-12-27 22:10:53,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:53,227 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 22:10:53,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690226930] [2019-12-27 22:10:53,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:53,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:10:53,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [300274914] [2019-12-27 22:10:53,228 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:53,232 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:53,240 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 54 transitions. [2019-12-27 22:10:53,240 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:53,241 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:10:53,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:10:53,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:53,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:10:53,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:10:53,242 INFO L87 Difference]: Start difference. First operand 45667 states and 152523 transitions. Second operand 6 states. [2019-12-27 22:10:54,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:54,187 INFO L93 Difference]: Finished difference Result 70268 states and 228147 transitions. [2019-12-27 22:10:54,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:10:54,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 22:10:54,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:54,314 INFO L225 Difference]: With dead ends: 70268 [2019-12-27 22:10:54,314 INFO L226 Difference]: Without dead ends: 70238 [2019-12-27 22:10:54,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:10:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70238 states. [2019-12-27 22:10:55,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70238 to 43394. [2019-12-27 22:10:55,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43394 states. [2019-12-27 22:10:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43394 states to 43394 states and 144865 transitions. [2019-12-27 22:10:55,714 INFO L78 Accepts]: Start accepts. Automaton has 43394 states and 144865 transitions. Word has length 22 [2019-12-27 22:10:55,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:55,714 INFO L462 AbstractCegarLoop]: Abstraction has 43394 states and 144865 transitions. [2019-12-27 22:10:55,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:10:55,714 INFO L276 IsEmpty]: Start isEmpty. Operand 43394 states and 144865 transitions. [2019-12-27 22:10:55,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:10:55,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:55,734 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 22:10:55,734 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:10:55,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:55,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1211743988, now seen corresponding path program 1 times [2019-12-27 22:10:55,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:55,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300208462] [2019-12-27 22:10:55,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:55,793 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 22:10:55,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300208462] [2019-12-27 22:10:55,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:55,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:10:55,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [505422203] [2019-12-27 22:10:55,794 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:55,797 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:55,802 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:10:55,802 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:55,803 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:10:55,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:10:55,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:55,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:10:55,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:10:55,804 INFO L87 Difference]: Start difference. First operand 43394 states and 144865 transitions. Second operand 4 states. [2019-12-27 22:10:55,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:55,908 INFO L93 Difference]: Finished difference Result 17171 states and 53607 transitions. [2019-12-27 22:10:55,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:10:55,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 22:10:55,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:55,932 INFO L225 Difference]: With dead ends: 17171 [2019-12-27 22:10:55,933 INFO L226 Difference]: Without dead ends: 17171 [2019-12-27 22:10:55,933 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 22:10:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17171 states. [2019-12-27 22:10:56,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17171 to 17057. [2019-12-27 22:10:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17057 states. [2019-12-27 22:10:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17057 states to 17057 states and 53270 transitions. [2019-12-27 22:10:56,189 INFO L78 Accepts]: Start accepts. Automaton has 17057 states and 53270 transitions. Word has length 25 [2019-12-27 22:10:56,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:56,189 INFO L462 AbstractCegarLoop]: Abstraction has 17057 states and 53270 transitions. [2019-12-27 22:10:56,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:10:56,190 INFO L276 IsEmpty]: Start isEmpty. Operand 17057 states and 53270 transitions. [2019-12-27 22:10:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 22:10:56,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:56,374 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:10:56,374 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:10:56,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:56,375 INFO L82 PathProgramCache]: Analyzing trace with hash 261453908, now seen corresponding path program 1 times [2019-12-27 22:10:56,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:56,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198583611] [2019-12-27 22:10:56,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:56,445 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 22:10:56,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198583611] [2019-12-27 22:10:56,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:56,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:10:56,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2067323338] [2019-12-27 22:10:56,446 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:56,454 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:56,485 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 143 transitions. [2019-12-27 22:10:56,486 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:56,486 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:10:56,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:10:56,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:56,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:10:56,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:10:56,488 INFO L87 Difference]: Start difference. First operand 17057 states and 53270 transitions. Second operand 3 states. [2019-12-27 22:10:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:56,569 INFO L93 Difference]: Finished difference Result 17056 states and 53268 transitions. [2019-12-27 22:10:56,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:10:56,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 22:10:56,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:56,608 INFO L225 Difference]: With dead ends: 17056 [2019-12-27 22:10:56,608 INFO L226 Difference]: Without dead ends: 17056 [2019-12-27 22:10:56,608 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 22:10:56,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17056 states. [2019-12-27 22:10:56,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17056 to 17056. [2019-12-27 22:10:56,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17056 states. [2019-12-27 22:10:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17056 states to 17056 states and 53268 transitions. [2019-12-27 22:10:56,888 INFO L78 Accepts]: Start accepts. Automaton has 17056 states and 53268 transitions. Word has length 39 [2019-12-27 22:10:56,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:56,889 INFO L462 AbstractCegarLoop]: Abstraction has 17056 states and 53268 transitions. [2019-12-27 22:10:56,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:10:56,889 INFO L276 IsEmpty]: Start isEmpty. Operand 17056 states and 53268 transitions. [2019-12-27 22:10:56,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:10:56,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:56,922 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:10:56,922 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:10:56,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:56,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1879938010, now seen corresponding path program 1 times [2019-12-27 22:10:56,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:56,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858540198] [2019-12-27 22:10:56,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:56,988 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 22:10:56,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858540198] [2019-12-27 22:10:56,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:56,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:10:56,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1604016146] [2019-12-27 22:10:56,990 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:56,998 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:57,049 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 162 transitions. [2019-12-27 22:10:57,049 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:57,050 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:10:57,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:10:57,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:57,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:10:57,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:10:57,051 INFO L87 Difference]: Start difference. First operand 17056 states and 53268 transitions. Second operand 5 states. [2019-12-27 22:10:57,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:57,119 INFO L93 Difference]: Finished difference Result 15547 states and 49413 transitions. [2019-12-27 22:10:57,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:10:57,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 22:10:57,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:57,143 INFO L225 Difference]: With dead ends: 15547 [2019-12-27 22:10:57,143 INFO L226 Difference]: Without dead ends: 15547 [2019-12-27 22:10:57,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 22:10:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15547 states. [2019-12-27 22:10:57,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15547 to 14745. [2019-12-27 22:10:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14745 states. [2019-12-27 22:10:57,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14745 states to 14745 states and 47130 transitions. [2019-12-27 22:10:57,380 INFO L78 Accepts]: Start accepts. Automaton has 14745 states and 47130 transitions. Word has length 40 [2019-12-27 22:10:57,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:57,381 INFO L462 AbstractCegarLoop]: Abstraction has 14745 states and 47130 transitions. [2019-12-27 22:10:57,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:10:57,381 INFO L276 IsEmpty]: Start isEmpty. Operand 14745 states and 47130 transitions. [2019-12-27 22:10:57,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:10:57,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:57,404 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] [2019-12-27 22:10:57,404 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:10:57,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:57,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1466334831, now seen corresponding path program 1 times [2019-12-27 22:10:57,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:57,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420911387] [2019-12-27 22:10:57,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:57,468 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 22:10:57,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420911387] [2019-12-27 22:10:57,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:57,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:10:57,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [534163887] [2019-12-27 22:10:57,469 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:57,485 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:57,716 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 464 transitions. [2019-12-27 22:10:57,717 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:57,745 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:10:57,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:10:57,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:57,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:10:57,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:10:57,746 INFO L87 Difference]: Start difference. First operand 14745 states and 47130 transitions. Second operand 4 states. [2019-12-27 22:10:58,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:58,070 INFO L93 Difference]: Finished difference Result 19067 states and 60812 transitions. [2019-12-27 22:10:58,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:10:58,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 22:10:58,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:58,116 INFO L225 Difference]: With dead ends: 19067 [2019-12-27 22:10:58,116 INFO L226 Difference]: Without dead ends: 19067 [2019-12-27 22:10:58,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 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 22:10:58,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19067 states. [2019-12-27 22:10:58,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19067 to 12453. [2019-12-27 22:10:58,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12453 states. [2019-12-27 22:10:58,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12453 states to 12453 states and 39920 transitions. [2019-12-27 22:10:58,393 INFO L78 Accepts]: Start accepts. Automaton has 12453 states and 39920 transitions. Word has length 54 [2019-12-27 22:10:58,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:58,394 INFO L462 AbstractCegarLoop]: Abstraction has 12453 states and 39920 transitions. [2019-12-27 22:10:58,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:10:58,394 INFO L276 IsEmpty]: Start isEmpty. Operand 12453 states and 39920 transitions. [2019-12-27 22:10:58,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:10:58,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:58,409 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] [2019-12-27 22:10:58,409 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:10:58,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:58,410 INFO L82 PathProgramCache]: Analyzing trace with hash 81383116, now seen corresponding path program 1 times [2019-12-27 22:10:58,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:58,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701967838] [2019-12-27 22:10:58,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:58,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 22:10:58,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701967838] [2019-12-27 22:10:58,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:58,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:10:58,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1377100729] [2019-12-27 22:10:58,491 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:58,506 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:58,826 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 328 states and 708 transitions. [2019-12-27 22:10:58,827 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:58,830 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:10:58,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:10:58,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:58,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:10:58,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:10:58,832 INFO L87 Difference]: Start difference. First operand 12453 states and 39920 transitions. Second operand 4 states. [2019-12-27 22:10:58,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:58,971 INFO L93 Difference]: Finished difference Result 23822 states and 76579 transitions. [2019-12-27 22:10:58,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:10:58,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 22:10:58,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:58,996 INFO L225 Difference]: With dead ends: 23822 [2019-12-27 22:10:58,996 INFO L226 Difference]: Without dead ends: 11678 [2019-12-27 22:10:58,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 22:10:59,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11678 states. [2019-12-27 22:10:59,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11678 to 11678. [2019-12-27 22:10:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11678 states. [2019-12-27 22:10:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11678 states to 11678 states and 37549 transitions. [2019-12-27 22:10:59,241 INFO L78 Accepts]: Start accepts. Automaton has 11678 states and 37549 transitions. Word has length 54 [2019-12-27 22:10:59,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:59,241 INFO L462 AbstractCegarLoop]: Abstraction has 11678 states and 37549 transitions. [2019-12-27 22:10:59,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:10:59,241 INFO L276 IsEmpty]: Start isEmpty. Operand 11678 states and 37549 transitions. [2019-12-27 22:10:59,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:10:59,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:59,256 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] [2019-12-27 22:10:59,256 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:10:59,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:59,256 INFO L82 PathProgramCache]: Analyzing trace with hash -886395566, now seen corresponding path program 2 times [2019-12-27 22:10:59,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:59,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687355874] [2019-12-27 22:10:59,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:59,326 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 22:10:59,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687355874] [2019-12-27 22:10:59,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:59,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:10:59,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [858982591] [2019-12-27 22:10:59,327 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:59,342 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:59,710 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 295 states and 622 transitions. [2019-12-27 22:10:59,710 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:59,747 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:10:59,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:10:59,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:59,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:10:59,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:10:59,748 INFO L87 Difference]: Start difference. First operand 11678 states and 37549 transitions. Second operand 6 states. [2019-12-27 22:10:59,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:59,875 INFO L93 Difference]: Finished difference Result 33223 states and 107349 transitions. [2019-12-27 22:10:59,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:10:59,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 22:10:59,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:59,888 INFO L225 Difference]: With dead ends: 33223 [2019-12-27 22:10:59,889 INFO L226 Difference]: Without dead ends: 6909 [2019-12-27 22:10:59,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:10:59,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6909 states. [2019-12-27 22:10:59,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6909 to 6909. [2019-12-27 22:10:59,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6909 states. [2019-12-27 22:11:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6909 states to 6909 states and 22371 transitions. [2019-12-27 22:11:00,003 INFO L78 Accepts]: Start accepts. Automaton has 6909 states and 22371 transitions. Word has length 54 [2019-12-27 22:11:00,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:00,003 INFO L462 AbstractCegarLoop]: Abstraction has 6909 states and 22371 transitions. [2019-12-27 22:11:00,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:11:00,003 INFO L276 IsEmpty]: Start isEmpty. Operand 6909 states and 22371 transitions. [2019-12-27 22:11:00,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:11:00,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:00,011 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:11:00,011 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:11:00,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:00,011 INFO L82 PathProgramCache]: Analyzing trace with hash 139987658, now seen corresponding path program 3 times [2019-12-27 22:11:00,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:00,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936041600] [2019-12-27 22:11:00,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:00,103 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 22:11:00,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936041600] [2019-12-27 22:11:00,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:00,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:11:00,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1507300694] [2019-12-27 22:11:00,105 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:00,120 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:00,293 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 217 states and 425 transitions. [2019-12-27 22:11:00,294 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:00,394 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 22:11:00,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:11:00,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:00,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:11:00,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:11:00,395 INFO L87 Difference]: Start difference. First operand 6909 states and 22371 transitions. Second operand 8 states. [2019-12-27 22:11:00,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:00,694 INFO L93 Difference]: Finished difference Result 11531 states and 37278 transitions. [2019-12-27 22:11:00,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 22:11:00,694 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 22:11:00,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:00,709 INFO L225 Difference]: With dead ends: 11531 [2019-12-27 22:11:00,709 INFO L226 Difference]: Without dead ends: 8881 [2019-12-27 22:11:00,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:11:00,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8881 states. [2019-12-27 22:11:00,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8881 to 8116. [2019-12-27 22:11:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8116 states. [2019-12-27 22:11:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8116 states to 8116 states and 26358 transitions. [2019-12-27 22:11:00,848 INFO L78 Accepts]: Start accepts. Automaton has 8116 states and 26358 transitions. Word has length 54 [2019-12-27 22:11:00,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:00,848 INFO L462 AbstractCegarLoop]: Abstraction has 8116 states and 26358 transitions. [2019-12-27 22:11:00,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:11:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 8116 states and 26358 transitions. [2019-12-27 22:11:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:11:00,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:00,859 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] [2019-12-27 22:11:00,859 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:11:00,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:00,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1645888394, now seen corresponding path program 4 times [2019-12-27 22:11:00,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:00,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147075448] [2019-12-27 22:11:00,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:00,946 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 22:11:00,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147075448] [2019-12-27 22:11:00,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:00,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:11:00,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1016686700] [2019-12-27 22:11:00,947 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:00,963 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:01,384 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 464 transitions. [2019-12-27 22:11:01,385 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:01,528 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:11:01,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:11:01,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:01,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:11:01,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:11:01,529 INFO L87 Difference]: Start difference. First operand 8116 states and 26358 transitions. Second operand 11 states. [2019-12-27 22:11:02,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:02,730 INFO L93 Difference]: Finished difference Result 17718 states and 56640 transitions. [2019-12-27 22:11:02,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 22:11:02,731 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 22:11:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:02,751 INFO L225 Difference]: With dead ends: 17718 [2019-12-27 22:11:02,751 INFO L226 Difference]: Without dead ends: 13078 [2019-12-27 22:11:02,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-12-27 22:11:02,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13078 states. [2019-12-27 22:11:02,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13078 to 9638. [2019-12-27 22:11:02,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9638 states. [2019-12-27 22:11:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9638 states to 9638 states and 31057 transitions. [2019-12-27 22:11:02,928 INFO L78 Accepts]: Start accepts. Automaton has 9638 states and 31057 transitions. Word has length 54 [2019-12-27 22:11:02,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:02,928 INFO L462 AbstractCegarLoop]: Abstraction has 9638 states and 31057 transitions. [2019-12-27 22:11:02,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:11:02,928 INFO L276 IsEmpty]: Start isEmpty. Operand 9638 states and 31057 transitions. [2019-12-27 22:11:02,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:11:02,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:02,942 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] [2019-12-27 22:11:02,942 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:11:02,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:02,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1656812138, now seen corresponding path program 5 times [2019-12-27 22:11:02,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:02,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719568017] [2019-12-27 22:11:02,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:03,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:11:03,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719568017] [2019-12-27 22:11:03,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:03,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:11:03,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1163519077] [2019-12-27 22:11:03,026 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:03,041 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:03,199 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 358 transitions. [2019-12-27 22:11:03,199 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:03,483 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 22:11:03,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:11:03,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:03,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:11:03,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:11:03,484 INFO L87 Difference]: Start difference. First operand 9638 states and 31057 transitions. Second operand 10 states. [2019-12-27 22:11:05,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:05,632 INFO L93 Difference]: Finished difference Result 45814 states and 142264 transitions. [2019-12-27 22:11:05,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 22:11:05,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 22:11:05,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:05,687 INFO L225 Difference]: With dead ends: 45814 [2019-12-27 22:11:05,687 INFO L226 Difference]: Without dead ends: 34428 [2019-12-27 22:11:05,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 11 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2019-12-27 22:11:06,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34428 states. [2019-12-27 22:11:06,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34428 to 11386. [2019-12-27 22:11:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11386 states. [2019-12-27 22:11:06,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11386 states to 11386 states and 36608 transitions. [2019-12-27 22:11:06,245 INFO L78 Accepts]: Start accepts. Automaton has 11386 states and 36608 transitions. Word has length 54 [2019-12-27 22:11:06,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:06,246 INFO L462 AbstractCegarLoop]: Abstraction has 11386 states and 36608 transitions. [2019-12-27 22:11:06,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:11:06,246 INFO L276 IsEmpty]: Start isEmpty. Operand 11386 states and 36608 transitions. [2019-12-27 22:11:06,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:11:06,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:06,258 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] [2019-12-27 22:11:06,258 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:11:06,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:06,258 INFO L82 PathProgramCache]: Analyzing trace with hash -434377068, now seen corresponding path program 6 times [2019-12-27 22:11:06,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:06,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124551442] [2019-12-27 22:11:06,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:06,369 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 22:11:06,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124551442] [2019-12-27 22:11:06,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:06,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:11:06,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1199921913] [2019-12-27 22:11:06,371 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:06,385 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:06,542 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 403 transitions. [2019-12-27 22:11:06,542 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:06,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:11:06,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:11:06,784 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 22:11:06,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:11:06,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:06,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:11:06,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:11:06,786 INFO L87 Difference]: Start difference. First operand 11386 states and 36608 transitions. Second operand 13 states. [2019-12-27 22:11:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:09,669 INFO L93 Difference]: Finished difference Result 45595 states and 140484 transitions. [2019-12-27 22:11:09,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 22:11:09,670 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 22:11:09,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:09,741 INFO L225 Difference]: With dead ends: 45595 [2019-12-27 22:11:09,741 INFO L226 Difference]: Without dead ends: 45511 [2019-12-27 22:11:09,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2019-12-27 22:11:09,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45511 states. [2019-12-27 22:11:10,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45511 to 15102. [2019-12-27 22:11:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15102 states. [2019-12-27 22:11:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15102 states to 15102 states and 47525 transitions. [2019-12-27 22:11:10,457 INFO L78 Accepts]: Start accepts. Automaton has 15102 states and 47525 transitions. Word has length 54 [2019-12-27 22:11:10,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:10,458 INFO L462 AbstractCegarLoop]: Abstraction has 15102 states and 47525 transitions. [2019-12-27 22:11:10,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:11:10,458 INFO L276 IsEmpty]: Start isEmpty. Operand 15102 states and 47525 transitions. [2019-12-27 22:11:10,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:11:10,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:10,474 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] [2019-12-27 22:11:10,474 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:11:10,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:10,474 INFO L82 PathProgramCache]: Analyzing trace with hash -458785952, now seen corresponding path program 7 times [2019-12-27 22:11:10,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:10,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220105694] [2019-12-27 22:11:10,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:10,596 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 22:11:10,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220105694] [2019-12-27 22:11:10,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:10,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:11:10,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2082258458] [2019-12-27 22:11:10,598 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:10,613 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:10,788 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 232 states and 408 transitions. [2019-12-27 22:11:10,788 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:10,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:11:10,977 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:11:10,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:11:10,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:10,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:11:10,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:11:10,978 INFO L87 Difference]: Start difference. First operand 15102 states and 47525 transitions. Second operand 11 states. [2019-12-27 22:11:12,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:12,692 INFO L93 Difference]: Finished difference Result 27392 states and 84039 transitions. [2019-12-27 22:11:12,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 22:11:12,692 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 22:11:12,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:12,732 INFO L225 Difference]: With dead ends: 27392 [2019-12-27 22:11:12,732 INFO L226 Difference]: Without dead ends: 27282 [2019-12-27 22:11:12,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-27 22:11:12,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27282 states. [2019-12-27 22:11:13,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27282 to 20082. [2019-12-27 22:11:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20082 states. [2019-12-27 22:11:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20082 states to 20082 states and 62583 transitions. [2019-12-27 22:11:13,108 INFO L78 Accepts]: Start accepts. Automaton has 20082 states and 62583 transitions. Word has length 54 [2019-12-27 22:11:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:13,108 INFO L462 AbstractCegarLoop]: Abstraction has 20082 states and 62583 transitions. [2019-12-27 22:11:13,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:11:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 20082 states and 62583 transitions. [2019-12-27 22:11:13,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:11:13,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:13,129 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] [2019-12-27 22:11:13,130 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:11:13,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:13,130 INFO L82 PathProgramCache]: Analyzing trace with hash -2051129792, now seen corresponding path program 8 times [2019-12-27 22:11:13,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:13,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568270503] [2019-12-27 22:11:13,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:13,193 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 22:11:13,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568270503] [2019-12-27 22:11:13,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:13,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:11:13,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1906468999] [2019-12-27 22:11:13,194 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:13,208 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:13,567 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 335 transitions. [2019-12-27 22:11:13,567 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:13,574 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:11:13,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:11:13,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:13,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:11:13,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:11:13,575 INFO L87 Difference]: Start difference. First operand 20082 states and 62583 transitions. Second operand 4 states. [2019-12-27 22:11:13,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:13,832 INFO L93 Difference]: Finished difference Result 19276 states and 58903 transitions. [2019-12-27 22:11:13,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:11:13,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 22:11:13,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:13,862 INFO L225 Difference]: With dead ends: 19276 [2019-12-27 22:11:13,862 INFO L226 Difference]: Without dead ends: 19276 [2019-12-27 22:11:13,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:11:13,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19276 states. [2019-12-27 22:11:14,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19276 to 14152. [2019-12-27 22:11:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14152 states. [2019-12-27 22:11:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14152 states to 14152 states and 43541 transitions. [2019-12-27 22:11:14,129 INFO L78 Accepts]: Start accepts. Automaton has 14152 states and 43541 transitions. Word has length 54 [2019-12-27 22:11:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:14,129 INFO L462 AbstractCegarLoop]: Abstraction has 14152 states and 43541 transitions. [2019-12-27 22:11:14,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:11:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 14152 states and 43541 transitions. [2019-12-27 22:11:14,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:11:14,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:14,144 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] [2019-12-27 22:11:14,145 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:11:14,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:14,145 INFO L82 PathProgramCache]: Analyzing trace with hash -318791943, now seen corresponding path program 1 times [2019-12-27 22:11:14,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:14,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580115370] [2019-12-27 22:11:14,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:14,257 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 22:11:14,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580115370] [2019-12-27 22:11:14,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:14,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:11:14,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1070499645] [2019-12-27 22:11:14,259 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:14,275 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:14,439 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 414 transitions. [2019-12-27 22:11:14,439 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:14,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:11:14,720 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 22:11:14,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:11:14,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:14,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:11:14,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:11:14,721 INFO L87 Difference]: Start difference. First operand 14152 states and 43541 transitions. Second operand 13 states. [2019-12-27 22:11:16,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:16,247 INFO L93 Difference]: Finished difference Result 20200 states and 60191 transitions. [2019-12-27 22:11:16,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 22:11:16,248 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-12-27 22:11:16,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:16,275 INFO L225 Difference]: With dead ends: 20200 [2019-12-27 22:11:16,275 INFO L226 Difference]: Without dead ends: 20092 [2019-12-27 22:11:16,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-12-27 22:11:16,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20092 states. [2019-12-27 22:11:16,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20092 to 14962. [2019-12-27 22:11:16,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14962 states. [2019-12-27 22:11:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14962 states to 14962 states and 45834 transitions. [2019-12-27 22:11:16,548 INFO L78 Accepts]: Start accepts. Automaton has 14962 states and 45834 transitions. Word has length 55 [2019-12-27 22:11:16,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:16,549 INFO L462 AbstractCegarLoop]: Abstraction has 14962 states and 45834 transitions. [2019-12-27 22:11:16,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:11:16,549 INFO L276 IsEmpty]: Start isEmpty. Operand 14962 states and 45834 transitions. [2019-12-27 22:11:16,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:11:16,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:16,565 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] [2019-12-27 22:11:16,565 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:11:16,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:16,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1048892077, now seen corresponding path program 2 times [2019-12-27 22:11:16,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:16,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548045949] [2019-12-27 22:11:16,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:16,738 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 22:11:16,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548045949] [2019-12-27 22:11:16,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:16,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:11:16,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [468130363] [2019-12-27 22:11:16,739 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:16,751 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:17,098 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 175 states and 323 transitions. [2019-12-27 22:11:17,098 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:17,239 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:11:17,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:11:17,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:17,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:11:17,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:11:17,240 INFO L87 Difference]: Start difference. First operand 14962 states and 45834 transitions. Second operand 13 states. [2019-12-27 22:11:18,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:18,679 INFO L93 Difference]: Finished difference Result 21999 states and 66644 transitions. [2019-12-27 22:11:18,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 22:11:18,679 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-12-27 22:11:18,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:18,702 INFO L225 Difference]: With dead ends: 21999 [2019-12-27 22:11:18,702 INFO L226 Difference]: Without dead ends: 16508 [2019-12-27 22:11:18,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-27 22:11:18,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16508 states. [2019-12-27 22:11:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16508 to 15313. [2019-12-27 22:11:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15313 states. [2019-12-27 22:11:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15313 states to 15313 states and 46704 transitions. [2019-12-27 22:11:18,943 INFO L78 Accepts]: Start accepts. Automaton has 15313 states and 46704 transitions. Word has length 55 [2019-12-27 22:11:18,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:18,943 INFO L462 AbstractCegarLoop]: Abstraction has 15313 states and 46704 transitions. [2019-12-27 22:11:18,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:11:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 15313 states and 46704 transitions. [2019-12-27 22:11:18,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:11:18,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:18,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:18,960 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:11:18,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:18,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1460850481, now seen corresponding path program 3 times [2019-12-27 22:11:18,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:18,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982196739] [2019-12-27 22:11:18,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:19,172 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 22:11:19,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982196739] [2019-12-27 22:11:19,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:19,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:11:19,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [590329687] [2019-12-27 22:11:19,174 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:19,198 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:19,364 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 146 states and 247 transitions. [2019-12-27 22:11:19,364 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:19,811 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 22:11:19,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:11:19,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:19,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:11:19,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:11:19,812 INFO L87 Difference]: Start difference. First operand 15313 states and 46704 transitions. Second operand 15 states. [2019-12-27 22:11:22,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:22,565 INFO L93 Difference]: Finished difference Result 31353 states and 93632 transitions. [2019-12-27 22:11:22,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 22:11:22,566 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-27 22:11:22,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:22,603 INFO L225 Difference]: With dead ends: 31353 [2019-12-27 22:11:22,603 INFO L226 Difference]: Without dead ends: 25677 [2019-12-27 22:11:22,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 12 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=262, Invalid=1220, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 22:11:22,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25677 states. [2019-12-27 22:11:23,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25677 to 15762. [2019-12-27 22:11:23,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15762 states. [2019-12-27 22:11:23,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15762 states to 15762 states and 47731 transitions. [2019-12-27 22:11:23,124 INFO L78 Accepts]: Start accepts. Automaton has 15762 states and 47731 transitions. Word has length 55 [2019-12-27 22:11:23,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:23,125 INFO L462 AbstractCegarLoop]: Abstraction has 15762 states and 47731 transitions. [2019-12-27 22:11:23,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:11:23,125 INFO L276 IsEmpty]: Start isEmpty. Operand 15762 states and 47731 transitions. [2019-12-27 22:11:23,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:11:23,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:23,142 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] [2019-12-27 22:11:23,142 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:11:23,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:23,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1440625269, now seen corresponding path program 4 times [2019-12-27 22:11:23,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:23,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034716876] [2019-12-27 22:11:23,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:23,353 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 22:11:23,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034716876] [2019-12-27 22:11:23,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:23,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:11:23,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [582763952] [2019-12-27 22:11:23,354 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:23,367 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:23,515 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 269 transitions. [2019-12-27 22:11:23,515 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:24,092 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 22:11:24,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 22:11:24,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:24,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 22:11:24,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:11:24,094 INFO L87 Difference]: Start difference. First operand 15762 states and 47731 transitions. Second operand 17 states. [2019-12-27 22:11:26,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:26,521 INFO L93 Difference]: Finished difference Result 27423 states and 81835 transitions. [2019-12-27 22:11:26,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 22:11:26,521 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-12-27 22:11:26,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:26,554 INFO L225 Difference]: With dead ends: 27423 [2019-12-27 22:11:26,554 INFO L226 Difference]: Without dead ends: 24098 [2019-12-27 22:11:26,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 13 SyntacticMatches, 13 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=245, Invalid=1237, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 22:11:26,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24098 states. [2019-12-27 22:11:26,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24098 to 15435. [2019-12-27 22:11:26,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15435 states. [2019-12-27 22:11:26,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15435 states to 15435 states and 46790 transitions. [2019-12-27 22:11:26,859 INFO L78 Accepts]: Start accepts. Automaton has 15435 states and 46790 transitions. Word has length 55 [2019-12-27 22:11:26,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:26,860 INFO L462 AbstractCegarLoop]: Abstraction has 15435 states and 46790 transitions. [2019-12-27 22:11:26,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 22:11:26,860 INFO L276 IsEmpty]: Start isEmpty. Operand 15435 states and 46790 transitions. [2019-12-27 22:11:26,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:11:26,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:26,877 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] [2019-12-27 22:11:26,877 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:11:26,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:26,877 INFO L82 PathProgramCache]: Analyzing trace with hash 331505035, now seen corresponding path program 5 times [2019-12-27 22:11:26,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:26,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984665926] [2019-12-27 22:11:26,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:27,047 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 22:11:27,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984665926] [2019-12-27 22:11:27,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:27,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:11:27,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1528106240] [2019-12-27 22:11:27,048 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:27,059 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:27,143 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 227 transitions. [2019-12-27 22:11:27,143 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:27,514 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 22:11:27,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 22:11:27,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:27,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 22:11:27,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:11:27,515 INFO L87 Difference]: Start difference. First operand 15435 states and 46790 transitions. Second operand 17 states. [2019-12-27 22:11:33,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:33,452 INFO L93 Difference]: Finished difference Result 37621 states and 112454 transitions. [2019-12-27 22:11:33,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-27 22:11:33,453 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-12-27 22:11:33,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:33,494 INFO L225 Difference]: With dead ends: 37621 [2019-12-27 22:11:33,495 INFO L226 Difference]: Without dead ends: 28228 [2019-12-27 22:11:33,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 11 SyntacticMatches, 10 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=449, Invalid=2631, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 22:11:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28228 states. [2019-12-27 22:11:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28228 to 16805. [2019-12-27 22:11:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16805 states. [2019-12-27 22:11:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16805 states to 16805 states and 50515 transitions. [2019-12-27 22:11:33,848 INFO L78 Accepts]: Start accepts. Automaton has 16805 states and 50515 transitions. Word has length 55 [2019-12-27 22:11:33,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:33,848 INFO L462 AbstractCegarLoop]: Abstraction has 16805 states and 50515 transitions. [2019-12-27 22:11:33,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 22:11:33,848 INFO L276 IsEmpty]: Start isEmpty. Operand 16805 states and 50515 transitions. [2019-12-27 22:11:33,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:11:33,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:33,867 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] [2019-12-27 22:11:33,867 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:11:33,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:33,867 INFO L82 PathProgramCache]: Analyzing trace with hash -826291291, now seen corresponding path program 6 times [2019-12-27 22:11:33,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:33,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33514762] [2019-12-27 22:11:33,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:34,395 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 22:11:34,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33514762] [2019-12-27 22:11:34,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:34,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 22:11:34,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1517088945] [2019-12-27 22:11:34,396 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:34,417 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:34,596 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 257 transitions. [2019-12-27 22:11:34,597 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:35,602 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 22:11:35,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 22:11:35,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:35,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 22:11:35,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2019-12-27 22:11:35,604 INFO L87 Difference]: Start difference. First operand 16805 states and 50515 transitions. Second operand 28 states. [2019-12-27 22:11:35,901 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-12-27 22:11:45,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:45,872 INFO L93 Difference]: Finished difference Result 50969 states and 147474 transitions. [2019-12-27 22:11:45,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-12-27 22:11:45,873 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 55 [2019-12-27 22:11:45,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:45,936 INFO L225 Difference]: With dead ends: 50969 [2019-12-27 22:11:45,937 INFO L226 Difference]: Without dead ends: 44398 [2019-12-27 22:11:45,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 7 SyntacticMatches, 18 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3099 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1292, Invalid=8808, Unknown=0, NotChecked=0, Total=10100 [2019-12-27 22:11:46,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44398 states. [2019-12-27 22:11:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44398 to 16322. [2019-12-27 22:11:46,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16322 states. [2019-12-27 22:11:46,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16322 states to 16322 states and 48882 transitions. [2019-12-27 22:11:46,623 INFO L78 Accepts]: Start accepts. Automaton has 16322 states and 48882 transitions. Word has length 55 [2019-12-27 22:11:46,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:46,623 INFO L462 AbstractCegarLoop]: Abstraction has 16322 states and 48882 transitions. [2019-12-27 22:11:46,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 22:11:46,623 INFO L276 IsEmpty]: Start isEmpty. Operand 16322 states and 48882 transitions. [2019-12-27 22:11:46,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:11:46,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:46,641 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] [2019-12-27 22:11:46,641 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:11:46,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:46,641 INFO L82 PathProgramCache]: Analyzing trace with hash -830533993, now seen corresponding path program 7 times [2019-12-27 22:11:46,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:46,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822501042] [2019-12-27 22:11:46,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:11:46,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822501042] [2019-12-27 22:11:46,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:46,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:11:46,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1756362030] [2019-12-27 22:11:46,697 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:46,707 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:46,847 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 263 transitions. [2019-12-27 22:11:46,848 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:46,848 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:11:46,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:11:46,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:46,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:11:46,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:11:46,849 INFO L87 Difference]: Start difference. First operand 16322 states and 48882 transitions. Second operand 3 states. [2019-12-27 22:11:46,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:46,908 INFO L93 Difference]: Finished difference Result 16322 states and 48880 transitions. [2019-12-27 22:11:46,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:11:46,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 22:11:46,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:46,931 INFO L225 Difference]: With dead ends: 16322 [2019-12-27 22:11:46,931 INFO L226 Difference]: Without dead ends: 16322 [2019-12-27 22:11:46,932 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 22:11:46,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16322 states. [2019-12-27 22:11:47,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16322 to 15330. [2019-12-27 22:11:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15330 states. [2019-12-27 22:11:47,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15330 states to 15330 states and 46212 transitions. [2019-12-27 22:11:47,181 INFO L78 Accepts]: Start accepts. Automaton has 15330 states and 46212 transitions. Word has length 55 [2019-12-27 22:11:47,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:47,181 INFO L462 AbstractCegarLoop]: Abstraction has 15330 states and 46212 transitions. [2019-12-27 22:11:47,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:11:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand 15330 states and 46212 transitions. [2019-12-27 22:11:47,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:11:47,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:47,199 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] [2019-12-27 22:11:47,199 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:11:47,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:47,200 INFO L82 PathProgramCache]: Analyzing trace with hash 281160461, now seen corresponding path program 1 times [2019-12-27 22:11:47,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:47,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318581505] [2019-12-27 22:11:47,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:47,644 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 22:11:47,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318581505] [2019-12-27 22:11:47,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:47,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 22:11:47,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [287317224] [2019-12-27 22:11:47,645 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:47,655 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:47,804 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 415 transitions. [2019-12-27 22:11:47,804 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:48,527 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 22:11:48,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 22:11:48,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:48,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 22:11:48,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2019-12-27 22:11:48,528 INFO L87 Difference]: Start difference. First operand 15330 states and 46212 transitions. Second operand 26 states. [2019-12-27 22:11:56,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:56,614 INFO L93 Difference]: Finished difference Result 30458 states and 89199 transitions. [2019-12-27 22:11:56,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-12-27 22:11:56,614 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-12-27 22:11:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:56,657 INFO L225 Difference]: With dead ends: 30458 [2019-12-27 22:11:56,657 INFO L226 Difference]: Without dead ends: 29958 [2019-12-27 22:11:56,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 12 SyntacticMatches, 11 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4262 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1816, Invalid=11294, Unknown=0, NotChecked=0, Total=13110 [2019-12-27 22:11:56,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29958 states. [2019-12-27 22:11:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29958 to 18452. [2019-12-27 22:11:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18452 states. [2019-12-27 22:11:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18452 states to 18452 states and 54957 transitions. [2019-12-27 22:11:57,029 INFO L78 Accepts]: Start accepts. Automaton has 18452 states and 54957 transitions. Word has length 56 [2019-12-27 22:11:57,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:57,030 INFO L462 AbstractCegarLoop]: Abstraction has 18452 states and 54957 transitions. [2019-12-27 22:11:57,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 22:11:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 18452 states and 54957 transitions. [2019-12-27 22:11:57,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:11:57,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:57,050 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] [2019-12-27 22:11:57,051 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:11:57,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:57,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1725340389, now seen corresponding path program 2 times [2019-12-27 22:11:57,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:57,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107582159] [2019-12-27 22:11:57,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:57,478 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 22:11:57,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107582159] [2019-12-27 22:11:57,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:57,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 22:11:57,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1245758537] [2019-12-27 22:11:57,479 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:57,489 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:57,652 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 218 states and 420 transitions. [2019-12-27 22:11:57,652 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:58,446 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 22:11:58,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 22:11:58,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:58,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 22:11:58,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-12-27 22:11:58,447 INFO L87 Difference]: Start difference. First operand 18452 states and 54957 transitions. Second operand 22 states. [2019-12-27 22:12:03,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:12:03,818 INFO L93 Difference]: Finished difference Result 21586 states and 63210 transitions. [2019-12-27 22:12:03,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 22:12:03,818 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-12-27 22:12:03,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:12:03,845 INFO L225 Difference]: With dead ends: 21586 [2019-12-27 22:12:03,845 INFO L226 Difference]: Without dead ends: 18842 [2019-12-27 22:12:03,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 12 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=574, Invalid=3086, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 22:12:03,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18842 states. [2019-12-27 22:12:04,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18842 to 16194. [2019-12-27 22:12:04,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16194 states. [2019-12-27 22:12:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16194 states to 16194 states and 48533 transitions. [2019-12-27 22:12:04,103 INFO L78 Accepts]: Start accepts. Automaton has 16194 states and 48533 transitions. Word has length 56 [2019-12-27 22:12:04,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:12:04,104 INFO L462 AbstractCegarLoop]: Abstraction has 16194 states and 48533 transitions. [2019-12-27 22:12:04,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 22:12:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 16194 states and 48533 transitions. [2019-12-27 22:12:04,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:12:04,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:12:04,121 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] [2019-12-27 22:12:04,121 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:12:04,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:12:04,122 INFO L82 PathProgramCache]: Analyzing trace with hash -608746227, now seen corresponding path program 3 times [2019-12-27 22:12:04,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:12:04,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634485327] [2019-12-27 22:12:04,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:12:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:12:04,529 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 22:12:04,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634485327] [2019-12-27 22:12:04,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:12:04,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 22:12:04,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1662036512] [2019-12-27 22:12:04,530 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:12:04,537 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:12:04,681 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 221 states and 428 transitions. [2019-12-27 22:12:04,681 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:12:05,311 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 35 times. [2019-12-27 22:12:05,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 22:12:05,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:12:05,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 22:12:05,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2019-12-27 22:12:05,312 INFO L87 Difference]: Start difference. First operand 16194 states and 48533 transitions. Second operand 25 states. [2019-12-27 22:12:06,928 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-12-27 22:12:13,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:12:13,808 INFO L93 Difference]: Finished difference Result 27779 states and 81379 transitions. [2019-12-27 22:12:13,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-12-27 22:12:13,808 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2019-12-27 22:12:13,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:12:13,849 INFO L225 Difference]: With dead ends: 27779 [2019-12-27 22:12:13,850 INFO L226 Difference]: Without dead ends: 27445 [2019-12-27 22:12:13,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 14 SyntacticMatches, 13 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3997 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1643, Invalid=10347, Unknown=0, NotChecked=0, Total=11990 [2019-12-27 22:12:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27445 states. [2019-12-27 22:12:14,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27445 to 18306. [2019-12-27 22:12:14,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18306 states. [2019-12-27 22:12:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18306 states to 18306 states and 54464 transitions. [2019-12-27 22:12:14,208 INFO L78 Accepts]: Start accepts. Automaton has 18306 states and 54464 transitions. Word has length 56 [2019-12-27 22:12:14,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:12:14,208 INFO L462 AbstractCegarLoop]: Abstraction has 18306 states and 54464 transitions. [2019-12-27 22:12:14,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 22:12:14,209 INFO L276 IsEmpty]: Start isEmpty. Operand 18306 states and 54464 transitions. [2019-12-27 22:12:14,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:12:14,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:12:14,227 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] [2019-12-27 22:12:14,228 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:12:14,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:12:14,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1455765107, now seen corresponding path program 4 times [2019-12-27 22:12:14,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:12:14,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818912938] [2019-12-27 22:12:14,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:12:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:12:14,680 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 22:12:14,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818912938] [2019-12-27 22:12:14,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:12:14,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 22:12:14,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1994187629] [2019-12-27 22:12:14,681 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:12:14,688 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:12:14,982 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 237 states and 476 transitions. [2019-12-27 22:12:14,983 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:12:15,795 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 42 times. [2019-12-27 22:12:15,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 22:12:15,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:12:15,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 22:12:15,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2019-12-27 22:12:15,796 INFO L87 Difference]: Start difference. First operand 18306 states and 54464 transitions. Second operand 27 states. [2019-12-27 22:12:25,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:12:25,735 INFO L93 Difference]: Finished difference Result 29115 states and 84685 transitions. [2019-12-27 22:12:25,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-12-27 22:12:25,736 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2019-12-27 22:12:25,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:12:25,776 INFO L225 Difference]: With dead ends: 29115 [2019-12-27 22:12:25,777 INFO L226 Difference]: Without dead ends: 28877 [2019-12-27 22:12:25,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 18 SyntacticMatches, 18 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4274 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1727, Invalid=11155, Unknown=0, NotChecked=0, Total=12882 [2019-12-27 22:12:25,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28877 states. [2019-12-27 22:12:26,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28877 to 18810. [2019-12-27 22:12:26,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18810 states. [2019-12-27 22:12:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18810 states to 18810 states and 55849 transitions. [2019-12-27 22:12:26,284 INFO L78 Accepts]: Start accepts. Automaton has 18810 states and 55849 transitions. Word has length 56 [2019-12-27 22:12:26,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:12:26,284 INFO L462 AbstractCegarLoop]: Abstraction has 18810 states and 55849 transitions. [2019-12-27 22:12:26,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 22:12:26,284 INFO L276 IsEmpty]: Start isEmpty. Operand 18810 states and 55849 transitions. [2019-12-27 22:12:26,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:12:26,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:12:26,306 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] [2019-12-27 22:12:26,306 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:12:26,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:12:26,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1217498149, now seen corresponding path program 5 times [2019-12-27 22:12:26,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:12:26,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781512068] [2019-12-27 22:12:26,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:12:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:12:26,544 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 22:12:26,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781512068] [2019-12-27 22:12:26,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:12:26,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:12:26,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2113467021] [2019-12-27 22:12:26,548 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:12:26,570 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:12:26,823 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 206 states and 400 transitions. [2019-12-27 22:12:26,824 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:12:27,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:12:27,165 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 22:12:27,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:12:27,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:12:27,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:12:27,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:12:27,166 INFO L87 Difference]: Start difference. First operand 18810 states and 55849 transitions. Second operand 15 states. [2019-12-27 22:12:28,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:12:28,791 INFO L93 Difference]: Finished difference Result 21189 states and 62027 transitions. [2019-12-27 22:12:28,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 22:12:28,791 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 22:12:28,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:12:28,819 INFO L225 Difference]: With dead ends: 21189 [2019-12-27 22:12:28,819 INFO L226 Difference]: Without dead ends: 19651 [2019-12-27 22:12:28,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-27 22:12:28,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19651 states. [2019-12-27 22:12:29,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19651 to 18378. [2019-12-27 22:12:29,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18378 states. [2019-12-27 22:12:29,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18378 states to 18378 states and 54676 transitions. [2019-12-27 22:12:29,101 INFO L78 Accepts]: Start accepts. Automaton has 18378 states and 54676 transitions. Word has length 56 [2019-12-27 22:12:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:12:29,101 INFO L462 AbstractCegarLoop]: Abstraction has 18378 states and 54676 transitions. [2019-12-27 22:12:29,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:12:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 18378 states and 54676 transitions. [2019-12-27 22:12:29,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:12:29,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:12:29,120 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] [2019-12-27 22:12:29,120 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:12:29,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:12:29,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1562273959, now seen corresponding path program 6 times [2019-12-27 22:12:29,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:12:29,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812910828] [2019-12-27 22:12:29,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:12:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:12:29,605 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 22:12:29,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812910828] [2019-12-27 22:12:29,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:12:29,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 22:12:29,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [278419931] [2019-12-27 22:12:29,606 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:12:29,613 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:12:29,746 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 397 transitions. [2019-12-27 22:12:29,747 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:12:30,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:12:30,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:12:30,631 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 37 times. [2019-12-27 22:12:30,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 22:12:30,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:12:30,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 22:12:30,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2019-12-27 22:12:30,632 INFO L87 Difference]: Start difference. First operand 18378 states and 54676 transitions. Second operand 29 states. [2019-12-27 22:12:41,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:12:41,210 INFO L93 Difference]: Finished difference Result 30247 states and 88221 transitions. [2019-12-27 22:12:41,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-12-27 22:12:41,210 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-12-27 22:12:41,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:12:41,250 INFO L225 Difference]: With dead ends: 30247 [2019-12-27 22:12:41,250 INFO L226 Difference]: Without dead ends: 29829 [2019-12-27 22:12:41,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 14 SyntacticMatches, 15 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4337 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1736, Invalid=11836, Unknown=0, NotChecked=0, Total=13572 [2019-12-27 22:12:41,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29829 states. [2019-12-27 22:12:41,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29829 to 18758. [2019-12-27 22:12:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18758 states. [2019-12-27 22:12:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18758 states to 18758 states and 55764 transitions. [2019-12-27 22:12:41,614 INFO L78 Accepts]: Start accepts. Automaton has 18758 states and 55764 transitions. Word has length 56 [2019-12-27 22:12:41,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:12:41,614 INFO L462 AbstractCegarLoop]: Abstraction has 18758 states and 55764 transitions. [2019-12-27 22:12:41,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 22:12:41,614 INFO L276 IsEmpty]: Start isEmpty. Operand 18758 states and 55764 transitions. [2019-12-27 22:12:41,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:12:41,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:12:41,633 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] [2019-12-27 22:12:41,634 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:12:41,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:12:41,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1747486899, now seen corresponding path program 7 times [2019-12-27 22:12:41,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:12:41,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024312081] [2019-12-27 22:12:41,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:12:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:12:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:12:41,843 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:12:41,844 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:12:41,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd1~0_43 0) (= 0 v_~x$w_buff0_used~0_108) (= v_~main$tmp_guard1~0_18 0) (= 0 v_~x$r_buff0_thd3~0_21) (= 0 v_~x$w_buff1~0_25) (= 0 |v_ULTIMATE.start_main_~#t1840~0.offset_19|) (= 0 v_~x$r_buff0_thd0~0_22) (= |v_#NULL.offset_3| 0) (= v_~x~0_26 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~y~0_19 0) (= v_~x$r_buff1_thd0~0_26 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t1840~0.base_27| 1)) (= 0 v_~weak$$choice2~0_32) (= v_~x$w_buff1_used~0_67 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1840~0.base_27| 4)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1840~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1840~0.base_27|) |v_ULTIMATE.start_main_~#t1840~0.offset_19| 0)) |v_#memory_int_21|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1840~0.base_27|)) (= 0 v_~x$w_buff0~0_25) (= 0 v_~x$read_delayed~0_6) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1840~0.base_27|) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 v_~weak$$choice0~0_7) (= v_~x$flush_delayed~0_14 0) (= 0 v_~x$r_buff0_thd1~0_74) (= v_~x$r_buff1_thd3~0_18 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 |v_#NULL.base_3|) (= 0 v_~x$r_buff0_thd2~0_28) (= v_~x$mem_tmp~0_11 0) (= 0 v_~__unbuffered_cnt~0_22) (= v_~x$r_buff1_thd2~0_20 0) (= v_~__unbuffered_p0_EBX~0_16 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_25, ~x$flush_delayed~0=v_~x$flush_delayed~0_14, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, #length=|v_#length_23|, ULTIMATE.start_main_~#t1841~0.base=|v_ULTIMATE.start_main_~#t1841~0.base_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ULTIMATE.start_main_~#t1840~0.offset=|v_ULTIMATE.start_main_~#t1840~0.offset_19|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ULTIMATE.start_main_~#t1840~0.base=|v_ULTIMATE.start_main_~#t1840~0.base_27|, ~x~0=v_~x~0_26, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_74, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_23|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ULTIMATE.start_main_~#t1841~0.offset=|v_ULTIMATE.start_main_~#t1841~0.offset_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y~0=v_~y~0_19, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_26, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_108, ULTIMATE.start_main_~#t1842~0.base=|v_ULTIMATE.start_main_~#t1842~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ULTIMATE.start_main_~#t1842~0.offset=|v_ULTIMATE.start_main_~#t1842~0.offset_14|, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ULTIMATE.start_main_~#t1841~0.offset, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ULTIMATE.start_main_~#t1841~0.base, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1840~0.offset, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1842~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1840~0.base, ULTIMATE.start_main_~#t1842~0.offset, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 22:12:41,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L816-1-->L818: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1841~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t1841~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1841~0.base_10|)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1841~0.base_10|)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1841~0.base_10| 1) |v_#valid_37|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1841~0.base_10| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1841~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1841~0.base_10|) |v_ULTIMATE.start_main_~#t1841~0.offset_10| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t1841~0.base=|v_ULTIMATE.start_main_~#t1841~0.base_10|, ULTIMATE.start_main_~#t1841~0.offset=|v_ULTIMATE.start_main_~#t1841~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1841~0.base, ULTIMATE.start_main_~#t1841~0.offset, #length] because there is no mapped edge [2019-12-27 22:12:41,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L818-1-->L820: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1842~0.base_10| 0)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1842~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1842~0.base_10|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1842~0.base_10| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1842~0.base_10| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1842~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1842~0.base_10|) |v_ULTIMATE.start_main_~#t1842~0.offset_9| 2)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t1842~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1842~0.base=|v_ULTIMATE.start_main_~#t1842~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t1842~0.offset=|v_ULTIMATE.start_main_~#t1842~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1842~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1842~0.offset] because there is no mapped edge [2019-12-27 22:12:41,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15) (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_35)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 22:12:41,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In472027451 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In472027451 256)))) (or (and (= ~x$w_buff1~0_In472027451 |P2Thread1of1ForFork1_#t~ite32_Out472027451|) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out472027451| ~x~0_In472027451) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In472027451, ~x$w_buff1_used~0=~x$w_buff1_used~0_In472027451, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In472027451, ~x~0=~x~0_In472027451} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out472027451|, ~x$w_buff1~0=~x$w_buff1~0_In472027451, ~x$w_buff1_used~0=~x$w_buff1_used~0_In472027451, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In472027451, ~x~0=~x~0_In472027451} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 22:12:41,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1279462671 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1279462671 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1279462671|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1279462671| ~x$w_buff0_used~0_In-1279462671)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1279462671, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1279462671} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1279462671, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1279462671|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1279462671} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 22:12:41,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: Formula: (= v_~x~0_19 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 22:12:41,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-503931968 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-503931968 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out-503931968| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-503931968 |P2Thread1of1ForFork1_#t~ite34_Out-503931968|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-503931968, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-503931968} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-503931968|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-503931968, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-503931968} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 22:12:41,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-831298511 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-831298511 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-831298511 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-831298511 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-831298511|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out-831298511| ~x$w_buff1_used~0_In-831298511)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-831298511, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-831298511, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-831298511, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-831298511} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-831298511, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-831298511, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-831298511, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-831298511|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-831298511} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 22:12:41,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In599821215 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In599821215 256)))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out599821215 0)) (and (= ~x$r_buff0_thd2~0_In599821215 ~x$r_buff0_thd2~0_Out599821215) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In599821215, ~x$w_buff0_used~0=~x$w_buff0_used~0_In599821215} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out599821215|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out599821215, ~x$w_buff0_used~0=~x$w_buff0_used~0_In599821215} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 22:12:41,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In886584743 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In886584743 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In886584743 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In886584743 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out886584743| ~x$r_buff1_thd2~0_In886584743)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out886584743| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In886584743, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In886584743, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In886584743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In886584743} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out886584743|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In886584743, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In886584743, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In886584743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In886584743} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 22:12:41,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L777-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_16 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 22:12:41,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1198464963 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-1198464963 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-1198464963 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1198464963 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-1198464963|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-1198464963 |P2Thread1of1ForFork1_#t~ite35_Out-1198464963|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1198464963, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1198464963, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1198464963, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1198464963} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1198464963|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1198464963, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1198464963, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1198464963, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1198464963} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 22:12:41,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1852135299 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1852135299 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out1852135299| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out1852135299| ~x$r_buff0_thd3~0_In1852135299)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1852135299, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1852135299} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1852135299|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1852135299, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1852135299} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 22:12:41,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L739-->L739-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1386597849 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In1386597849| |P0Thread1of1ForFork2_#t~ite11_Out1386597849|) (= |P0Thread1of1ForFork2_#t~ite12_Out1386597849| ~x$w_buff1~0_In1386597849)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1386597849 256)))) (or (= (mod ~x$w_buff0_used~0_In1386597849 256) 0) (and (= 0 (mod ~x$r_buff1_thd1~0_In1386597849 256)) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In1386597849 256)) .cse1))) (= ~x$w_buff1~0_In1386597849 |P0Thread1of1ForFork2_#t~ite11_Out1386597849|) .cse0 (= |P0Thread1of1ForFork2_#t~ite12_Out1386597849| |P0Thread1of1ForFork2_#t~ite11_Out1386597849|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1386597849, ~x$w_buff1~0=~x$w_buff1~0_In1386597849, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1386597849, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1386597849, ~weak$$choice2~0=~weak$$choice2~0_In1386597849, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In1386597849|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1386597849} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1386597849, ~x$w_buff1~0=~x$w_buff1~0_In1386597849, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1386597849, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1386597849, ~weak$$choice2~0=~weak$$choice2~0_In1386597849, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out1386597849|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out1386597849|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1386597849} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 22:12:41,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-119239483 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite15_Out-119239483| |P0Thread1of1ForFork2_#t~ite14_Out-119239483|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-119239483 256) 0))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-119239483 256) 0)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-119239483 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-119239483 256)))) (= ~x$w_buff0_used~0_In-119239483 |P0Thread1of1ForFork2_#t~ite14_Out-119239483|)) (and (= |P0Thread1of1ForFork2_#t~ite15_Out-119239483| ~x$w_buff0_used~0_In-119239483) (= |P0Thread1of1ForFork2_#t~ite14_In-119239483| |P0Thread1of1ForFork2_#t~ite14_Out-119239483|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-119239483, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-119239483, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-119239483, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-119239483|, ~weak$$choice2~0=~weak$$choice2~0_In-119239483, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-119239483} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-119239483, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-119239483, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-119239483|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-119239483, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-119239483|, ~weak$$choice2~0=~weak$$choice2~0_In-119239483, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-119239483} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 22:12:41,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_54 v_~x$r_buff0_thd1~0_53) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 22:12:41,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In399693804 256)))) (or (and (= ~x$r_buff1_thd1~0_In399693804 |P0Thread1of1ForFork2_#t~ite23_Out399693804|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In399693804 256) 0))) (or (= (mod ~x$w_buff0_used~0_In399693804 256) 0) (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In399693804 256))) (and .cse0 (= (mod ~x$w_buff1_used~0_In399693804 256) 0)))) .cse1 (= |P0Thread1of1ForFork2_#t~ite24_Out399693804| |P0Thread1of1ForFork2_#t~ite23_Out399693804|)) (and (= |P0Thread1of1ForFork2_#t~ite23_In399693804| |P0Thread1of1ForFork2_#t~ite23_Out399693804|) (not .cse1) (= ~x$r_buff1_thd1~0_In399693804 |P0Thread1of1ForFork2_#t~ite24_Out399693804|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In399693804, ~x$w_buff1_used~0=~x$w_buff1_used~0_In399693804, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In399693804, ~weak$$choice2~0=~weak$$choice2~0_In399693804, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In399693804|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In399693804} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In399693804, ~x$w_buff1_used~0=~x$w_buff1_used~0_In399693804, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In399693804, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out399693804|, ~weak$$choice2~0=~weak$$choice2~0_In399693804, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out399693804|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In399693804} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-27 22:12:41,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= v_~x$mem_tmp~0_4 v_~x~0_15) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 22:12:41,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1855764544 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1855764544 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In1855764544 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1855764544 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out1855764544| ~x$r_buff1_thd3~0_In1855764544) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out1855764544| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1855764544, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1855764544, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1855764544, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1855764544} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1855764544|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1855764544, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1855764544, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1855764544, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1855764544} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:12:41,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 22:12:41,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= 3 v_~__unbuffered_cnt~0_11)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 22:12:41,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite41_Out-595123666| |ULTIMATE.start_main_#t~ite42_Out-595123666|)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-595123666 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-595123666 256) 0))) (or (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite41_Out-595123666| ~x$w_buff1~0_In-595123666)) (and (= |ULTIMATE.start_main_#t~ite41_Out-595123666| ~x~0_In-595123666) .cse2 (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-595123666, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-595123666, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-595123666, ~x~0=~x~0_In-595123666} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-595123666|, ~x$w_buff1~0=~x$w_buff1~0_In-595123666, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-595123666, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-595123666, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-595123666|, ~x~0=~x~0_In-595123666} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 22:12:41,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1667952923 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1667952923 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out1667952923|)) (and (= |ULTIMATE.start_main_#t~ite43_Out1667952923| ~x$w_buff0_used~0_In1667952923) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1667952923, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1667952923} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1667952923, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1667952923|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1667952923} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 22:12:41,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-111710863 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-111710863 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-111710863 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-111710863 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-111710863|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-111710863 |ULTIMATE.start_main_#t~ite44_Out-111710863|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-111710863, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-111710863, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-111710863, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-111710863} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-111710863, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-111710863, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-111710863, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-111710863|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-111710863} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 22:12:41,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1274635185 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1274635185 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1274635185|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-1274635185 |ULTIMATE.start_main_#t~ite45_Out-1274635185|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1274635185, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1274635185} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1274635185, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1274635185|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1274635185} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 22:12:41,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-111763616 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-111763616 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-111763616 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-111763616 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-111763616|)) (and (= ~x$r_buff1_thd0~0_In-111763616 |ULTIMATE.start_main_#t~ite46_Out-111763616|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-111763616, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-111763616, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-111763616, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-111763616} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-111763616, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-111763616|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-111763616, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-111763616, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-111763616} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 22:12:41,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EBX~0_9 0) (= v_~__unbuffered_p0_EAX~0_9 2) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite46_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y~0_13 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_13} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_13, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:12:41,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:12:41 BasicIcfg [2019-12-27 22:12:41,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:12:41,953 INFO L168 Benchmark]: Toolchain (without parser) took 149407.78 ms. Allocated memory was 145.8 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 102.0 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 22:12:41,953 INFO L168 Benchmark]: CDTParser took 1.29 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 22:12:41,954 INFO L168 Benchmark]: CACSL2BoogieTranslator took 751.59 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.8 MB in the beginning and 157.7 MB in the end (delta: -55.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:12:41,954 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.19 ms. Allocated memory is still 203.9 MB. Free memory was 157.7 MB in the beginning and 155.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:12:41,955 INFO L168 Benchmark]: Boogie Preprocessor took 46.48 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:12:41,955 INFO L168 Benchmark]: RCFGBuilder took 780.42 ms. Allocated memory is still 203.9 MB. Free memory was 152.3 MB in the beginning and 105.7 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:12:41,956 INFO L168 Benchmark]: TraceAbstraction took 147763.74 ms. Allocated memory was 203.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 105.7 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 22:12:41,958 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.29 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 751.59 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.8 MB in the beginning and 157.7 MB in the end (delta: -55.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.19 ms. Allocated memory is still 203.9 MB. Free memory was 157.7 MB in the beginning and 155.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.48 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 780.42 ms. Allocated memory is still 203.9 MB. Free memory was 152.3 MB in the beginning and 105.7 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 147763.74 ms. Allocated memory was 203.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 105.7 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 163 ProgramPointsBefore, 84 ProgramPointsAfterwards, 194 TransitionsBefore, 93 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 6473 VarBasedMoverChecksPositive, 209 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75395 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t1840, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] FCALL, FORK 0 pthread_create(&t1841, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] FCALL, FORK 0 pthread_create(&t1842, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 3 __unbuffered_p2_EAX = y [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 __unbuffered_p0_EAX = y [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 147.4s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 87.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6204 SDtfs, 15684 SDslu, 35313 SDs, 0 SdLazy, 48260 SolverSat, 1559 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1373 GetRequests, 221 SyntacticMatches, 195 SemanticMatches, 957 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23148 ImplicationChecksByTransitivity, 34.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89162occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 277530 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1456 NumberOfCodeBlocks, 1456 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1369 ConstructedInterpolants, 0 QuantifiedInterpolants, 322893 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...