/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-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 05:27:09,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 05:27:09,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 05:27:09,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 05:27:09,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 05:27:09,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 05:27:09,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 05:27:09,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 05:27:09,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 05:27:09,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 05:27:09,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 05:27:09,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 05:27:09,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 05:27:09,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 05:27:09,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 05:27:09,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 05:27:09,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 05:27:09,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 05:27:09,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 05:27:09,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 05:27:09,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 05:27:09,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 05:27:09,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 05:27:09,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 05:27:09,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 05:27:09,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 05:27:09,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 05:27:09,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 05:27:09,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 05:27:09,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 05:27:09,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 05:27:09,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 05:27:09,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 05:27:09,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 05:27:09,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 05:27:09,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 05:27:09,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 05:27:09,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 05:27:09,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 05:27:09,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 05:27:09,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 05:27:09,214 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-NoLbe-MCR.epf [2019-12-28 05:27:09,242 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 05:27:09,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 05:27:09,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 05:27:09,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 05:27:09,245 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 05:27:09,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 05:27:09,245 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 05:27:09,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 05:27:09,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 05:27:09,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 05:27:09,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 05:27:09,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 05:27:09,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 05:27:09,248 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 05:27:09,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 05:27:09,248 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 05:27:09,248 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 05:27:09,248 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 05:27:09,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 05:27:09,249 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 05:27:09,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 05:27:09,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 05:27:09,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 05:27:09,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 05:27:09,250 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 05:27:09,250 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 05:27:09,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 05:27:09,250 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 05:27:09,250 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 05:27:09,251 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 05:27:09,252 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 05:27:09,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 05:27:09,589 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 05:27:09,602 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 05:27:09,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 05:27:09,607 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 05:27:09,608 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 05:27:09,609 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_power.opt.i [2019-12-28 05:27:09,684 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4f29251/2ec2a3d6193142519d5cb5a5eee84bb3/FLAG99e51fbc7 [2019-12-28 05:27:10,274 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 05:27:10,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.opt.i [2019-12-28 05:27:10,300 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4f29251/2ec2a3d6193142519d5cb5a5eee84bb3/FLAG99e51fbc7 [2019-12-28 05:27:10,571 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4f29251/2ec2a3d6193142519d5cb5a5eee84bb3 [2019-12-28 05:27:10,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 05:27:10,583 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 05:27:10,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 05:27:10,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 05:27:10,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 05:27:10,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:27:10" (1/1) ... [2019-12-28 05:27:10,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b535951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:10, skipping insertion in model container [2019-12-28 05:27:10,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:27:10" (1/1) ... [2019-12-28 05:27:10,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 05:27:10,657 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 05:27:11,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 05:27:11,171 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 05:27:11,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 05:27:11,350 INFO L208 MainTranslator]: Completed translation [2019-12-28 05:27:11,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:11 WrapperNode [2019-12-28 05:27:11,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 05:27:11,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 05:27:11,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 05:27:11,353 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 05:27:11,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:11" (1/1) ... [2019-12-28 05:27:11,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:11" (1/1) ... [2019-12-28 05:27:11,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 05:27:11,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 05:27:11,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 05:27:11,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 05:27:11,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:11" (1/1) ... [2019-12-28 05:27:11,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:11" (1/1) ... [2019-12-28 05:27:11,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:11" (1/1) ... [2019-12-28 05:27:11,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:11" (1/1) ... [2019-12-28 05:27:11,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:11" (1/1) ... [2019-12-28 05:27:11,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:11" (1/1) ... [2019-12-28 05:27:11,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:11" (1/1) ... [2019-12-28 05:27:11,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 05:27:11,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 05:27:11,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 05:27:11,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 05:27:11,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:11" (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-28 05:27:11,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 05:27:11,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 05:27:11,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 05:27:11,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 05:27:11,531 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 05:27:11,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 05:27:11,531 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 05:27:11,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 05:27:11,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 05:27:11,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 05:27:11,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 05:27:11,534 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 05:27:12,199 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 05:27:12,200 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 05:27:12,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:27:12 BoogieIcfgContainer [2019-12-28 05:27:12,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 05:27:12,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 05:27:12,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 05:27:12,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 05:27:12,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:27:10" (1/3) ... [2019-12-28 05:27:12,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d06870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:27:12, skipping insertion in model container [2019-12-28 05:27:12,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:11" (2/3) ... [2019-12-28 05:27:12,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d06870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:27:12, skipping insertion in model container [2019-12-28 05:27:12,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:27:12" (3/3) ... [2019-12-28 05:27:12,209 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_power.opt.i [2019-12-28 05:27:12,221 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 05:27:12,221 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 05:27:12,234 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 05:27:12,235 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 05:27:12,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,327 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,328 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,328 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,328 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,329 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,339 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,340 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,340 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,346 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,347 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:12,367 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 05:27:12,388 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 05:27:12,389 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 05:27:12,389 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 05:27:12,389 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 05:27:12,389 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 05:27:12,390 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 05:27:12,390 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 05:27:12,390 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 05:27:12,405 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 134 places, 162 transitions [2019-12-28 05:27:13,875 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25974 states. [2019-12-28 05:27:13,877 INFO L276 IsEmpty]: Start isEmpty. Operand 25974 states. [2019-12-28 05:27:13,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-28 05:27:13,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:13,888 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] [2019-12-28 05:27:13,888 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:13,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:13,895 INFO L82 PathProgramCache]: Analyzing trace with hash 310103372, now seen corresponding path program 1 times [2019-12-28 05:27:13,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:13,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544043057] [2019-12-28 05:27:13,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:14,275 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-28 05:27:14,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544043057] [2019-12-28 05:27:14,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:14,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:27:14,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1167441137] [2019-12-28 05:27:14,280 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:14,287 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:14,317 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 37 transitions. [2019-12-28 05:27:14,318 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:14,321 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:14,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:27:14,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:14,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:27:14,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:27:14,336 INFO L87 Difference]: Start difference. First operand 25974 states. Second operand 4 states. [2019-12-28 05:27:14,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:14,989 INFO L93 Difference]: Finished difference Result 26614 states and 102119 transitions. [2019-12-28 05:27:14,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 05:27:14,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-28 05:27:14,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:15,982 INFO L225 Difference]: With dead ends: 26614 [2019-12-28 05:27:15,983 INFO L226 Difference]: Without dead ends: 20358 [2019-12-28 05:27:15,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:27:16,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20358 states. [2019-12-28 05:27:16,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20358 to 20358. [2019-12-28 05:27:16,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20358 states. [2019-12-28 05:27:17,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20358 states to 20358 states and 78423 transitions. [2019-12-28 05:27:17,055 INFO L78 Accepts]: Start accepts. Automaton has 20358 states and 78423 transitions. Word has length 37 [2019-12-28 05:27:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:17,055 INFO L462 AbstractCegarLoop]: Abstraction has 20358 states and 78423 transitions. [2019-12-28 05:27:17,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:27:17,056 INFO L276 IsEmpty]: Start isEmpty. Operand 20358 states and 78423 transitions. [2019-12-28 05:27:17,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-28 05:27:17,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:17,069 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] [2019-12-28 05:27:17,069 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:17,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:17,070 INFO L82 PathProgramCache]: Analyzing trace with hash 2127220543, now seen corresponding path program 1 times [2019-12-28 05:27:17,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:17,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246410855] [2019-12-28 05:27:17,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:17,203 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-28 05:27:17,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246410855] [2019-12-28 05:27:17,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:17,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:27:17,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [848998622] [2019-12-28 05:27:17,205 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:17,216 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:17,222 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 45 transitions. [2019-12-28 05:27:17,222 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:17,223 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:17,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:27:17,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:17,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:27:17,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:27:17,226 INFO L87 Difference]: Start difference. First operand 20358 states and 78423 transitions. Second operand 5 states. [2019-12-28 05:27:18,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:18,226 INFO L93 Difference]: Finished difference Result 31836 states and 116040 transitions. [2019-12-28 05:27:18,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:27:18,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-28 05:27:18,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:18,388 INFO L225 Difference]: With dead ends: 31836 [2019-12-28 05:27:18,388 INFO L226 Difference]: Without dead ends: 31284 [2019-12-28 05:27:18,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:27:18,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31284 states. [2019-12-28 05:27:20,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31284 to 29703. [2019-12-28 05:27:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29703 states. [2019-12-28 05:27:20,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29703 states to 29703 states and 109517 transitions. [2019-12-28 05:27:20,636 INFO L78 Accepts]: Start accepts. Automaton has 29703 states and 109517 transitions. Word has length 45 [2019-12-28 05:27:20,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:20,639 INFO L462 AbstractCegarLoop]: Abstraction has 29703 states and 109517 transitions. [2019-12-28 05:27:20,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:27:20,639 INFO L276 IsEmpty]: Start isEmpty. Operand 29703 states and 109517 transitions. [2019-12-28 05:27:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-28 05:27:20,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:20,645 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] [2019-12-28 05:27:20,646 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:20,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:20,646 INFO L82 PathProgramCache]: Analyzing trace with hash -370499147, now seen corresponding path program 1 times [2019-12-28 05:27:20,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:20,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397388380] [2019-12-28 05:27:20,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 05:27:20,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397388380] [2019-12-28 05:27:20,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:20,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:27:20,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [438672009] [2019-12-28 05:27:20,762 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:20,768 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:20,778 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 118 transitions. [2019-12-28 05:27:20,778 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:20,782 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:27:20,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:27:20,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:20,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:27:20,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:27:20,783 INFO L87 Difference]: Start difference. First operand 29703 states and 109517 transitions. Second operand 5 states. [2019-12-28 05:27:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:21,371 INFO L93 Difference]: Finished difference Result 38694 states and 139689 transitions. [2019-12-28 05:27:21,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:27:21,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-28 05:27:21,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:21,496 INFO L225 Difference]: With dead ends: 38694 [2019-12-28 05:27:21,496 INFO L226 Difference]: Without dead ends: 38246 [2019-12-28 05:27:21,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:27:22,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38246 states. [2019-12-28 05:27:22,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38246 to 32949. [2019-12-28 05:27:22,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32949 states. [2019-12-28 05:27:24,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32949 states to 32949 states and 120526 transitions. [2019-12-28 05:27:24,367 INFO L78 Accepts]: Start accepts. Automaton has 32949 states and 120526 transitions. Word has length 46 [2019-12-28 05:27:24,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:24,368 INFO L462 AbstractCegarLoop]: Abstraction has 32949 states and 120526 transitions. [2019-12-28 05:27:24,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:27:24,368 INFO L276 IsEmpty]: Start isEmpty. Operand 32949 states and 120526 transitions. [2019-12-28 05:27:24,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 05:27:24,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:24,375 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] [2019-12-28 05:27:24,376 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:24,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:24,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1101725263, now seen corresponding path program 1 times [2019-12-28 05:27:24,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:24,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437727641] [2019-12-28 05:27:24,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:24,442 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-28 05:27:24,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437727641] [2019-12-28 05:27:24,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:24,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 05:27:24,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1847116783] [2019-12-28 05:27:24,443 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:24,449 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:24,461 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 93 states and 136 transitions. [2019-12-28 05:27:24,461 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:24,462 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:27:24,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 05:27:24,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:24,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 05:27:24,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 05:27:24,463 INFO L87 Difference]: Start difference. First operand 32949 states and 120526 transitions. Second operand 3 states. [2019-12-28 05:27:24,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:24,668 INFO L93 Difference]: Finished difference Result 42410 states and 152017 transitions. [2019-12-28 05:27:24,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 05:27:24,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-28 05:27:24,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:24,775 INFO L225 Difference]: With dead ends: 42410 [2019-12-28 05:27:24,775 INFO L226 Difference]: Without dead ends: 42410 [2019-12-28 05:27:24,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-28 05:27:25,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42410 states. [2019-12-28 05:27:25,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42410 to 37663. [2019-12-28 05:27:25,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37663 states. [2019-12-28 05:27:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37663 states to 37663 states and 136330 transitions. [2019-12-28 05:27:26,044 INFO L78 Accepts]: Start accepts. Automaton has 37663 states and 136330 transitions. Word has length 48 [2019-12-28 05:27:26,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:26,044 INFO L462 AbstractCegarLoop]: Abstraction has 37663 states and 136330 transitions. [2019-12-28 05:27:26,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 05:27:26,044 INFO L276 IsEmpty]: Start isEmpty. Operand 37663 states and 136330 transitions. [2019-12-28 05:27:26,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 05:27:26,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:26,058 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] [2019-12-28 05:27:26,058 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:26,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:26,058 INFO L82 PathProgramCache]: Analyzing trace with hash -929169210, now seen corresponding path program 1 times [2019-12-28 05:27:26,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:26,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426119730] [2019-12-28 05:27:26,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:26,145 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-28 05:27:26,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426119730] [2019-12-28 05:27:26,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:26,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:27:26,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [878432058] [2019-12-28 05:27:26,146 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:26,155 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:26,172 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 113 states and 172 transitions. [2019-12-28 05:27:26,172 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:26,286 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 05:27:26,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 05:27:26,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:26,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 05:27:26,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:27:26,287 INFO L87 Difference]: Start difference. First operand 37663 states and 136330 transitions. Second operand 8 states. [2019-12-28 05:27:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:27,451 INFO L93 Difference]: Finished difference Result 48754 states and 172979 transitions. [2019-12-28 05:27:27,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 05:27:27,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-28 05:27:27,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:27,724 INFO L225 Difference]: With dead ends: 48754 [2019-12-28 05:27:27,725 INFO L226 Difference]: Without dead ends: 48234 [2019-12-28 05:27:27,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 05:27:28,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48234 states. [2019-12-28 05:27:30,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48234 to 38227. [2019-12-28 05:27:30,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38227 states. [2019-12-28 05:27:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38227 states to 38227 states and 138493 transitions. [2019-12-28 05:27:30,381 INFO L78 Accepts]: Start accepts. Automaton has 38227 states and 138493 transitions. Word has length 52 [2019-12-28 05:27:30,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:30,381 INFO L462 AbstractCegarLoop]: Abstraction has 38227 states and 138493 transitions. [2019-12-28 05:27:30,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 05:27:30,381 INFO L276 IsEmpty]: Start isEmpty. Operand 38227 states and 138493 transitions. [2019-12-28 05:27:30,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 05:27:30,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:30,399 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] [2019-12-28 05:27:30,399 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:30,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:30,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2144383564, now seen corresponding path program 1 times [2019-12-28 05:27:30,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:30,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064423391] [2019-12-28 05:27:30,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:30,538 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-28 05:27:30,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064423391] [2019-12-28 05:27:30,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:30,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:27:30,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1552572522] [2019-12-28 05:27:30,541 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:30,550 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:30,561 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 56 transitions. [2019-12-28 05:27:30,562 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:30,563 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:30,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:27:30,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:30,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:27:30,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:27:30,565 INFO L87 Difference]: Start difference. First operand 38227 states and 138493 transitions. Second operand 6 states. [2019-12-28 05:27:31,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:31,365 INFO L93 Difference]: Finished difference Result 53003 states and 189569 transitions. [2019-12-28 05:27:31,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:27:31,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-28 05:27:31,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:31,865 INFO L225 Difference]: With dead ends: 53003 [2019-12-28 05:27:31,866 INFO L226 Difference]: Without dead ends: 52027 [2019-12-28 05:27:31,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:27:32,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52027 states. [2019-12-28 05:27:32,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52027 to 48780. [2019-12-28 05:27:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48780 states. [2019-12-28 05:27:35,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48780 states to 48780 states and 175224 transitions. [2019-12-28 05:27:35,015 INFO L78 Accepts]: Start accepts. Automaton has 48780 states and 175224 transitions. Word has length 52 [2019-12-28 05:27:35,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:35,015 INFO L462 AbstractCegarLoop]: Abstraction has 48780 states and 175224 transitions. [2019-12-28 05:27:35,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:27:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand 48780 states and 175224 transitions. [2019-12-28 05:27:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 05:27:35,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:35,035 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] [2019-12-28 05:27:35,035 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:35,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:35,036 INFO L82 PathProgramCache]: Analyzing trace with hash 347432205, now seen corresponding path program 1 times [2019-12-28 05:27:35,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:35,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989216738] [2019-12-28 05:27:35,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:35,149 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-28 05:27:35,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989216738] [2019-12-28 05:27:35,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:35,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 05:27:35,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [322077566] [2019-12-28 05:27:35,150 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:35,155 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:35,161 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 56 transitions. [2019-12-28 05:27:35,162 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:35,162 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:35,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:27:35,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:35,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:27:35,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:27:35,163 INFO L87 Difference]: Start difference. First operand 48780 states and 175224 transitions. Second operand 7 states. [2019-12-28 05:27:36,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:36,340 INFO L93 Difference]: Finished difference Result 70895 states and 244521 transitions. [2019-12-28 05:27:36,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 05:27:36,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-28 05:27:36,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:36,499 INFO L225 Difference]: With dead ends: 70895 [2019-12-28 05:27:36,499 INFO L226 Difference]: Without dead ends: 70895 [2019-12-28 05:27:36,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 05:27:37,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70895 states. [2019-12-28 05:27:37,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70895 to 57888. [2019-12-28 05:27:37,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57888 states. [2019-12-28 05:27:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57888 states to 57888 states and 203148 transitions. [2019-12-28 05:27:37,929 INFO L78 Accepts]: Start accepts. Automaton has 57888 states and 203148 transitions. Word has length 52 [2019-12-28 05:27:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:37,930 INFO L462 AbstractCegarLoop]: Abstraction has 57888 states and 203148 transitions. [2019-12-28 05:27:37,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:27:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 57888 states and 203148 transitions. [2019-12-28 05:27:37,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 05:27:37,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:37,944 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] [2019-12-28 05:27:37,944 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:37,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:37,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1234935886, now seen corresponding path program 1 times [2019-12-28 05:27:37,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:37,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661507694] [2019-12-28 05:27:37,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:38,393 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-28 05:27:38,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661507694] [2019-12-28 05:27:38,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:38,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:27:38,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1715520150] [2019-12-28 05:27:38,394 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:38,403 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:38,412 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 56 transitions. [2019-12-28 05:27:38,413 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:38,421 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 05:27:38,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:27:38,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:38,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:27:38,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:27:38,423 INFO L87 Difference]: Start difference. First operand 57888 states and 203148 transitions. Second operand 5 states. [2019-12-28 05:27:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:38,528 INFO L93 Difference]: Finished difference Result 10858 states and 33393 transitions. [2019-12-28 05:27:38,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 05:27:38,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-28 05:27:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:38,550 INFO L225 Difference]: With dead ends: 10858 [2019-12-28 05:27:38,550 INFO L226 Difference]: Without dead ends: 9359 [2019-12-28 05:27:38,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:27:38,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9359 states. [2019-12-28 05:27:38,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9359 to 9311. [2019-12-28 05:27:38,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9311 states. [2019-12-28 05:27:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9311 states to 9311 states and 28343 transitions. [2019-12-28 05:27:38,738 INFO L78 Accepts]: Start accepts. Automaton has 9311 states and 28343 transitions. Word has length 52 [2019-12-28 05:27:38,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:38,739 INFO L462 AbstractCegarLoop]: Abstraction has 9311 states and 28343 transitions. [2019-12-28 05:27:38,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:27:38,739 INFO L276 IsEmpty]: Start isEmpty. Operand 9311 states and 28343 transitions. [2019-12-28 05:27:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-28 05:27:38,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:38,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:38,745 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:38,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:38,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1215430140, now seen corresponding path program 1 times [2019-12-28 05:27:38,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:38,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274913957] [2019-12-28 05:27:38,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:38,837 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-28 05:27:38,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274913957] [2019-12-28 05:27:38,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:38,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:27:38,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [235335905] [2019-12-28 05:27:38,840 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:38,851 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:38,882 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 131 states and 198 transitions. [2019-12-28 05:27:38,883 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:38,884 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:27:38,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:27:38,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:38,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:27:38,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:27:38,885 INFO L87 Difference]: Start difference. First operand 9311 states and 28343 transitions. Second operand 4 states. [2019-12-28 05:27:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:39,036 INFO L93 Difference]: Finished difference Result 10886 states and 33035 transitions. [2019-12-28 05:27:39,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 05:27:39,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-28 05:27:39,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:39,051 INFO L225 Difference]: With dead ends: 10886 [2019-12-28 05:27:39,051 INFO L226 Difference]: Without dead ends: 10886 [2019-12-28 05:27:39,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-28 05:27:39,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10886 states. [2019-12-28 05:27:39,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10886 to 9878. [2019-12-28 05:27:39,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9878 states. [2019-12-28 05:27:39,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9878 states to 9878 states and 30014 transitions. [2019-12-28 05:27:39,174 INFO L78 Accepts]: Start accepts. Automaton has 9878 states and 30014 transitions. Word has length 62 [2019-12-28 05:27:39,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:39,174 INFO L462 AbstractCegarLoop]: Abstraction has 9878 states and 30014 transitions. [2019-12-28 05:27:39,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:27:39,174 INFO L276 IsEmpty]: Start isEmpty. Operand 9878 states and 30014 transitions. [2019-12-28 05:27:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-28 05:27:39,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:39,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:39,180 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:39,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:39,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1336726821, now seen corresponding path program 1 times [2019-12-28 05:27:39,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:39,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154612810] [2019-12-28 05:27:39,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:39,253 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-28 05:27:39,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154612810] [2019-12-28 05:27:39,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:39,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:27:39,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2043528234] [2019-12-28 05:27:39,254 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:39,263 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:39,287 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 131 states and 198 transitions. [2019-12-28 05:27:39,288 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:39,289 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:27:39,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:27:39,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:39,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:27:39,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:27:39,290 INFO L87 Difference]: Start difference. First operand 9878 states and 30014 transitions. Second operand 6 states. [2019-12-28 05:27:39,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:39,935 INFO L93 Difference]: Finished difference Result 12784 states and 38224 transitions. [2019-12-28 05:27:39,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 05:27:39,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-28 05:27:39,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:39,954 INFO L225 Difference]: With dead ends: 12784 [2019-12-28 05:27:39,954 INFO L226 Difference]: Without dead ends: 12736 [2019-12-28 05:27:39,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-28 05:27:39,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12736 states. [2019-12-28 05:27:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12736 to 10617. [2019-12-28 05:27:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10617 states. [2019-12-28 05:27:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10617 states to 10617 states and 32067 transitions. [2019-12-28 05:27:40,099 INFO L78 Accepts]: Start accepts. Automaton has 10617 states and 32067 transitions. Word has length 62 [2019-12-28 05:27:40,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:40,099 INFO L462 AbstractCegarLoop]: Abstraction has 10617 states and 32067 transitions. [2019-12-28 05:27:40,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:27:40,099 INFO L276 IsEmpty]: Start isEmpty. Operand 10617 states and 32067 transitions. [2019-12-28 05:27:40,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-28 05:27:40,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:40,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:40,106 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:40,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:40,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1540685473, now seen corresponding path program 1 times [2019-12-28 05:27:40,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:40,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043547684] [2019-12-28 05:27:40,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:40,151 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-28 05:27:40,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043547684] [2019-12-28 05:27:40,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:40,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 05:27:40,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2116647939] [2019-12-28 05:27:40,152 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:40,161 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:40,172 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 64 transitions. [2019-12-28 05:27:40,173 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:40,173 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:40,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 05:27:40,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:40,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 05:27:40,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 05:27:40,174 INFO L87 Difference]: Start difference. First operand 10617 states and 32067 transitions. Second operand 3 states. [2019-12-28 05:27:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:40,497 INFO L93 Difference]: Finished difference Result 11193 states and 33595 transitions. [2019-12-28 05:27:40,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 05:27:40,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-28 05:27:40,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:40,513 INFO L225 Difference]: With dead ends: 11193 [2019-12-28 05:27:40,513 INFO L226 Difference]: Without dead ends: 11193 [2019-12-28 05:27:40,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 05:27:40,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11193 states. [2019-12-28 05:27:40,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11193 to 10905. [2019-12-28 05:27:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10905 states. [2019-12-28 05:27:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10905 states to 10905 states and 32831 transitions. [2019-12-28 05:27:40,653 INFO L78 Accepts]: Start accepts. Automaton has 10905 states and 32831 transitions. Word has length 64 [2019-12-28 05:27:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:40,653 INFO L462 AbstractCegarLoop]: Abstraction has 10905 states and 32831 transitions. [2019-12-28 05:27:40,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 05:27:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 10905 states and 32831 transitions. [2019-12-28 05:27:40,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-28 05:27:40,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:40,661 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:40,661 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:40,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:40,662 INFO L82 PathProgramCache]: Analyzing trace with hash 536523870, now seen corresponding path program 1 times [2019-12-28 05:27:40,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:40,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102679299] [2019-12-28 05:27:40,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:40,739 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-28 05:27:40,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102679299] [2019-12-28 05:27:40,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:40,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:27:40,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [632013919] [2019-12-28 05:27:40,741 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:40,751 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:40,763 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 64 transitions. [2019-12-28 05:27:40,763 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:40,764 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:40,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:27:40,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:40,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:27:40,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:27:40,765 INFO L87 Difference]: Start difference. First operand 10905 states and 32831 transitions. Second operand 4 states. [2019-12-28 05:27:41,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:41,060 INFO L93 Difference]: Finished difference Result 13607 states and 40433 transitions. [2019-12-28 05:27:41,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 05:27:41,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-28 05:27:41,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:41,089 INFO L225 Difference]: With dead ends: 13607 [2019-12-28 05:27:41,089 INFO L226 Difference]: Without dead ends: 13607 [2019-12-28 05:27:41,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:27:41,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13607 states. [2019-12-28 05:27:41,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13607 to 12461. [2019-12-28 05:27:41,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12461 states. [2019-12-28 05:27:41,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12461 states to 12461 states and 37122 transitions. [2019-12-28 05:27:41,262 INFO L78 Accepts]: Start accepts. Automaton has 12461 states and 37122 transitions. Word has length 64 [2019-12-28 05:27:41,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:41,262 INFO L462 AbstractCegarLoop]: Abstraction has 12461 states and 37122 transitions. [2019-12-28 05:27:41,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:27:41,263 INFO L276 IsEmpty]: Start isEmpty. Operand 12461 states and 37122 transitions. [2019-12-28 05:27:41,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:27:41,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:41,273 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:27:41,273 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:41,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:41,273 INFO L82 PathProgramCache]: Analyzing trace with hash 762121994, now seen corresponding path program 1 times [2019-12-28 05:27:41,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:41,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52039044] [2019-12-28 05:27:41,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:41,385 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-28 05:27:41,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52039044] [2019-12-28 05:27:41,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:41,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:27:41,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [808096308] [2019-12-28 05:27:41,386 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:41,395 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:41,405 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:27:41,405 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:41,405 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:41,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:27:41,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:41,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:27:41,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:27:41,406 INFO L87 Difference]: Start difference. First operand 12461 states and 37122 transitions. Second operand 6 states. [2019-12-28 05:27:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:41,921 INFO L93 Difference]: Finished difference Result 13732 states and 40361 transitions. [2019-12-28 05:27:41,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:27:41,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-28 05:27:41,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:41,940 INFO L225 Difference]: With dead ends: 13732 [2019-12-28 05:27:41,940 INFO L226 Difference]: Without dead ends: 13732 [2019-12-28 05:27:41,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:27:41,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13732 states. [2019-12-28 05:27:42,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13732 to 13246. [2019-12-28 05:27:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13246 states. [2019-12-28 05:27:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13246 states to 13246 states and 39077 transitions. [2019-12-28 05:27:42,111 INFO L78 Accepts]: Start accepts. Automaton has 13246 states and 39077 transitions. Word has length 66 [2019-12-28 05:27:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:42,111 INFO L462 AbstractCegarLoop]: Abstraction has 13246 states and 39077 transitions. [2019-12-28 05:27:42,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:27:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 13246 states and 39077 transitions. [2019-12-28 05:27:42,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:27:42,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:42,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:42,124 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:42,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:42,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1315087349, now seen corresponding path program 1 times [2019-12-28 05:27:42,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:42,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205273095] [2019-12-28 05:27:42,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:42,238 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-28 05:27:42,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205273095] [2019-12-28 05:27:42,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:42,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:27:42,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [300816297] [2019-12-28 05:27:42,240 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:42,250 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:42,264 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:27:42,264 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:42,264 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:42,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:27:42,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:42,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:27:42,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:27:42,265 INFO L87 Difference]: Start difference. First operand 13246 states and 39077 transitions. Second operand 6 states. [2019-12-28 05:27:42,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:42,810 INFO L93 Difference]: Finished difference Result 15569 states and 44587 transitions. [2019-12-28 05:27:42,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 05:27:42,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-28 05:27:42,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:42,829 INFO L225 Difference]: With dead ends: 15569 [2019-12-28 05:27:42,829 INFO L226 Difference]: Without dead ends: 15569 [2019-12-28 05:27:42,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-28 05:27:42,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-12-28 05:27:42,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 13820. [2019-12-28 05:27:42,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13820 states. [2019-12-28 05:27:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13820 states to 13820 states and 39927 transitions. [2019-12-28 05:27:42,995 INFO L78 Accepts]: Start accepts. Automaton has 13820 states and 39927 transitions. Word has length 66 [2019-12-28 05:27:42,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:42,995 INFO L462 AbstractCegarLoop]: Abstraction has 13820 states and 39927 transitions. [2019-12-28 05:27:42,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:27:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 13820 states and 39927 transitions. [2019-12-28 05:27:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:27:43,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:43,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:43,008 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:43,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:43,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1103736436, now seen corresponding path program 1 times [2019-12-28 05:27:43,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:43,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160981486] [2019-12-28 05:27:43,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:43,080 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-28 05:27:43,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160981486] [2019-12-28 05:27:43,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:43,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:27:43,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1084196545] [2019-12-28 05:27:43,081 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:43,091 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:43,103 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:27:43,104 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:43,104 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:43,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:27:43,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:43,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:27:43,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:27:43,105 INFO L87 Difference]: Start difference. First operand 13820 states and 39927 transitions. Second operand 5 states. [2019-12-28 05:27:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:43,424 INFO L93 Difference]: Finished difference Result 17381 states and 50006 transitions. [2019-12-28 05:27:43,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 05:27:43,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-28 05:27:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:43,448 INFO L225 Difference]: With dead ends: 17381 [2019-12-28 05:27:43,448 INFO L226 Difference]: Without dead ends: 17381 [2019-12-28 05:27:43,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:27:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17381 states. [2019-12-28 05:27:43,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17381 to 14858. [2019-12-28 05:27:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14858 states. [2019-12-28 05:27:43,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14858 states to 14858 states and 42559 transitions. [2019-12-28 05:27:43,642 INFO L78 Accepts]: Start accepts. Automaton has 14858 states and 42559 transitions. Word has length 66 [2019-12-28 05:27:43,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:43,643 INFO L462 AbstractCegarLoop]: Abstraction has 14858 states and 42559 transitions. [2019-12-28 05:27:43,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:27:43,643 INFO L276 IsEmpty]: Start isEmpty. Operand 14858 states and 42559 transitions. [2019-12-28 05:27:43,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:27:43,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:43,655 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:43,655 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:43,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:43,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1614270613, now seen corresponding path program 1 times [2019-12-28 05:27:43,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:43,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598613838] [2019-12-28 05:27:43,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:43,720 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-28 05:27:43,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598613838] [2019-12-28 05:27:43,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:43,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:27:43,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [750881531] [2019-12-28 05:27:43,722 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:43,748 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:43,761 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:27:43,761 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:43,762 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:43,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:27:43,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:43,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:27:43,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:27:43,763 INFO L87 Difference]: Start difference. First operand 14858 states and 42559 transitions. Second operand 5 states. [2019-12-28 05:27:44,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:44,191 INFO L93 Difference]: Finished difference Result 19763 states and 56506 transitions. [2019-12-28 05:27:44,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:27:44,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-28 05:27:44,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:44,218 INFO L225 Difference]: With dead ends: 19763 [2019-12-28 05:27:44,218 INFO L226 Difference]: Without dead ends: 19763 [2019-12-28 05:27:44,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:27:44,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19763 states. [2019-12-28 05:27:44,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19763 to 15763. [2019-12-28 05:27:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15763 states. [2019-12-28 05:27:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15763 states to 15763 states and 45145 transitions. [2019-12-28 05:27:44,449 INFO L78 Accepts]: Start accepts. Automaton has 15763 states and 45145 transitions. Word has length 66 [2019-12-28 05:27:44,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:44,449 INFO L462 AbstractCegarLoop]: Abstraction has 15763 states and 45145 transitions. [2019-12-28 05:27:44,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:27:44,449 INFO L276 IsEmpty]: Start isEmpty. Operand 15763 states and 45145 transitions. [2019-12-28 05:27:44,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:27:44,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:44,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:44,459 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:44,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:44,460 INFO L82 PathProgramCache]: Analyzing trace with hash 873242220, now seen corresponding path program 1 times [2019-12-28 05:27:44,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:44,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770118924] [2019-12-28 05:27:44,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:44,661 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-28 05:27:44,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770118924] [2019-12-28 05:27:44,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:44,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:27:44,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1625202209] [2019-12-28 05:27:44,662 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:44,685 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:44,699 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:27:44,699 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:44,700 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:44,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:27:44,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:44,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:27:44,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:27:44,701 INFO L87 Difference]: Start difference. First operand 15763 states and 45145 transitions. Second operand 4 states. [2019-12-28 05:27:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:45,203 INFO L93 Difference]: Finished difference Result 20659 states and 59353 transitions. [2019-12-28 05:27:45,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 05:27:45,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-28 05:27:45,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:45,230 INFO L225 Difference]: With dead ends: 20659 [2019-12-28 05:27:45,230 INFO L226 Difference]: Without dead ends: 20383 [2019-12-28 05:27:45,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-28 05:27:45,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20383 states. [2019-12-28 05:27:45,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20383 to 18946. [2019-12-28 05:27:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18946 states. [2019-12-28 05:27:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18946 states to 18946 states and 54434 transitions. [2019-12-28 05:27:45,480 INFO L78 Accepts]: Start accepts. Automaton has 18946 states and 54434 transitions. Word has length 66 [2019-12-28 05:27:45,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:45,481 INFO L462 AbstractCegarLoop]: Abstraction has 18946 states and 54434 transitions. [2019-12-28 05:27:45,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:27:45,481 INFO L276 IsEmpty]: Start isEmpty. Operand 18946 states and 54434 transitions. [2019-12-28 05:27:45,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:27:45,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:45,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:45,492 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:45,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:45,493 INFO L82 PathProgramCache]: Analyzing trace with hash -923709139, now seen corresponding path program 1 times [2019-12-28 05:27:45,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:45,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277746475] [2019-12-28 05:27:45,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:45,612 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-28 05:27:45,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277746475] [2019-12-28 05:27:45,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:45,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 05:27:45,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [701863726] [2019-12-28 05:27:45,614 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:45,624 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:45,648 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:27:45,648 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:45,648 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:45,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:27:45,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:45,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:27:45,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:27:45,649 INFO L87 Difference]: Start difference. First operand 18946 states and 54434 transitions. Second operand 7 states. [2019-12-28 05:27:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:46,199 INFO L93 Difference]: Finished difference Result 17840 states and 48888 transitions. [2019-12-28 05:27:46,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 05:27:46,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-28 05:27:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:46,224 INFO L225 Difference]: With dead ends: 17840 [2019-12-28 05:27:46,224 INFO L226 Difference]: Without dead ends: 17840 [2019-12-28 05:27:46,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-28 05:27:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17840 states. [2019-12-28 05:27:46,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17840 to 12474. [2019-12-28 05:27:46,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12474 states. [2019-12-28 05:27:46,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12474 states to 12474 states and 34351 transitions. [2019-12-28 05:27:46,398 INFO L78 Accepts]: Start accepts. Automaton has 12474 states and 34351 transitions. Word has length 66 [2019-12-28 05:27:46,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:46,398 INFO L462 AbstractCegarLoop]: Abstraction has 12474 states and 34351 transitions. [2019-12-28 05:27:46,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:27:46,398 INFO L276 IsEmpty]: Start isEmpty. Operand 12474 states and 34351 transitions. [2019-12-28 05:27:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:27:46,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:46,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:46,406 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:46,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:46,406 INFO L82 PathProgramCache]: Analyzing trace with hash -36205458, now seen corresponding path program 1 times [2019-12-28 05:27:46,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:46,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712887559] [2019-12-28 05:27:46,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:46,492 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-28 05:27:46,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712887559] [2019-12-28 05:27:46,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:46,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:27:46,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2007259310] [2019-12-28 05:27:46,494 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:46,507 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:46,522 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:27:46,522 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:46,522 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:46,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:27:46,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:46,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:27:46,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:27:46,525 INFO L87 Difference]: Start difference. First operand 12474 states and 34351 transitions. Second operand 5 states. [2019-12-28 05:27:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:46,579 INFO L93 Difference]: Finished difference Result 4023 states and 9370 transitions. [2019-12-28 05:27:46,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 05:27:46,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-28 05:27:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:46,584 INFO L225 Difference]: With dead ends: 4023 [2019-12-28 05:27:46,585 INFO L226 Difference]: Without dead ends: 3350 [2019-12-28 05:27:46,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:27:46,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2019-12-28 05:27:46,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 3090. [2019-12-28 05:27:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3090 states. [2019-12-28 05:27:46,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 7076 transitions. [2019-12-28 05:27:46,631 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 7076 transitions. Word has length 66 [2019-12-28 05:27:46,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:46,631 INFO L462 AbstractCegarLoop]: Abstraction has 3090 states and 7076 transitions. [2019-12-28 05:27:46,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:27:46,631 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 7076 transitions. [2019-12-28 05:27:46,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 05:27:46,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:46,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:46,647 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:46,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:46,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1721997520, now seen corresponding path program 1 times [2019-12-28 05:27:46,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:46,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739789305] [2019-12-28 05:27:46,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:46,769 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-28 05:27:46,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739789305] [2019-12-28 05:27:46,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:46,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 05:27:46,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1409793938] [2019-12-28 05:27:46,770 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:46,785 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:46,870 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 281 transitions. [2019-12-28 05:27:46,871 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:46,928 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-28 05:27:46,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 05:27:46,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:46,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 05:27:46,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-28 05:27:46,930 INFO L87 Difference]: Start difference. First operand 3090 states and 7076 transitions. Second operand 10 states. [2019-12-28 05:27:48,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:48,591 INFO L93 Difference]: Finished difference Result 6377 states and 14423 transitions. [2019-12-28 05:27:48,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-28 05:27:48,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2019-12-28 05:27:48,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:48,600 INFO L225 Difference]: With dead ends: 6377 [2019-12-28 05:27:48,600 INFO L226 Difference]: Without dead ends: 6330 [2019-12-28 05:27:48,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-12-28 05:27:48,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6330 states. [2019-12-28 05:27:48,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6330 to 3414. [2019-12-28 05:27:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3414 states. [2019-12-28 05:27:48,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3414 states to 3414 states and 7811 transitions. [2019-12-28 05:27:48,649 INFO L78 Accepts]: Start accepts. Automaton has 3414 states and 7811 transitions. Word has length 83 [2019-12-28 05:27:48,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:48,649 INFO L462 AbstractCegarLoop]: Abstraction has 3414 states and 7811 transitions. [2019-12-28 05:27:48,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 05:27:48,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3414 states and 7811 transitions. [2019-12-28 05:27:48,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 05:27:48,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:48,654 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:48,654 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:48,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:48,654 INFO L82 PathProgramCache]: Analyzing trace with hash -355211823, now seen corresponding path program 1 times [2019-12-28 05:27:48,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:48,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054977371] [2019-12-28 05:27:48,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:48,771 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-28 05:27:48,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054977371] [2019-12-28 05:27:48,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:48,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:27:48,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1274399523] [2019-12-28 05:27:48,773 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:48,793 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:48,888 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 281 transitions. [2019-12-28 05:27:48,889 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:48,908 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 05:27:48,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:27:48,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:48,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:27:48,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:27:48,910 INFO L87 Difference]: Start difference. First operand 3414 states and 7811 transitions. Second operand 7 states. [2019-12-28 05:27:48,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:48,990 INFO L93 Difference]: Finished difference Result 5783 states and 13274 transitions. [2019-12-28 05:27:48,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 05:27:48,991 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-28 05:27:48,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:48,995 INFO L225 Difference]: With dead ends: 5783 [2019-12-28 05:27:48,995 INFO L226 Difference]: Without dead ends: 2442 [2019-12-28 05:27:48,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-28 05:27:48,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2019-12-28 05:27:49,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2401. [2019-12-28 05:27:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2019-12-28 05:27:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 5493 transitions. [2019-12-28 05:27:49,017 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 5493 transitions. Word has length 83 [2019-12-28 05:27:49,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:49,017 INFO L462 AbstractCegarLoop]: Abstraction has 2401 states and 5493 transitions. [2019-12-28 05:27:49,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:27:49,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 5493 transitions. [2019-12-28 05:27:49,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 05:27:49,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:49,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:49,020 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:49,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:49,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2146119358, now seen corresponding path program 1 times [2019-12-28 05:27:49,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:49,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087567380] [2019-12-28 05:27:49,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:49,085 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-28 05:27:49,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087567380] [2019-12-28 05:27:49,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:49,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:27:49,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [166363048] [2019-12-28 05:27:49,086 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:49,103 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:49,164 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 175 transitions. [2019-12-28 05:27:49,164 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:49,282 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 05:27:49,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 05:27:49,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:49,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 05:27:49,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-28 05:27:49,283 INFO L87 Difference]: Start difference. First operand 2401 states and 5493 transitions. Second operand 9 states. [2019-12-28 05:27:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:49,907 INFO L93 Difference]: Finished difference Result 2583 states and 5664 transitions. [2019-12-28 05:27:49,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 05:27:49,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-12-28 05:27:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:49,911 INFO L225 Difference]: With dead ends: 2583 [2019-12-28 05:27:49,911 INFO L226 Difference]: Without dead ends: 2583 [2019-12-28 05:27:49,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-12-28 05:27:49,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-12-28 05:27:49,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1724. [2019-12-28 05:27:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2019-12-28 05:27:49,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 3736 transitions. [2019-12-28 05:27:49,932 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 3736 transitions. Word has length 83 [2019-12-28 05:27:49,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:49,932 INFO L462 AbstractCegarLoop]: Abstraction has 1724 states and 3736 transitions. [2019-12-28 05:27:49,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 05:27:49,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 3736 transitions. [2019-12-28 05:27:49,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 05:27:49,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:49,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:49,935 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:49,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:49,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1743706764, now seen corresponding path program 2 times [2019-12-28 05:27:49,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:49,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294807937] [2019-12-28 05:27:49,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:50,072 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-28 05:27:50,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294807937] [2019-12-28 05:27:50,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:50,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:27:50,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [575433258] [2019-12-28 05:27:50,073 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:50,091 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:50,159 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 219 transitions. [2019-12-28 05:27:50,159 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:50,320 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-28 05:27:50,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-28 05:27:50,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:50,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-28 05:27:50,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-28 05:27:50,322 INFO L87 Difference]: Start difference. First operand 1724 states and 3736 transitions. Second operand 13 states. [2019-12-28 05:27:51,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:51,749 INFO L93 Difference]: Finished difference Result 2754 states and 5950 transitions. [2019-12-28 05:27:51,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-28 05:27:51,749 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 83 [2019-12-28 05:27:51,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:51,753 INFO L225 Difference]: With dead ends: 2754 [2019-12-28 05:27:51,753 INFO L226 Difference]: Without dead ends: 2706 [2019-12-28 05:27:51,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=623, Unknown=0, NotChecked=0, Total=870 [2019-12-28 05:27:51,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2019-12-28 05:27:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 1653. [2019-12-28 05:27:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1653 states. [2019-12-28 05:27:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 3543 transitions. [2019-12-28 05:27:51,774 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 3543 transitions. Word has length 83 [2019-12-28 05:27:51,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:51,774 INFO L462 AbstractCegarLoop]: Abstraction has 1653 states and 3543 transitions. [2019-12-28 05:27:51,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-28 05:27:51,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 3543 transitions. [2019-12-28 05:27:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 05:27:51,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:51,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:51,777 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:51,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:51,777 INFO L82 PathProgramCache]: Analyzing trace with hash 474051189, now seen corresponding path program 2 times [2019-12-28 05:27:51,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:51,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011464525] [2019-12-28 05:27:51,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:51,919 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-28 05:27:51,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011464525] [2019-12-28 05:27:51,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:51,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 05:27:51,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1513643462] [2019-12-28 05:27:51,920 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:51,942 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:52,017 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 219 transitions. [2019-12-28 05:27:52,017 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:52,123 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 05:27:52,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-28 05:27:52,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:52,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-28 05:27:52,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-28 05:27:52,125 INFO L87 Difference]: Start difference. First operand 1653 states and 3543 transitions. Second operand 13 states. [2019-12-28 05:27:54,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:54,514 INFO L93 Difference]: Finished difference Result 6993 states and 15167 transitions. [2019-12-28 05:27:54,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-28 05:27:54,514 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 83 [2019-12-28 05:27:54,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:54,520 INFO L225 Difference]: With dead ends: 6993 [2019-12-28 05:27:54,520 INFO L226 Difference]: Without dead ends: 4328 [2019-12-28 05:27:54,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=320, Invalid=1572, Unknown=0, NotChecked=0, Total=1892 [2019-12-28 05:27:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4328 states. [2019-12-28 05:27:54,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4328 to 1702. [2019-12-28 05:27:54,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-28 05:27:54,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3597 transitions. [2019-12-28 05:27:54,546 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3597 transitions. Word has length 83 [2019-12-28 05:27:54,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:54,547 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3597 transitions. [2019-12-28 05:27:54,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-28 05:27:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3597 transitions. [2019-12-28 05:27:54,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 05:27:54,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:54,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:54,549 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:54,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1193195599, now seen corresponding path program 3 times [2019-12-28 05:27:54,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:54,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345926602] [2019-12-28 05:27:54,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 05:27:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 05:27:54,649 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 05:27:54,649 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 05:27:54,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 05:27:54 BasicIcfg [2019-12-28 05:27:54,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 05:27:54,823 INFO L168 Benchmark]: Toolchain (without parser) took 44239.89 ms. Allocated memory was 149.4 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 104.7 MB in the beginning and 890.9 MB in the end (delta: -786.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-28 05:27:54,823 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 149.4 MB. Free memory was 125.8 MB in the beginning and 125.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-28 05:27:54,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.02 ms. Allocated memory was 149.4 MB in the beginning and 231.2 MB in the end (delta: 81.8 MB). Free memory was 104.5 MB in the beginning and 195.3 MB in the end (delta: -90.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-28 05:27:54,825 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.22 ms. Allocated memory is still 231.2 MB. Free memory was 195.3 MB in the beginning and 192.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-28 05:27:54,826 INFO L168 Benchmark]: Boogie Preprocessor took 35.72 ms. Allocated memory is still 231.2 MB. Free memory was 192.7 MB in the beginning and 190.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-28 05:27:54,829 INFO L168 Benchmark]: RCFGBuilder took 738.82 ms. Allocated memory is still 231.2 MB. Free memory was 190.2 MB in the beginning and 149.1 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. [2019-12-28 05:27:54,829 INFO L168 Benchmark]: TraceAbstraction took 42617.88 ms. Allocated memory was 231.2 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 149.1 MB in the beginning and 890.9 MB in the end (delta: -741.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-28 05:27:54,838 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 149.4 MB. Free memory was 125.8 MB in the beginning and 125.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.02 ms. Allocated memory was 149.4 MB in the beginning and 231.2 MB in the end (delta: 81.8 MB). Free memory was 104.5 MB in the beginning and 195.3 MB in the end (delta: -90.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.22 ms. Allocated memory is still 231.2 MB. Free memory was 195.3 MB in the beginning and 192.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.72 ms. Allocated memory is still 231.2 MB. Free memory was 192.7 MB in the beginning and 190.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 738.82 ms. Allocated memory is still 231.2 MB. Free memory was 190.2 MB in the beginning and 149.1 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42617.88 ms. Allocated memory was 231.2 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 149.1 MB in the beginning and 890.9 MB in the end (delta: -741.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L699] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L701] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L703] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L704] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L705] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L706] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L707] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0] [L708] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0] [L709] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L710] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L711] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L712] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L713] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L714] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L715] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L718] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L719] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L789] 0 pthread_t t2563; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L790] FCALL, FORK 0 pthread_create(&t2563, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L791] 0 pthread_t t2564; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L792] FCALL, FORK 0 pthread_create(&t2564, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=0] [L758] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L759] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L760] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L761] 2 x$r_buff0_thd2 = (_Bool)1 [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L732] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L732] 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) [L733] 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=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L767] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L733] 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)) [L734] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L734] 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)) [L735] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L735] 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)) [L736] 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=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L736] 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)) [L737] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L737] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L738] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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$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)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L740] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L740] 1 x = x$flush_delayed ? x$mem_tmp : x [L741] 1 x$flush_delayed = (_Bool)0 [L746] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L767] 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) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 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 [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 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 [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 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 [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 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) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L800] 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 [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 42.2s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 18.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6457 SDtfs, 10086 SDslu, 15010 SDs, 0 SdLazy, 7266 SolverSat, 641 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 90 SyntacticMatches, 12 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57888occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 65811 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1596 NumberOfCodeBlocks, 1596 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1489 ConstructedInterpolants, 0 QuantifiedInterpolants, 255325 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...